Reconstructing the shape of a tree from observed dissimilarity data
Advances in Applied Mathematics
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Regular Article: Extension Operations on Sets of Leaf-Labeled Trees
Advances in Applied Mathematics
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Faster reliable phylogenetic analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
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
Faster reliable phylogenetic analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Merging, Construction, and Maintenance of Evolutionary Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
Information Processing Letters
| Hi-index | 0.00 |