Skip to main content
Log in

An algorithm to find agreement subtrees

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

Given two binary trees, a largest subtree contained in both of the original trees that has been obtained by pruning vertices is called an agreement subtree. An exact algorithm for finding an agreement subtree is presented.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • FINDEN, C. R., and GORDON, A. D. (1985), “Obtaining Common Pruned Trees,”Journal of Classification, 2, 255–276.

    Google Scholar 

  • GORDON, A. D. (1980), “On the Assessment and Comparison of Classifications,” inAnalyse de Données et Informatique, Ed., R. Tomassone, Le Chesnay: INRIA, 149–160.

    Google Scholar 

  • KUBICKA, E., KUBICKI, G., and MC MORRIS, F. R. (1992), “On Agreement Subtrees of Two Binary Trees,”Congressus Numerantium, 88, 217–224.

    Google Scholar 

  • PAGE, R. D. (1993),COMPONENT 2. 0 Tree Comparison Software for Microsoft Windows, Natural History Museum, London.

    Google Scholar 

  • ROSEN, D. E. (1978), “Vicariant Patterns and Historical Explanation in Biogeography,”Systematic Zoology, 27, 159–188.

    Google Scholar 

  • SWOFFORD, D. L. (1991), “When are Phylogeny Estimates From Molecular and Morphological Data Incongruent?” inPhylogenetic Analysis of DNA Sequences, Eds., M. M. Miyamoto and J. Cracraft, New York: Oxford University Press, 295–333.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research of F.R.M. supported by grant number N00014-89-J-1643 from the Office of Naval Research. The authors would like to thank the referees, the Editor, and William H. E. Day for many valuable suggestions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kubicka, E., Kubicki, G. & McMorris, F.R. An algorithm to find agreement subtrees. Journal of Classification 12, 91–99 (1995). https://doi.org/10.1007/BF01202269

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01202269

Keywords

Navigation