# Item

ITEM ACTIONSEXPORT

Released

Report

#### On the complexity of computing evolutionary trees

##### External Resource

No external resources are shared

##### Fulltext (restricted access)

There are currently no full texts shared for your IP range.

##### Fulltext (public)

MPI-I-96-1-031.pdf

(Any fulltext), 230KB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Gasieniec, L., Jansson, J., Lingas, A., & Östlin, A.(1996). *On
the complexity of computing evolutionary trees* (MPI-I-1996-1-031). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-A01E-5

##### Abstract

In this paper we study a few
important tree optimization problems with
applications to computational biology.
These problems ask for trees that are consistent with an
as large part of the given data as possible.
We show that the maximum homeomorphic agreement
subtree problem cannot be approximated within a factor of
$N^{\epsilon}$, where $N$ is the input size, for any $0 \leq \epsilon
< \frac{1}{18}$ in polynomial time, unless P=NP. On the other hand,
we present an $O(N\log N)$-time heuristic for the restriction of this
problem to instances with $O(1)$ trees of height $O(1)$,
yielding solutions within a constant factor of the optimum.
We prove that the maximum inferred consensus tree
problem is NP-complete and we provide a simple fast heuristic
for it, yielding solutions within one third of the optimum.
We also present a more specialized polynomial-time heuristic
for the maximum inferred local consensus tree problem.