Genome rearrangements and sorting by reversals
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 10, 148-157
- https://doi.org/10.1109/sfcs.1993.366872
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- DNA physical mapping and alternating Eulerian cycles in colored graphsAlgorithmica, 1995
- Evolution and Taxonomy of Positive-Strand RNA Viruses: Implications of Comparative Analysis of Amino Acid SequencesCritical Reviews in Biochemistry and Molecular Biology, 1993
- Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome.Proceedings of the National Academy of Sciences, 1992
- Chloroplast DNA Evidence on the Ancient Evolutionary Split in Vascular Land PlantsScience, 1992
- Reversing trains: A turn of the century sorting problemJournal of Algorithms, 1989
- Sorting by insertion of leading elementsJournal of Combinatorial Theory, Series A, 1987
- The complexity of finding minimum-length generator sequencesTheoretical Computer Science, 1985
- The chromosome inversion problemJournal of Theoretical Biology, 1982
- The minimum-length generator sequence problem is NP-hardJournal of Algorithms, 1981
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979