Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) in all of the input trees with as many labeled leaves as possible. We study the ordered variants of MAST where the trees are uniformly or non-uniformly ordered. We provide the first known polynomial-time algorithms for the uniformly and non-uniformly ordered homeomorphic variants as well as the uniformly and non-uniformly ordered isomorphic variants of MAST. Our algorithms run in time O(kn3 ), O(n3 min{nk, n + logk−1 n}), O(kn3 ), and O((k + n)n3 ), respectively, where n is the number of leaf labels and k is the number of input trees.

• Type: Conference
• Year: 2004
• Where: CPM
• Authors: Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
• Keywords: CPM 2004, Input Trees, NP-hard Maximum Agreement, Ordered Variants