Date: 07 Jun 2005

Efficient bounds for oriented chromosome inversion distance

* Final gross prices may vary according to local VAT.

Get Access


We study the problem of comparing two circular chromosomes that have evolved by chromosome inversion, assuming that the order of corresponding genes is known, as well as their orientation. Determining the minimum number of inversions is equivalent to finding the minimum of reversals to sort a signed circular permutation, where a reversal takes an arbitrary substring of elements and reverses their order, as well as flipping their sign. We show that tight bounds on the minimum number of reversals can be found by simple and efficient algorithms.

Research supported by a U.S. Department of Energy Human Genome Distinguished Postdoctoral Fellowship.
Research supported by grants from the Natural Sciences and Engineering Research Council of Canada, and the Fonds pour la formation de chercheurs et l'aide à la recherche (Québec). David Sankoff is a fellow of the Canadian Institute for Advanced Research.