A 1.375-Approximation Algorithm for Sorting by Transpositions
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 204-215
- https://doi.org/10.1007/11557067_17
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Sorting by Reversals in Subquadratic TimePublished by Springer Nature ,2004
- Sorting a bridge handDiscrete Mathematics, 2001
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyJournal of Computational Biology, 2001
- Signed genome rearrangement by reversals and transpositions: models and approximationsTheoretical Computer Science, 2001
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- Sorting Permutations by Reversals and Eulerian Cycle DecompositionsSIAM Journal on Discrete Mathematics, 1999
- Transforming cabbage into turnipJournal of the ACM, 1999
- Sorting by TranspositionsSIAM Journal on Discrete Mathematics, 1998
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Tricircular mitochondrial genomes ofBrassicaandRaphanus: reversal of repeat configurations by inversitonNucleic Acids Research, 1986