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.

Abstract

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.