An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(n log n) time algorithm for this problem.

• Type: Conference
• Year: 1996
• Where: SODA
• Authors: Richard Cole, Ramesh Hariharan
• Keywords: Agreement Subtree Problem, Algorithms, Largest Subset, SODA 1996