Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining

Authors:
Tandy Warnow;Bernard M. E. Moret;Katherine St. John
Affiliations:
Dept. of Computer Science, U. of Texas at Austin;Dept. of Computer Science, U. of Mexico;Dept. of Math & Computer Science, Lehman College and the Graduate Center, City U. of New York
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Approximating minimum quartet inconsistency: (abstract)

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum likelihood on four taxa phylogenetic trees: analytic solutions

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Minimum Quartet Inconsistency Is Fixed Parameter Tractable

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Reconstructing optimal phylogenetic trees: a challenge in experimental algorithmics

Experimental algorithmics
Reconstructing approximate phylogenetic trees from quartet samples

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Hi-index	0.00