A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors

Authors:
Gang Wu;Jia-Huai You;Guohui Lin
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
Venue:
Information Processing Letters
Year:
2006

Citing 17
Cited 4

Reconstructing the shape of a tree from observed dissimilarity data

Advances in Applied Mathematics
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
A few logs suffice to build (almost) all trees (l): part I

Random Structures & Algorithms
Fast algorithms for constructing optimal trees from quartets

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract)

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Some open problems in computational molecular biology

Journal of Algorithms
Constructing optimal trees from quartets

Journal of Algorithms
Inferring evolutionary trees with strong combinatorial evidence

Theoretical Computer Science - computing and combinatorics
Approximating minimum quartet inconsistency: (abstract)

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application

SIAM Journal on Computing
Constructing Big Trees from Short Sequences

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Inferring Evolutionary Trees with Strong Combinatorial Evidence

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Quartet Cleaning: Improved Algorithms and Simulations

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Orchestrating Quartets: Approximation and Data Correction

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A fixed-parameter algorithm for minimum quartet inconsistency

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Quartet Based Phylogeny Reconstruction with Answer Set Programming

ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
A lookahead branch-and-bound algorithm for the maximum quartet consistency problem

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

New fixed-parameter algorithms for the minimum quartet inconsistency problem

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs

SIAM Journal on Discrete Mathematics
Kernel and fast algorithm for dense triplet inconsistency

Theoretical Computer Science
Testing consistency of quartet topologies: A parameterized approach

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a polynomial time algorithm for the Minimum Quartet Inconsistency (MQI) problem when the number of quartet errors is O(n). This improves the previously best algorithmic result saying that if the number of quartet errors is at most (n-3)/2 then the MQI problem can be solved in polynomial time.