Jan 27, 2009 · In this paper, first we present an O(3.0446k n+n 4) fixed-parameter algorithm and an O(2.0162k n 3+n 5) fixed-parameter algorithm for the ...

The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4k n + n 4). In this paper, first we present an O(3.0446k n + ...

In this paper, first we present an O(3.0446k n+n 4) fixed-parameter algorithm and an O(2.0162k n 3+n 5) fixed-parameter algorithm for the parameterized MQI ...

The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4k n + n 4). In this paper, first we present an O(3.0446k n + ...

Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the Minimum Quartet Inconsistency (MQI) problem is ...

May 16, 2008 · There exists an O(3.0446kn + n4) fixed-parameter algorithm for the parameterized MQI problem. Maw-Shang Chang, Chuang-Chieh Lin, and Peter ...

Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k. (the parameter), the Minimum Quartet Inconsistency (MQI) problem is ...

IMPORTANT: The following is UTF-8 encoded. This means that in the presence % of non-ASCII characters, it will not work with BibTeX 0.99 or older.

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.

Maw-Shang Chang , Chuang-Chieh Lin , Peter Rossmanith: New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. Theory Comput. Syst.