Better methods for solving parsimony and compatibility

Authors:
Maria Bonet;Mike Steel;Tandy Warnow;Shibu Yooseph
Affiliations:
Universidad Politecnica de Catalunya, Dept. Lenguages y Sist. Informaticos, Jordi Girona Salgado 1-3, 08034 Barcelona;Biomathematics Research Centre, University of Canterbury, Christchurch, New Zealand;Department of Computer and Information Science, University of Pennsylvania;DIMACS, Rutgers University, 96 Frelinghuysen Road, Piscataway, NJ
Venue:
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Year:
1998

Citing 15
Cited 3

Triangulating Vertex-Colored Graphs

SIAM Journal on Discrete Mathematics
Inferring Evolutionary History from DNA Sequences

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

SIAM Journal on Computing
Improved non-approximability results

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Constructing evolutionary trees in the presence of polymorphic characters

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient algorithms for inverting evolution

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Improved approximation algorithms for tree alignment

Journal of Algorithms
Reconstructing the evolutionary history of natural languages

Proceedings of the seventh 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
Constructing Big Trees from Short Sequences

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Parsimony is Hard to Beat

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
The Performance of Neighbor-Joining Algorithms of Phylogeny Recronstruction

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Nearly tight bounds on the learnability of evolution

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Nearly tight bounds on the learnability of evolution

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Faster reliable phylogenetic analysis

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Obtaining highly accurate topology estimates of evolutionary trees from very short sequences

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Reducing distortion in phylogenetic networks

WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.03

Better methods for solving parsimony and compatibility

Quantified Score

Visualization

Abstract