Approximating minimum quartet inconsistency: (abstract)

Authors:
Gianluca Della Vedova;Tao Jiang;Jing Li;Jianjun Wen
Affiliations:
Università degli Studi di Milano-Bicocca;UC Riverside;UC Riverside;UC Riverside
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 5
Cited 2

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
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Inferring evolutionary trees with strong combinatorial evidence

Theoretical Computer Science - computing and combinatorics
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application

SIAM Journal on Computing

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

Information Processing Letters
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract