Recovering branches on the tree of life: an approximation algorithm

Authors:
Paul Kearney;Ming Li;John Tsang;Tao Jiang
Affiliations:
Department of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada;Department of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada;Department of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada;Department of Computer Science, McMaster University, Hamilton, ON, L3S 4K1, Canada
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

SIAM Journal on Computing
Tree Reconstruction from Partial Orders

SIAM Journal on Computing
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The ordinal quartet method

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Inferring evolutionary trees from ordinal data

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Orchestrating Quartets: Approximation and Data Correction

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Supertrees by Flipping

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Minimum-Flip Supertrees: Complexity and Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Hi-index	0.00