title: The agreement metric for labeled binary trees.
abstract: Let S be a set of n objects. A binary tree of S is a binary tree whose leaves are labeled without repetition from S. The operation of pruning a tree T is that of removing some leaves from T and suppressing all inner vertices of degree 2 which are formed by this deletion. Given two trees T and U, an agreement tree is a tree that can be obtained from T as well as from U by pruning the fewest number of leaves from the two trees. A quadratic algorithm is presented for doing this and two metrics are defined based on agreement trees.
authors: Department of Mathematics, University of Pennsylvania, Philadelphia.
authors: W
authors: W
authors: Goddard
authors: E
authors: E
authors: Kubicka
authors: G
authors: G
authors: Kubicki
authors: F R
authors: FR
authors: McMorris
mesh_terms: D000465:Algorithms; D002965:Classification / Q000379:methods*; D008433:Mathematics; D010802:Phylogeny