(1+ε)-Approximation of Sorting by Reversals and Transpositions
- 17 August 2001
- book chapter
- Published by Springer Nature
- p. 227-237
- https://doi.org/10.1007/3-540-44696-6_18
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Genome rearrangements and sorting by reversalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A 2-approximation algorithm for genome rearrangements by reversals and transpositionsTheoretical Computer Science, 1999
- Sorting Permutations by Reversals and Eulerian Cycle DecompositionsSIAM Journal on Discrete Mathematics, 1999
- Sorting by TranspositionsSIAM Journal on Discrete Mathematics, 1998
- Faster and simpler algorithm for sorting signed permutations by reversalsPublished by Association for Computing Machinery (ACM) ,1997
- Transforming cabbage into turnipPublished by Association for Computing Machinery (ACM) ,1995
- Plant mitochondrial DNA evolved rapidly in structure, but slowly in sequenceJournal of Molecular Evolution, 1988