A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
- 27 May 2003
- book chapter
- Published by Springer Nature
- p. 156-169
- https://doi.org/10.1007/3-540-44888-8_12
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- 1.375-Approximation Algorithm for Sorting by ReversalsPublished by Springer Nature ,2002
- 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
- A Very Elementary Presentation of the Hannenhalli-Pevzner TheoryPublished by Springer Nature ,2001
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- 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
- 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