Data structures and network algorithms
Data structures and network algorithms
A robust model for finding optimal evolutionary trees
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computing the local consensus of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast comparison of evolutionary trees
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of distance-based evolutionary tree reconstruction
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Information Processing Letters
An O(nlog n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hi-index | 0.00 |