On the complexity of comparing evolutionary trees

We study the computational complexity and approximation of several problems arising in the comparison of evolutionary trees. It is shown that the maximum agreement subtree (MAST) problem for three trees with unbounded degree cannot be approximated within ratio 2 log δ n in polynomial time for any δ...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 71; no. 1; pp. 153 - 169
Main Authors Hein, Jotun, Jiang, Tao, Wang, Lusheng, Zhang, Kaizhong
Format Journal Article
LanguageEnglish
Published Elsevier B.V 05.12.1996
Subjects
Approximation algorithm
Compatibility
Computational complexity
Evolutionary tree
Phylogeny
Recombination
Evolutionary tree
Recombination
Phylogeny
Compatibility
Approximation algorithm
Computational complexity
Online AccessGet full text
ISSN0166-218X
1872-6771
DOI10.1016/S0166-218X(96)00062-5

Cover

More Information
Summary:We study the computational complexity and approximation of several problems arising in the comparison of evolutionary trees. It is shown that the maximum agreement subtree (MAST) problem for three trees with unbounded degree cannot be approximated within ratio 2 log δ n in polynomial time for any δ < 1, unless NP ⊆ DTIME[2 polylog n ], and MAST with edge contractions for two binary trees is NP-hard. This answers two open questions posed in [1]. For the maximum refinement subtree (MRST) problem involving two trees, we show that it is polynomial-time solvable when both trees have bounded degree and is NP-hard when one of the trees can have an arbitrary degree. Finally, we consider the problem of optimally transforming a tree into another by transferring subtrees around. It is shown that computing the subtree-transfer distance is NP-hard and an approximation algorithm with performance ratio 3 is given.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(96)00062-5