Journal of Classification

, Volume 12, Issue 1, pp 91–99

An algorithm to find agreement subtrees

  • Ewa Kubicka
  • Grzegorz Kubicki
  • F. R. McMorris
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 vertices Agreement subtree 
Download to read the full article text

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Ewa Kubicka
    • 1
  • Grzegorz Kubicki
    • 1
  • F. R. McMorris
    • 1
  1. 1.Department of MathematicsUniversity of LouisvilleLouisvilleUSA

Personalised recommendations