Towards Constructing Optimal Strip Move Sequences

  • Meena Mahajan
  • Raghavan Rama
  • S. Vijayakumar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3106)


The Sorting by Strip Moves problem, SBSM, was introduced in [6] as a variant of the well-known Sorting by Transpositions problem. A restriction called Block Sorting was shown in [2] to be NP-hard. In this article, we improve upon the ideas used in [6] to obtain a combinatorial characterization of the optimal solutions of SBSM. Using this, we show that a strip move which results in a permutation of two or three fewer strips or which exchanges a pair of adjacent strips to merge them into a single strip necessarily reduces the strip move distance. We also establish that the strip move diameter for permutations of size n is n–1. Further, we exhibit an optimum-preserving equivalence between SBSM and the Common Substring Removals problem (CSR) – a natural combinatorial puzzle. As a consequence, we show that sorting a permutation via strip moves is as hard (or as easy) as sorting its inverse.


Single Edge Identity Permutation Order Graph Single Strip Inclusion Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bafna, V., Pevzner, P.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11(2), 224–240 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bein, W.W., Larmore, L.L., Latifi, S., Sudborough, I.H.: Block sorting is hard. International Journal of Foundations of Computer Science 14(3), 425–437 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Christie, D.A.: Genome Rearrangement Problems. PhD thesis, Univ. of Glasgow (1999)Google Scholar
  4. 4.
    Hartman, T.: A simpler 1.5 approximation algorithm 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)CrossRefGoogle Scholar
  5. 5.
    Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180–210 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Mahajan, M., Rama, R., Raman, V., Vijayakumar, S.: Merging and sorting by strip moves. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 314–325. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Pevzner, P.: Computational Molecular Biology: An Algorithmic Approach. MIT Press, Cambridge (2000)zbMATHGoogle Scholar
  8. 8.
    Vijayakumar, S.: Sorting with Transpositions. PhD thesis, Indian Institute of Technology, Madras (April 2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Meena Mahajan
    • 1
  • Raghavan Rama
    • 2
  • S. Vijayakumar
    • 1
  1. 1.The Institute of Mathematical SciencesChennaiIndia
  2. 2.Department of MathematicsIndian Institute of Technology, MadrasChennaiIndia

Personalised recommendations