Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- 1 February 1995
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 13 (1-2) , 180-210
- https://doi.org/10.1007/bf01188586
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Genome rearrangements and sorting by reversalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A local algorithm for DNA sequence alignment with inversionsBulletin of Mathematical Biology, 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
- Computing short generator sequencesInformation and Computation, 1987
- The complexity of finding minimum-length generator sequencesTheoretical Computer Science, 1985
- Sequence and gene organization of mouse mitochondrial DNACell, 1981
- The minimum-length generator sequence problem is NP-hardJournal of Algorithms, 1981
- Polynomial-time algorithms for permutation groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979