Skip to main content
SpringerLink
Log in

Maximum Agreement Subtree (of 3 or More Trees)

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 76 Accesses

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

Access this chapter

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Amir A, Keselman D (1997) Maximum agreement subtree in a set of evolutionary trees: metrics and efficient algorithms. SIAM J Comput 26(6):1656–1669

    Article  MathSciNet  MATH  Google Scholar 

  2. Berry V, Nicolas F (2006) Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems. IEEE/ACM Trans Comput Biol Bioinform 3(3):289–302

    Article  Google Scholar 

  3. Berry V, Guillemot S, Nicolas F, Paul C (2005) On the approximation of computing evolutionary trees. In: COCOON, Kunming, pp 115–125

    MATH  Google Scholar 

  4. Bryand D (1997) Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. Ph.D. thesis, Department of Mathematics, University of Canterbury

    Google Scholar 

  5. Cole R, Farach-Colton M, Hariharan R, Przytycka T, Thorup M (2001) An \(o(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees. SIAM J Comput 1385–1404

    Google Scholar 

  6. Farach M, Przytycka TM, Thorup M (1995) On the agreement of many trees. Inf Process Lett 55(6):297–301

    Article  MathSciNet  MATH  Google Scholar 

  7. Finden CR, Gordon AD (1985) Obtaining common pruned trees. J Classif 2:255–276

    Article  Google Scholar 

  8. Kao M-Y, Lam T-W, Sung W-K, Ting H-F (2001) An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings. J Algorithms 40(2):212–233

    Article  MathSciNet  MATH  Google Scholar 

  9. Lee C-M, Hung L-J, Chang M-S, Tang C-Y (2004) An improved algorithm for the maximum agreement subtree problem. In: BIBE, Taichung, p 533

    Google Scholar 

  10. Przytycka TM (1998) Transforming rooted agreement into unrooted agreement. J Comput Biol 5(2):335–349

    Article  MathSciNet  Google Scholar 

  11. Steel MA, Warnow T (1993) Kaikoura tree theorems: computing the maximum agreement subtree. Inf Process Lett 48(2):77–82

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Intramural Research Program of the National Institutes of Health, National Library of Medicine.

Author information

Authors and Affiliations

  1. Computational Biology Branch, NCBI, NIH, Bethesda, MD, USA

    Teresa M. Przytycka

Authors
  1. Teresa M. Przytycka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Teresa M. Przytycka .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Przytycka, T.M. (2016). Maximum Agreement Subtree (of 3 or More Trees). In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_221

Download citation

Publish with us

Policies and ethics

Search

Navigation