A 2-Approximation Algorithm for Sorting by Prefix Reversals
Sorting by Prefix Reversals, also known as Pancake Flipping, is the problem of transforming a given permutation into the identity permutation, where the only allowed operations are reversals of a prefix of the permutation. The problem complexity is still unknown, and no algorithm with an approximation ratio better than 3 is known. We present the first polynomial-time 2-approximation algorithm to solve this problem. Empirical tests suggest that the average performance is in fact better than 2.
KeywordsApproximation Ratio Identity Permutation Blue Edge Breakpoint Graph Reversal Distance
Unable to display preview. Download preview PDF.
- 8.Hannehalli, S., Pevzner, P.: TO CUT ... OR NOT TO CUT (Applications of Comparative Physical Maps in Molecular Evolution). In: Proceedings of the 7th ACM Symposium on Discrete Algorithms (SODA 1996), pp. 304–313 (1996)Google Scholar
- 12.Heydari, M.H.: The Pancake Problem. PhD-thesis, University of Wisconsin at Whitewater (1993)Google Scholar
- 13.Kececioglu, J., Sankoff, D.: Efficient Bounds for Oriented Chromosome Inversion Distance. In: CPM 1994. LNCS, vol. 807, pp. 307–325. Springer, Heidelberg (1994)Google Scholar