Strip Exchanging Is Hard

The sorting by strip exchanges (aka strip exchanging) problem is motivated by applications in optical character recognition and genome rearrangement analysis. While a couple of approximation algorithms have been designed for the problem, nothing has been known about its computational hardness till date. In this work, we show that the decision version of strip exchanging is NP-Complete. We present a few new lower bounds for the problem along with the stated result. The NP-Completeness proof is based on reducing sorting by strip moves, an already known NP-Complete problem, to strip exchanging. The former is a widely studied problem also motivated by optical character recognition and genome rearrangement analysis.

[1]  Ron Shamir,et al.  A simpler and faster 1.5-approximation algorithm for sorting by transpositions , 2006, Inf. Comput..

[2]  Vineet Bafna,et al.  Sorting by Transpositions , 1998, SIAM J. Discret. Math..

[3]  Lawrence L. Larmore,et al.  A Faster and Simpler 2-Approximation Algorithm for Block Sorting , 2005, FCT.

[4]  Chuan Yi Tang,et al.  An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio Species , 2005, J. Comput. Biol..

[5]  Marek Karpinski,et al.  1.375-Approximation Algorithm for Sorting by Reversals , 2002, ESA.

[6]  Raghavan Rama,et al.  Towards Constructing Optimal Strip Move Sequences , 2004, COCOON.

[7]  Marek Karpinski,et al.  .375-approximation Algorithm for Sorting by Reversals , 2011 .

[8]  Raghavan Rama,et al.  Merging and Sorting By Strip Moves , 2003, FSTTCS.

[9]  Alberto Caprara,et al.  Sorting by reversals is difficult , 1997, RECOMB '97.

[10]  Shahram Latifi,et al.  Block sorting is hard , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[11]  David A. Christie,et al.  Sorting Permutations by Block-Interchanges , 1996, Inf. Process. Lett..

[12]  Raghavan Rama,et al.  Block Sorting: A Characterization and some Heuristics , 2007, Nord. J. Comput..

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

[14]  Vineet Bafna,et al.  Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..

[15]  Swapnoneel Roy,et al.  Approximate strip exchanging , 2008, Int. J. Comput. Biol. Drug Des..

[16]  David A. Christie,et al.  A 3/2-approximation algorithm for sorting by reversals , 1998, SODA '98.

[17]  Jon Bentley,et al.  Programming pearls: how to sort , 1984, CACM.