Computer Science Technical Reports
CS at VT

Subsequence and Run Heuristics for Sorting by Transpositions

Guyer, Scott A and Heath, Lenwood S and Vergara, John Paul C (1997) Subsequence and Run Heuristics for Sorting by Transpositions. Technical Report ncstrl.vatech_cs//TR-97-20, Computer Science, Virginia Polytechnic Institute and State University.

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


Sorting by tranpositions is the problem of finding the minimum number of transpositions required to sort a permutation pi. A transposition involves repositioning a contiguous sequence (block) of elements by inserting it elsewhere in the permutation. The problem has applications in the study of genome rearrangements and phylogeny reconstruction. In this paper, several heuristics based on analyses of subsequences and runs in a permutation are employed. Experimental results are provided. The algorithm based on the longest increasing subsequence in a permutation appears most promising.

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