Maximum Agreement Subtree (of 2 Binary Trees)
Consider two rooted trees T1 and T2 with n leaves each. The internal nodes of each tree have at least two children each. The leaves in each tree are labeled with the same set of labels, and further, no label occurs more than once in a particular tree. An agreement subtree of T1 and T2 is defined as follows. Let L1 be a subset of the leaves of T1 and let L2 be the subset of those leaves of T2 which have the same labels as leaves in L1. The subtree of T1induced by L1 is an agreement subtree of T1 and T2 if and only if it is isomorphic to the subtree of T2 induced by L2. The maximum agreement subtree problem (henceforth called MAST) asks for the largest agreement subtree of T1 and T2.
The terms induced subtree and isomorphism used above need to be defined. Intuitively, the subtree of T induced by a subset L of the leaves of T is the topological subtree of T restricted to the leaves in L, with branching information relevant to Lpreserved. More formally, for any two...
KeywordsIsomorphism Tree agreement
- 2.Cole R, Hariharan R (1996) An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees. In: Proceedings of 7th ACM-SIAM SODA, Atlanta, pp 323–332Google Scholar
- 4.Farach M, Przytycka T, Thorup M (1995) The maximum agreement subtree problem for binary trees. In: Proceedings of 2nd ESAGoogle Scholar
- 9.Fredman ML (1975) Two applications of a probabilistic search technique: sorting X + Y and building balanced search trees. In: Proceedings of the 7th ACM STOC, Albuquerque, pp 240–244Google Scholar