Skip to main content

A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees

  • Conference paper
String Processing and Information Retrieval (SPIRE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3772))

Included in the following conference series:

Abstract

The comparison of rooted phylogenetic trees is essential to querying phylogenetic databases such as TreeBASE. Current comparison methods are based on either tree edit distances or common subtrees. However, a limitation of such methods is their inherent complexity. In this paper, a new distance over fully resolved phylogenetic trees, the transposition distance, is described which is based on a well-known bijection between perfect matchings and phylogenetic trees, and simple linear-time algorithms are presented for computing the new distance.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Diaconisa, P.W., Holmes, S.P.: Matchings and phylogenetic trees. Proc. Natl. Acad. Sci. USA 95, 14600–14602 (1998)

    Article  MathSciNet  Google Scholar 

  2. Knuth, D.E.: Fundamental Algorithms, 3rd edn. The Art of Computer Programming, vol. 1. Addison-Wesley, Reading (1997)

    MATH  Google Scholar 

  3. Morell, V.: TreeBASE: The roots of phylogeny. Science 273, 569–570 (1996), http://www.treebase.org

    Article  Google Scholar 

  4. Page, R.D.M.: Phyloinformatics: Towards a phylogenetic database. In: Wang, J.T.L., Zaki, M.J., Toivonen, H., Shasha, D.E. (eds.) Data Mining in Bioinformatics, pp. 219–241. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Shan, H., Herbert, K.G., Piel, W.H., Shasha, D., Wang, J.T.L.: A structure-based search engine for phylogenetic databases. In: Proc. 14th Int. Conf. Scientific and Statistical Database Management, pp. 7–10. IEEE Computer Society Press, Los Alamitos (2002)

    Chapter  Google Scholar 

  6. Steel, M.A., Penny, D.: Distributions of tree comparison metrics—some new results. Syst. Biol. 42, 126–141 (1993)

    Google Scholar 

  7. Valiente, G.: Algorithms on Trees and Graphs. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  8. Wang, J.T.L., Shan, H., Shasha, D., Piel, W.H.: TreeRank: A similarity measure for nearest neighbor searching in phylogenetic databases. In: Proc. 15th Int. Conf. Scientific and Statistical Database Management, pp. 171–180. IEEE Computer Society Press, Los Alamitos (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valiente, G. (2005). A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees. In: Consens, M., Navarro, G. (eds) String Processing and Information Retrieval. SPIRE 2005. Lecture Notes in Computer Science, vol 3772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575832_41

Download citation

  • DOI: https://doi.org/10.1007/11575832_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29740-6

  • Online ISBN: 978-3-540-32241-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics