Efficient algorithms for inverting evolution
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Better methods for solving parsimony and compatibility
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
On the approximability of numerical taxonomy (fitting distances by tree metrics)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
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
A few logs suffice to build (almost) all trees (I)
A few logs suffice to build (almost) all trees (I)
A few logs suffice to build (almost) all trees (II)
A few logs suffice to build (almost) all trees (II)
JOBIM '00 Selected papers from the First International Conference on Computational Biology, Biology, Informatics, and Mathematics
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Faster dynamic algorithms for chordal graphs, and an application to phylogeny
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |