Prefix Reversals on Binary and Ternary Strings

  title={Prefix Reversals on Binary and Ternary Strings},
  author={Cor A. J. Hurkens and Leo van Iersel and Judith Keijsper and Steven Kelk and Leen Stougie and John Tromp},
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… CONTINUE READING

From This Paper

Figures and tables from this paper.


Publications citing this paper.
Showing 1-6 of 6 extracted citations

Bounding Prefix Transposition Distance for Strings and Permutations

Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008) • 2008
View 4 Excerpts
Highly Influenced

Algorithms , Haplotypes and Phylogenetic Networks

Phylogenetic Networks, Dr J C M Keijsper


Publications referenced by this paper.
Showing 1-10 of 18 references

Bounds for sorting by prefix reversal

Discrete Mathematics • 1979
View 4 Excerpts
Highly Influenced

A 1.375-Approximation Algorithm for Sorting by Transpositions

IEEE/ACM Transactions on Computational Biology and Bioinformatics • 2006

Assignment of orthologous genes via genome rearrangement

IEEE/ACM Transactions on Computational Biology and Bioinformatics • 2005
View 1 Excerpt

Ginzinger, A 2-approximation algorithm for sorting by prefix reversals

S.W.J. Fischer
Proceedings of ESA 2005: 13th Annual European Symposium, LLNCS • 2005
View 1 Excerpt

hardness and approximations, Electron

A. Goldstein, P. Kolman, J. Zheng, Minimum Common String Partition problem
J. Combin., 12, #R50 • 2005
View 1 Excerpt

Similar Papers

Loading similar papers…