A fixed-parameter algorithm for minimum quartet inconsistency

Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the M inimum Q uartet I nconsistency (MQI) problem is the question whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in only k quart...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 67; číslo 4; s. 723 - 741
Hlavní autoři: Gramm, Jens, Niedermeier, Rolf
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.12.2003
Témata:
Computational biology
Minimum quartet inconsistency
Parameterized complexity
Phylogeny
Quartet methods
Quartet methods
Minimum quartet inconsistency
Phylogeny
Parameterized complexity
Computational biology
ISSN:0022-0000, 1090-2724
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the M inimum Q uartet I nconsistency (MQI) problem is the question whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in only k quartet topologies. The more general problem where we are not necessarily given a topology for every subset of four taxa appears to be fixed-parameter intractable. For MQI, however, which is also NP-complete, we can compute the required tree in time O(4 k n+ n 4). This means that the problem is fixed-parameter tractable and that in the case of a small number k of “errors” the tree reconstruction can be done efficiently. In particular, for minimal k, our algorithm can produce all solutions that resolve k errors. Additionally, we discuss significant heuristic improvements. Experiments underline the practical relevance of our solutions.
ISSN:0022-0000
1090-2724
DOI:10.1016/S0022-0000(03)00077-1