Fast sorting by reversal
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 168-185
- https://doi.org/10.1007/3-540-61258-0_14
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Genome rearrangements and sorting by reversalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Transforming men into mice (polynomial algorithm for genomic distance problem)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Open combinatorial problems in computational molecular biologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- [26] Genomic divergence through gene rearrangementPublished by Elsevier ,1990
- Plant mitochondrial DNA evolved rapidly in structure, but slowly in sequenceJournal of Molecular Evolution, 1988
- Mitochondrial DNA rearrangements and transcriptional alterations in the male-sterile cytoplasm of Ogura radish.Molecular and Cellular Biology, 1988
- Sorting by insertion of leading elementsJournal of Combinatorial Theory, Series A, 1987
- The complexity of finding minimum-length generator sequencesTheoretical Computer Science, 1985
- The minimum-length generator sequence problem is NP-hardJournal of Algorithms, 1981
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979