Computer Science Technical Reports
CS at VT

Some Experiments on the Sorting by Reversals Method

Heath, Lenwood S. and Vergara, John Paul C. (1995) Some Experiments on the Sorting by Reversals Method. Technical Report ncstrl.vatech_cs//TR-95-16, Computer Science, Virginia Polytechnic Institute and State University.

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


Sorting by reversals is the problem of finding the minimum number of reversals required to sort a permutation pi. The problem is significant with respect to the study of genome rearrangements and phylogeny reconstruction. This paper presents a programming framework for performing experiments on the problem. Several conjectures concerning optimal sorting sequences are tested using this framework.

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