Journal of Classification

, Volume 12, Issue 1, pp 91–99

An algorithm to find agreement subtrees

Authors

  • Ewa Kubicka
    • Department of MathematicsUniversity of Louisville
  • Grzegorz Kubicki
    • Department of MathematicsUniversity of Louisville
  • F. R. McMorris
    • Department of MathematicsUniversity of Louisville
Article

DOI: 10.1007/BF01202269

Cite this article as:
Kubicka, E., Kubicki, G. & McMorris, F.R. Journal of Classification (1995) 12: 91. doi:10.1007/BF01202269

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.

Keywords

Pruning verticesAgreement subtree

Copyright information

© Springer-Verlag 1995