### 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 eficient 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.

Original language | English (US) |
---|---|

Title of host publication | STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings |

Publisher | Springer Verlag |

Pages | 184-196 |

Number of pages | 13 |

ISBN (Print) | 354065691X, 9783540656913 |

State | Published - Jan 1 1999 |

Event | 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999 - Trier, Germany Duration: Mar 4 1999 → Mar 6 1999 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1563 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999 |
---|---|

Country | Germany |

City | Trier |

Period | 3/4/99 → 3/6/99 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings*(pp. 184-196). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1563). Springer Verlag.

}

*STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1563, Springer Verlag, pp. 184-196, 16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999, Trier, Germany, 3/4/99.

**Balanced randomized tree splitting with applications to evolutionary tree constructions.** / Kao, Ming Yang; Lingas, Andrzej; Östlin, Anna.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Balanced randomized tree splitting with applications to evolutionary tree constructions

AU - Kao, Ming Yang

AU - Lingas, Andrzej

AU - Östlin, Anna

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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 eficient 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.

AB - 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 eficient 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.

UR - http://www.scopus.com/inward/record.url?scp=84957059560&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957059560&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84957059560

SN - 354065691X

SN - 9783540656913

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 184

EP - 196

BT - STACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings

PB - Springer Verlag

ER -