论文信息 - An algorithm to find agreement subtrees

An algorithm to find agreement subtrees

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.

F. McMorris | E. Kubicka | G. Kubicki | F. R. McMorris

[1] D. Rosen. Vicariant Patterns and Historical Explanation in Biogeography , 1978 .

[2] A. D. Gordon,et al. Obtaining common pruned trees , 1985 .

[3] D. Swofford. When are phylogeny estimates from molecular and morphological data incongruent , 1991 .