Heath, Lenwood S.Vergara, John Paul C.2013-06-192013-06-191995-09-01http://hdl.handle.net/10919/19938Sorting 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.application/postscriptenIn CopyrightTechnical reportTR-95-16http://eprints.cs.vt.edu/archive/00000431/01/TR-95-16.ps