Prefix Reversals on Binary and Ternary Strings

Given a permutation p, the application of prefix reversal f (i) to p reverses the order of the first i elements of p. 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.

[1]  Leo van Iersel,et al.  Prefix Reversals on Binary and Ternary Strings , 2007, SIAM J. Discret. Math..

[2]  Manuel Blum,et al.  on the Problem of Sorting Burnt Pancakes , 1995, Discret. Appl. Math..

[3]  Petr Kolman,et al.  Minimum Common String Partition Problem: Hardness and Approximations , 2004, Electron. J. Comb..

[4]  Pavel A. Pevzner,et al.  Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals , 1999, J. ACM.

[5]  Johannes Fischer,et al.  A 2-Approximation Algorithm for Sorting by Prefix Reversals , 2005, ESA.

[6]  Jens Stoye,et al.  On Sorting by Translocations , 2005, RECOMB.

[7]  Ivan Hal Sudborough,et al.  On the Diameter of the Pancake Network , 1997, J. Algorithms.

[8]  Tao Jiang,et al.  Computing the Assignment of Orthologous Genes via Genome Rearrangement , 2005, APBC.

[9]  Enno Ohlebusch,et al.  Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions , 2006, RECOMB.

[10]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[11]  Ivan Hal Sudborough,et al.  Comparing Star and Pancake Networks , 2002, The Essence of Computation.

[12]  A. J. Radcliffe,et al.  Reversals and Transpositions Over Finite Alphabets , 2005 .

[13]  Xin Chen,et al.  Assignment of orthologous genes via genome rearrangement , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Tzvika Hartman,et al.  A 1.375-Approximation Algorithm for Sorting by Transpositions , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[16]  Henrik Eriksson,et al.  Sorting a bridge hand , 2001, Discret. Math..

[17]  V. Rich.  Personal communication , 1989, Nature.

[18]  Robert W. Irving,et al.  Sorting Strings by Reversals and by Transpositions , 2001, SIAM J. Discret. Math..

[19]  David A. Schmidt,et al.  The essence of computation: complexity, analysis, transformation , 2002 .

[20]  Christos H. Papadimitriou,et al.  Bounds for sorting by prefix reversal , 1979, Discret. Math..