RECOMB '98 Proceedings of the second 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
Fast algorithms for constructing optimal trees from quartets
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Hybrid tree reconstruction methods
Journal of Experimental Algorithmics (JEA)
Picking fruit from the tree of life: comments on taxonomic sampling and quartet methods
Proceedings of the 2001 ACM symposium on Applied computing
Combining polynomial running time and fast convergence for the disk-covering method
Journal of Computer and System Sciences - Computational biology 2002
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Quartet Cleaning: Improved Algorithms and Simulations
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Selecting the branches for an evolutionary tree: a polynomial time approximation scheme
Journal of Algorithms
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
Information Processing Letters
| Hi-index | 0.00 |