A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by ReversalsPublished by Springer Nature ,2003
- A Simpler 1.5-Approximation Algorithm for Sorting by TranspositionsPublished by Springer Nature ,2003
- Signed Genome Rearrangement by Reversals and Transpositions: Models and ApproximationsPublished by Springer Nature ,1999
- 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
- Tricircular mitochondrial genomes ofBrassicaandRaphanus: reversal of repeat configurations by inversitonNucleic Acids Research, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985