Efficient bounds for oriented chromosome inversion distance

  • John Kececioglu
  • David Sankoff
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 807)

Abstract

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.

Keywords

Genome rearrangements chromosome inversion reversal distance sorting by signed reversals 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bafna, Vineet and Pavel A. Pevzner. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, 148–157, November 1993.Google Scholar
  2. [2]
    Chrobak, M., T. Szymacha, and A. Krawczyk. A data structure useful for finding Hamiltonian cycles. Theoretical Computer Science 71, 419–424, 1990.Google Scholar
  3. [3]
    Cohen, David S. and Manuel Blum. On the problem of sorting burnt pancakes. Manuscript, Computer Science Division, University of California at Berkeley, 1993.Google Scholar
  4. [4]
    Fredman, M.L., D.S. Johnson, L.A. McGeoch, and G. Ostheimer. Data structures for traveling salesmen. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 145–154, 1993.Google Scholar
  5. [5]
    Gates, William H. and Christos H. Papadimitriou. Bounds for sorting by prefix reversals. Discrete Mathematics 27, 47–57, 1979.Google Scholar
  6. [6]
    Heydari, Mohammad H. The Pancake Problem. PhD dissertation, Department of Computer Science, University of Texas at Dallas, 1993.Google Scholar
  7. [7]
    Kececioglu, John and David Sankoff. Exact and approximation algorithms for the inversion distance between two chromosomes. In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science 684, Springer-Verlag, 87–105, June 1993. (An earlier version appeared as “Exact and approximation algorithms for the reversal distance between two permutations,” Technical Report 1824, Centre de recherches mathématiques, Université de Montréal, Montréal, Canada, July 1992.)Google Scholar
  8. [8]
    Kececioglu, John and David Sankoff. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. To appear in Algorithmica, 1993.Google Scholar
  9. [9]
    Sankoff, David, Guillame Leduc, Natalie Antoine, Bruno Paquin, B. Franz Lang, and Robert Cedergren. Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proceedings of the National Academy of Science USA 89, 6575–6579, 1992.Google Scholar
  10. [10]
    Schöniger, Michael and Michael S. Waterman. A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology 54, 521–536, 1992.Google Scholar
  11. [11]
    Watterson, G.A., W.J. Ewens, T.E. Hall, and A. Morgan. The chromosome inversion problem. Journal of Theoretical Biology 99, 1–7, 1982.Google Scholar

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