Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees [article]

Viet Tung Hoang, Wing-Kin Sung
2008 arXiv   pre-print
Consider a set of labels L and a set of trees T = { T^(1), T^(2), ..., T^(k) where each tree T^(i) is distinctly leaf-labeled by some subset of L. One fundamental problem is to find the biggest tree (denoted as supertree) to represent T which minimizes the disagreements with the trees in T under certain criteria. This problem finds applications in phylogenetics, database, and data mining. In this paper, we focus on two particular supertree problems, namely, the maximum agreement supertree
more » ... m (MASP) and the maximum compatible supertree problem (MCSP). These two problems are known to be NP-hard for k ≥ 3. This paper gives the first polynomial time algorithms for both MASP and MCSP when both k and the maximum degree D of the trees are constant.
arXiv:0802.2867v1 fatcat:gdlxa4c2gvhp7fgqrv6kcyqyaq