1.375-Approximation Algorithm for Sorting by Reversals
- 29 August 2002
- book chapter
- Published by Springer Nature
- p. 200-210
- https://doi.org/10.1007/3-540-45749-6_21
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On Some Tighter Inapproximability Results (Extended Abstract)Published by Springer Nature ,1999
- Faster and simpler algorithm for sorting signed permutations by reversalsPublished by Association for Computing Machinery (ACM) ,1997
- Sorting by reversals is difficultPublished by Association for Computing Machinery (ACM) ,1997
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- Fast sorting by reversalPublished by Springer Nature ,1996
- On the problem of sorting burnt pancakesDiscrete Applied Mathematics, 1995
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangementAlgorithmica, 1995
- Transforming cabbage into turnipPublished by Association for Computing Machinery (ACM) ,1995
- Reversing trains: A turn of the century sorting problemJournal of Algorithms, 1989
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979