90 search results - page 3 / 18 » Perfect Sorting by Reversals |
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
WCRE
2006
IEEE
13 years 11 months ago
2006
IEEE
JCSS
2008
13 years 5 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
JDA
2008
13 years 5 months ago
2008
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
RECOMB
2006
Springer
14 years 6 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...