Sorting by bounded block-moves Original Research Article

Given a permutation π, a block-move is an operation that switches two adjacent blocks of elements in π. The problem of finding the minimum number of block-moves required to sort π has applications in computational biology, particularly in the study of genome rearrangements. This paper investigates variants of the problem where bounds are imposed on the lengths of the blocks moved. Algorithms and reduction results are presented for these variants.