Sciweavers

Share
CORR
2008
Springer

Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

9 years 5 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
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 problem (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.
Viet Tung Hoang, Wing-Kin Sung
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Viet Tung Hoang, Wing-Kin Sung
Comments (0)
books