Some Experiments on the Sorting by Reversals Method
Heath, Lenwood S.
Vergara, John Paul C.
MetadataShow full item record
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.