An algorithm to find agreement subtrees
- Cite this article as:
- Kubicka, E., Kubicki, G. & McMorris, F.R. Journal of Classification (1995) 12: 91. doi:10.1007/BF01202269
- 73 Downloads
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.