A 2-approximation algorithm for sorting by prefix reversals

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 415-425

  Fischer, Johannes ^a   Ginzinger, Simon W ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; APPROXIMATION RATIO; IDENTITY PERMUTATION; PROBLEM COMPLEXITY;

ALGORITHMS;

EID: 27144507488     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_38     Document Type: Conference Paper

References (14)

1. V. Bafna, P. A. Pevzner: Genome Rearrangements and Sorting by Reversals. SIAM J. on Computing, 25(2): 272-289, 1996.
2. V. Bafna, P. A. Pevzner: Sorting by Transpositions SIAM J. on Discrete Mathematics 11(2), 224-240, 1998.
3. P. Berman, S. Hannenhalli, M. Karpinski: 1.375-Approximation Algorithm for Sorting by Reversals. Proc. ESA'02, Lecture Notes in Computer Science 2461: 200-210, 2002.
4. A. Caprara: Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM J. on Discrete Mathematics 12(1): 91-110, 1999.
5. D.S. Cohen, M. Blum: On the Problem of Sorting Burnt Pancakes. Discrete Applied Mathematics 61: 105-120, 1995.
6. Z. Dias, J. Meidanis: Sorting by Prefix Transpositions. Proc. SPIRE'02, Lecture Notes in Computer Science 2476: 65-76, 2002.
7. W. H. Gates, C. H. Papadimitriou: Bounds for Sorting by Prefix Reversals. Discrete Mathematics 27: 47-57, 1979.
8. S. Hannehalli, P. Pevzner: TO CUT ... OR NOT TO CUT (Applications of Comparative Physical Maps in Molecular Evolution). Proceedings of the 7th ACM Symposium on Discrete Algorithms (SODA'96), 304-313, 1996.
9. S. Hannenhalli, P. A. Pevzner. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. J. of the ACM 46(1): 1-27, 1999.
10. T. Hartman, R. Shamir: A Simpler 1.5-Approximation Algorithms for Sorting by Transpositions, Proc. CPM'03, Lecture Notes in Computer Science 2676, 156-169, 2003.
11. M. H. Heydari, I. H. Sudborough: On the Diameter of the Pancake Network. J. of Algorithms 25: 67-94, 1997.
12. M. H. Heydari. The Pancake Problem. PhD-thesis, University of Wisconsin at Whitewater, 1993.
13. J. Kececioglu, D. Sankoff. Efficient Bounds for Oriented Chromosome Inversion Distance. Proc. CPM'94, Lecture Notes in Computer Science 807: 307-325, 1994.
14. J. Kececioglu, D. Sankoff. Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangements. Algorithmica 13: 180-210, 1995.