Sorting permutations by block-interchanges
- 1 November 1996
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 60 (4) , 165-169
- https://doi.org/10.1016/s0020-0190(96)00155-x
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- 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