Computer Science Technical Reports
CS at VT

Sorting by Short Block-Moves

Heath, Lenwood S and Vergara, John Paul C (1998) Sorting by Short Block-Moves. Technical Report ncstrl.vatech_cs//TR-98-03, Computer Science, Virginia Polytechnic Institute and State University.

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


Sorting permutations by operations such as reversals and block-moves has received much interest because of its applications in computational biology, particularly in the study of genome rearrangements. A short block-move is an operation on a permutation that moves an element at most two positions away from its original position. This paper investigates the problem of finding a minimum-length sorting sequence of short block-moves for a given permutation. A 4/3-approximation algorithm for this problem is presented. Exact polynomial-time algorithms are presented for woven bitonic permutations and woven double-strip permutations. A linear-time maximum matching algorithm for a special class of grid graphs is also discovered that improves the time complexity of one of these exact algorithms.

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