The agreement metric for labeled binary trees

• Published in: Mathematical biosciences Vol. 123; no. 2; p. 215
• Main Authors: Goddard, W, Kubicka, E, Kubicki, G, McMorris, F R
• Format: Journal Article
• Language: English
• Published: United States 01-10-1994
• Subjects: Algorithms; Classification - methods; Mathematics; Phylogeny
• ISSN: 0025-5564
• DOI: 10.1016/0025-5564(94)90012-4

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.