Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 12 (1) , 91-110
- https://doi.org/10.1137/s089548019731994x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Sorting Permutations by Reversals and Eulerian Cycle DecompositionsSIAM Journal on Discrete Mathematics, 1999
- On the Tightness of the Alternating-Cycle Lower Bound for Sorting by ReversalsJournal of Combinatorial Optimization, 1999
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Analytical approaches to genomic evolutionBiochimie, 1993
- Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome.Proceedings of the National Academy of Sciences, 1992
- The chromosome inversion problemJournal of Theoretical Biology, 1982
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981