Computer Science Technical Reports
CS at VT

Sorting by Bounded Block-Moves

Heath, Lenwood S and Vergara, John Paul C (1997) Sorting by Bounded Block-Moves. Technical Report ncstrl.vatech_cs//TR-97-09, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
Postscript - Requires a viewer, such as GhostView (252923)


Given a permutation pi, a block-move is an operation that switches two adjacent blocks of elements in pi. The problem of finding the minimum number of block-moves required to sort pi 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.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:466
Deposited By:User autouser
Deposited On:05 December 2001
Alternative Locations: URL:, URL: