Abstract
Given a permutation π, the application of prefix reversal f (i) to π reverses the order of the first i elements of π. The problem of Sorting By Prefix Reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (Bounds for sorting by prefix reversal, Discrete Mathematics 27, pp. 47-57), asks for the minimum number of prefix reversals required to sort the elements of a given permutation. In this paper we study a variant of this problem where the prefix reversals act not on permutations but on strings over a fixed size alphabet. We determine the minimum number of prefix reversals required to sort binary and ternary strings, with polynomial-time algorithms for these sorting problems as a result; demonstrate that computing the minimum prefix reversal distance between two binary strings is NP-hard; give an exact expression for the prefix reversal diameter of binary strings, and give bounds on the prefix reversal diameter of ternary strings. We also consider a weaker form of sorting called grouping (of identical symbols) and give polynomial-time algorithms for optimally grouping binary and ternary strings. A number of intriguing open problems are also discussed.
This research has been funded by the Dutch BSIK/BRICKS project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bader, M., Ohlebusch, E.: Sorting by weighted reversals, transpositions, and inverted transpositions. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P., Waterman, M. (eds.) RECOMB 2006. LNCS (LNBI), vol. 3909, pp. 563–577. Springer, Heidelberg (2006)
Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. J. Comp. Biol. 13(2), 567–578 (2006)
Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement, IEEE/ACM Trans. Comput. Biol. Bioinform. 2(4) (October- December 2005)
Christie, D.A., Irving, R.W.: Sorting strings by reversals and transpositions. SIAM J. on Discrete Math. 14(2), 193–206 (2001)
Cohen, D.S., Blum, M.: On the problem of sorting burnt pancakes. Discrete Appl. Math. 61(2), 105–120 (1995)
Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Trans. Comput. Biology Bioinform. 3(4), 369–379 (2006)
Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., Wastlund, J.: Sorting a bridge hand. Discrete Math. 241, 289–300 (2001)
Fischer, J., Ginzinger, S.W.: A 2-approximation algorithm for sorting by prefix reversals. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 415–425. Springer, Heidelberg (2005)
Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397–411 (1975)
Garey, M.R., Johnson, D.S.: Computers And Intractability: A Guide To The Theory Of NP-completeness. W.H. Freeman, San Francisco, CA (1979)
Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discrete Math. 27, 47–57 (1979)
Goldstein, A., Kolman, P., Zheng, J.: Minimum Common String Partition problem: hardness and approximations, Electron. J. Combin. 12, #R50 (2005)
Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: a polynomial algorithm for sorting permutations by reversals. Jour. ACM 46(1), 1–27 (1999)
Heydari, M.H., Sudborough, I.H.: On the diameter of the pancake network. J. Algorithms 25, 67–94 (1997)
Hurkens, C.A.J., van Iersel, L.J.J., Keijsper, J.C.M., Kelk, S.M., Stougie, L., Tromp, J.T.: Prefix reversals on binary and ternary strings, technical report (2006), http://www.win.tue.nl/bs/spor/2006-10.pdf
Morales, L., Sudborough, I.H.: Comparing Star and Pancake Networks. In: Mogensen, T.Æ., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 18–36. Springer, Heidelberg (2002)
Radcliffe, A.J., Scott, A.D., Wilmer, E.L.: Reversals and transpositions over finite alphabets. SIAM J. on Discrete Math. 19(1), 224–244 (2005)
Scott, A.D.: Personal communication
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hurkens, C., van Iersel, L., Keijsper, J., Kelk, S., Stougie, L., Tromp, J. (2007). Prefix Reversals on Binary and Ternary Strings. In: Anai, H., Horimoto, K., Kutsia, T. (eds) Algebraic Biology. AB 2007. Lecture Notes in Computer Science, vol 4545. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73433-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-73433-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73432-1
Online ISBN: 978-3-540-73433-8
eBook Packages: Computer ScienceComputer Science (R0)