On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals
Author:
- 1 July 1999
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 3 (2-3) , 149-182
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Formulations and hardness of multiple sorting by reversals1999
- A column-generation based branch-and-bound algorithm for sorting by reversals1999
- Sorting Permutations by Reversals and Eulerian Cycle DecompositionsSIAM Journal on Discrete Mathematics, 1999
- Faster and simpler algorithm for sorting signed permutations by reversals1997
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Fast sorting by reversal1996
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Transforming cabbage into turnip1995
- Efficient bounds for oriented chromosome inversion distance1994