Sciweavers

Share
STACS
1999
Springer

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

9 years 6 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
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.
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1999
Where STACS
Authors Ming-Yang Kao, Andrzej Lingas, Anna Östlin
Comments (0)
books