Sciweavers

STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 8 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
CIBCB
2005
IEEE
13 years 10 months ago
Heuristic Algorithm for Computing Reversal Distance with MultiGene Families via Binary Integer Programming
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
Jakkarin Suksawatchon, Chidchanok Lursinsap, Mikae...