General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Hi-index | 0.00 |