Merging and Sorting By Strip Moves
We consider two problems related to the well-studied sorting by transpositions problem: (1) Given a permutation, sort it by moving a minimum number of strips, where a strip is a maximal substring of the permutation which is also a substring of the identity permutation, and (2) Given a set of increasing sequences of distinct elements, merge them into one increasing sequence with a minimum number of strip moves. We show that the merging by strip moves problem has a polynomial time algorithm. Using this, we give a 2-approximation algorithm for the sorting by strip moves problem. We also observe that the sorting by strip moves problem, as well as the sorting by transpositions problem, are fixed-parameter-tractable.
KeywordsNaive Algorithm Maximal Substring Unit Edge Sorting Sequence Extra Move
Unable to display preview. Download preview PDF.
- 5.Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow (1999)Google Scholar
- 7.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1997)Google Scholar
- 10.Fellows, M.R., Hallett, M.T., Wareham, H.T.: DNA physical mapping: 3 ways difficult. In: Proceedings of the European Symposium on Algorithms ESA, pp. 157–168 (1993)Google Scholar