Transforming cabbage into turnip
- 1 January 1999
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 46 (1) , 1-27
- https://doi.org/10.1145/300515.300516
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Sorting by TranspositionsSIAM Journal on Discrete Mathematics, 1998
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Fast sorting by reversalPublished by Springer Nature ,1996
- Genome Sequence Comparison and Scenarios for Gene Rearrangements: A Test CaseGenomics, 1995
- Polynomial-time algorithm for computing translocation distance between genomesPublished by Springer Nature ,1995
- On sorting by prefix reversals and the diameter of pancake networksPublished by Springer Nature ,1993
- 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