A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
Top Cited Papers
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 29 (3) , 880-892
- https://doi.org/10.1137/s0097539798334207
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Transforming cabbage into turnipJournal of the ACM, 1999
- Polynomial-time algorithm for computing translocation distance between genomesDiscrete Applied Mathematics, 1996
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related generaJournal of Molecular Evolution, 1994
- Plant mitochondrial DNA evolved rapidly in structure, but slowly in sequenceJournal of Molecular Evolution, 1988
- Evolutionary significance of inversions in legume chloroplast DNAsCurrent Genetics, 1988
- Unicircular structure of the Brassica hirta mitochondrial genomeCurrent Genetics, 1987
- Tricircular mitochondrial genomes ofBrassicaandRaphanus: reversal of repeat configurations by inversitonNucleic Acids Research, 1986
- Zum Hilbertschen Aufbau der reellen ZahlenMathematische Annalen, 1928