Kaikoura tree theorems: computing the maximum agreement subtree
Information Processing Letters
Tree compatibility and inferring evolutionary history
Journal of Algorithms
On the agreement of many trees
Information Processing Letters
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Determining the evolutionary tree using experiments
Journal of Algorithms
Computing the local consensus of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient Merging, Construction, and Maintenance of Evolutionary Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Using Max Cut to Enhance Rooted Trees Consistency
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Balanced randomized tree splitting with applications to evolutionary tree constructions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The complexity of rooted phylogeny problems
Proceedings of the 13th International Conference on Database Theory
A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Using semi-definite programming to enhance supertree resolvability
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |