On Sorting by Bounded Block Interchanges
Computational Complexity
2011-10-06 v5 Data Structures and Algorithms
Abstract
In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interchanged at each step. We call the problem Sorting by k-Block Interchanges. We show the problem to be NP-Hard for k=1. The problem is easy for k=n-1, where n is the length of the permutation (the unbounded case). Sorting by Block Interchanges is a very important and widely studied problem with applications in comparative genomics.
Cite
@article{arxiv.1102.3245,
title = {On Sorting by Bounded Block Interchanges},
author = {Swapnoneel Roy},
journal= {arXiv preprint arXiv:1102.3245},
year = {2011}
}
Comments
This paper has been withdrawn by the author due to a bug in the reduction. Would be available again after it is fixed