Efficient bounds for oriented chromosome inversion distance

  • John Kececioglu
  • David Sankoff
Conference paper

DOI: 10.1007/3-540-58094-8_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 807)
Cite this paper as:
Kececioglu J., Sankoff D. (1994) Efficient bounds for oriented chromosome inversion distance. In: Crochemore M., Gusfield D. (eds) Combinatorial Pattern Matching. CPM 1994. Lecture Notes in Computer Science, vol 807. Springer, Berlin, Heidelberg


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 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • John Kececioglu
    • 1
  • David Sankoff
    • 2
  1. 1.Department of Computer ScienceUniversity of CaliforniaDavisUSA
  2. 2.Centre de recherches mathématiquesUniversité de MontréalMontréalCanada

Personalised recommendations