A 1.5-approximation algorithm for sorting by transpositions and transreversals
- 1 May 2005
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 70 (3) , 300-320
- https://doi.org/10.1016/j.jcss.2004.12.006
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A 1.375-Approximation Algorithm for Sorting by TranspositionsPublished by Springer Nature ,2005
- A 1.5-Approximation Algorithm for Sorting by Transpositions and TransreversalsPublished by Springer Nature ,2004
- Signed genome rearrangement by reversals and transpositions: models and approximationsTheoretical Computer Science, 2001
- 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
- Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related generaJournal of Molecular Evolution, 1994
- Tricircular mitochondrial genomes ofBrassicaandRaphanus: reversal of repeat configurations by inversitonNucleic Acids Research, 1986