On Sorting by Bounded Block Interchanges

Details On Sorting by Bounded Block Interchanges On Sorting by Bounded Block Interchanges

2011-02-16

arxiv.org/abs/1102.3245v5

Computer Science

Computational Complexity

This paper has been withdrawn by the author due to a bug in the reduction. Would be available again after it is fixed

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Sorting by Bounded Block Interchanges does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Sorting by Bounded Block Interchanges, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Sorting by Bounded Block Interchanges will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416736