A fast algorithm for constructing trees from distance matrices
Information Processing Letters
Kaikoura tree theorems: computing the maximum agreement subtree
Information Processing Letters
Determining the evolutionary tree using experiments
Journal of Algorithms
General techniques for comparing unrooted evolutionary trees
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Tree Contractions and Evolutionary Trees
SIAM Journal on Computing
Proceedings of the seventh 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 Computing Evolutionary Trees
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
The Asymmetric Median Tree - A New model for Building Consensus Trees
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Computing the Agreement of Trees with Bounded Degrees
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
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
On the complexity of distance-based evolutionary tree reconstruction
SODA '03 Proceedings of the fourteenth 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
The Complexity of Constructing Evolutionary Trees Using Experiments
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Fast error-tolerant quartet phylogeny algorithms
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Fast error-tolerant quartet phylogeny algorithms
Theoretical Computer Science
| Hi-index | 0.00 |
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient construction of evolutionary trees: a new upper time-bound on the problem of constructing an evolutionary tree from experiments, and a relatively fast approximation algorithm for the maximum agreement subtree problem for binary trees for which the maximum number of leaves in an optimal solution is large. We also present new lower bounds for the problem of constructing an evolutionary tree from experiments and for the problem of constructing a tree from an ultrametric distance matrix.