Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

Given a set L of labels and a collection of rooted trees whose leaves are bijectively labeled by some elements of L, the Maximum Agreement Supertree (SMAST) problem is given as follows: find a tree T on a largest label set L' ¿ L that homeomorphically contains every input tree restricted to L&#...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on computational biology and bioinformatics 2010-04, Vol.7 (2), p.342-353
Main Authors: Guillemot, Sylvain, Berry, Vincent
Format: Article
Language:English
Subjects:
Algorithms
Animals
Binary trees
Bioinformatics
Buildings
Catarrhini - classification
Catarrhini - genetics
Computational Biology - methods
Computer Science
Data mining
Data Structures and Algorithms
Humans
maximum agreement supertree
Models, Genetic
Models, Statistical
NP-hard problem
Organisms
parameterized complexity
Performance analysis
Phylogenetics
Phylogeny
reductions
rooted triples
Upper bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Given a set L of labels and a collection of rooted trees whose leaves are bijectively labeled by some elements of L, the Maximum Agreement Supertree (SMAST) problem is given as follows: find a tree T on a largest label set L' ¿ L that homeomorphically contains every input tree restricted to L'. The problem has phylogenetic applications to infer supertrees and perform tree congruence analyses. In this paper, we focus on the parameterized complexity of this NP-hard problem, considering different combinations of parameters as well as particular cases. We show that SMAST on k rooted binary trees on a label set of size n can be solved in O((8n) k ) time, which is an improvement with respect to the previously known O(n 3k2 ) time algorithm. In this case, we also give an O((2k) p kn 2 ) time algorithm, where p is an upper bound on the number of leaves of L missing in a SMAST solution. This shows that SMAST can be solved efficiently when the input trees are mostly congruent. Then, for the particular case where any triple of leaves is contained in at least one input tree, we give O(4 p n 3 ) and O(3.12 p + n 4 ) time algorithms, obtaining the first fixed-parameter tractable algorithms on a single parameter for this problem. We also obtain intractability results for several combinations of parameters, thus indicating that it is unlikely that fixed-parameter tractable algorithms can be found in these particular cases.
ISSN:1545-5963
1557-9964
DOI:10.1109/TCBB.2008.93