Skip to main content
SpringerLink
Log in
Book cover

Annual International Conference on Research in Computational Molecular Biology

RECOMB 2005: Research in Computational Molecular Biology pp 615–629Cite as

On Sorting by Translocations

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 3500))

Abstract

The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchanges of chromosome ends. We give an elementary proof of the formula for computing the translocation distance in linear time, and we give a new algorithm for sorting by translocations, correcting an error in a previous algorithm by Hannenhalli.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 388–399. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Bergeron, A., Mixtacki, J., Stoye, J.: The inversion distance problem. In: Gascuel, O. (ed.) Mathematics of Evolution and Phylogeny, ch. 10, pp. 262–290. Oxford University Press, Oxford (2005)

    Google Scholar 

  3. Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 68–79. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Mouse Genome Sequencing Consortium. Initial sequencing and comparative analysis of the mouse genome. Nature 420, 520–562 (2002)

    Google Scholar 

  5. Hannenhalli, S.: Polynomial-time algorithm for computing translocation distance between genomes. Discrete Appl. Math. 71(1-3), 137–151 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hannenhalli, S., Pevzner, P.A.: Transforming men into mice, polynomial algorithm for genomic distance problem. In: FOCS 1995 Proceedings, pp. 581–592. IEEE Press, Los Alamitos (1995)

    Google Scholar 

  7. Kececioglu, J.D., Ravi, R.: Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In: Proceedings of the sixth ACM-SIAM Symposium on Discrete Algorithm. pp. 604–613. Society of Industrial and Applied Mathematics (1995)

    Google Scholar 

  8. Li, G., Qi, X., Wang, X., Zhu, B.: A linear-time algorithm for computing translocation distance between signed genomes. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 323–332. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangements. J. Bioinf. Comput. Biol. 1(1), 71–94 (2003)

    Article  Google Scholar 

  10. Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65(3), 587–609 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaCIM, Université du Québec à Montréal, Canada

    Anne Bergeron

  2. Fakultät für Mathematik, Universität Bielefeld, 33594, Bielefeld, Germany

    Julia Mixtacki

  3. Technische Fakultät, Universität Bielefeld, 33594, Bielefeld, Germany

    Jens Stoye

Authors
  1. Anne Bergeron
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julia Mixtacki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jens Stoye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Human Genome Center, Institute of Medical Science, University of Tokyo, 4-6-1 Shirokanedai, 108-8639, Minato-ku, Tokyo, Japan

    Satoru Miyano

  2. Broad Institute of MIT and Harvard, 320 Charles Street, 02141-2023, Cambridge, MA, USA

    Jill Mesirov

  3. Computational Genomics Laboratory, Department of Bioengineering, Boston University, 44 Cummington St., 02215, Boston, MA, USA

    Simon Kasif

  4. Center for Molecular Biology and Computer Sciecne Department, Brown University, 115 Waterman St., 02912, Providence, RI, USA

    Sorin Istrail

  5. University of California, San Diego, USA

    Pavel A. Pevzner

  6. Department of Molecular and Computational Biology, University of Southern California, 1050 Childs Way, 90089-2910, Los Angeles, CA, USA

    Michael Waterman

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergeron, A., Mixtacki, J., Stoye, J. (2005). On Sorting by Translocations. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds) Research in Computational Molecular Biology. RECOMB 2005. Lecture Notes in Computer Science(), vol 3500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11415770_47

Download citation

  • DOI: https://doi.org/10.1007/11415770_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25866-7

  • Online ISBN: 978-3-540-31950-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation