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
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
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
Hi-index | 0.00 |