Combinatorial Pattern Matching

Volume 807 of the series Lecture Notes in Computer Science pp 307-325


Efficient bounds for oriented chromosome inversion distance

  • John KececiogluAffiliated withDepartment of Computer Science, University of California
  • , David SankoffAffiliated withCentre de recherches mathématiques, Université de Montréal


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.


Genome rearrangements chromosome inversion reversal distance sorting by signed reversals