A robust model for finding optimal evolutionary trees
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Information and Computation
Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrix
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Optimal implementations of UPGMA and other common clustering algorithms
Information Processing Letters
On the hardness of inferring phylogenies from triplet-dissimilarities
Theoretical Computer Science
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
Journal of Parallel and Distributed Computing
A fast technique for constructing evolutionary tree with the application of compact sets
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
3-Points relationship based parallel algorithm for minimum ultrametric tree construction
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.89 |