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.
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.
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.
KUBICKA, E., KUBICKI, G., and MC MORRIS, F. R. (1992), “On Agreement Subtrees of Two Binary Trees,”Congressus Numerantium, 88, 217–224.
PAGE, R. D. (1993),COMPONENT 2. 0 Tree Comparison Software for Microsoft Windows, Natural History Museum, London.
ROSEN, D. E. (1978), “Vicariant Patterns and Historical Explanation in Biogeography,”Systematic Zoology, 27, 159–188.
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.
Author information
Authors and Affiliations
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
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
Issue Date:
DOI: https://doi.org/10.1007/BF01202269