Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bafna, V., Pevzner, P.A.: Genome Rearrangements and Sorting by Reversals. SIAM J. on Computing 25(2), 272–289 (1996)
Bafna, V., Pevzner, P.A.: Sorting by Transpositions. SIAM J. on Discrete Mathematics 11(2), 224–240 (1998)
Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-Approximation Algorithm for Sorting by Reversals. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 200–210. Springer, Heidelberg (2002)
Caprara, A.: Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM J. on Discrete Mathematics 12(1), 91–110 (1999)
Cohen, D.S., Blum, M.: On the Problem of Sorting Burnt Pancakes. Discrete Applied Mathematics 61, 105–120 (1995)
Dias, Z., Meidanis, J.: Sorting by Prefix Transpositions. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 65–76. Springer, Heidelberg (2002)
Gates, W.H., Papadimitriou, C.H.: Bounds for Sorting by Prefix Reversals. Discrete Mathematics 27, 47–57 (1979)
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)
Hannenhalli, S., Pevzner, P.A.: Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. J. of the ACM 46(1), 1–27 (1999)
Hartman, T., Shamir, R.: A Simpler 1.5-Approximation Algorithms for Sorting by Transpositions. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 156–169. Springer, Heidelberg (2003)
Heydari, M.H., Sudborough, I.H.: On the Diameter of the Pancake Network. J. of Algorithms 25, 67–94 (1997)
Heydari, M.H.: The Pancake Problem. PhD-thesis, University of Wisconsin at Whitewater (1993)
Kececioglu, J., Sankoff, D.: Efficient Bounds for Oriented Chromosome Inversion Distance. In: CPM 1994. LNCS, vol. 807, pp. 307–325. Springer, Heidelberg (1994)
Kececioglu, J., Sankoff, D.: Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangements. Algorithmica 13, 180–210 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischer, J., Ginzinger, S.W. (2005). A 2-Approximation Algorithm for Sorting by Prefix Reversals. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_38
Download citation
DOI: https://doi.org/10.1007/11561071_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)