Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions (1999)
| Venue: | In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Kao99balancedrandomized,
author = {Ming-yang Kao and Andrzej Lingas and Anna Östlin},
title = {Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions},
booktitle = {In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science},
year = {1999},
pages = {184--196},
publisher = {SpringerVerlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. 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 e#cient 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. 1 Introduction Several of the known e#cient algorithms for trees rely on their excellent separator properties. It is well known that each tree contains a vertex whose removal splits it into components of balanced size. Unfortunately, finding such a vertex usually requires the knowledge of the tree. In this paper, we co...
