✦ LIBER ✦

Constructing optimal search trees in optimal time

✍ Scribed by Zheng, S.Q.; Sun, M.

Book ID: 119773005
Publisher: IEEE
Year: 1999
Tongue: English
Weight: 255 KB
Volume: 48
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.780881

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Search in Trees

✍ Ben-Asher, Yosi; Farchi, Eitan; Newman, Ilan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 342 KB

Constructing Optimal Trees from Quartets

✍ David Bryant; Mike Steel 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 154 KB

We present fast new algorithms for constructing phylogenetic trees from quar-Ž . tets resolved trees on four leaves . The problem is central to divide-and-conquer approaches to phylogenetic analysis and has been receiving considerable attention from the computational biology community. Most formulat

A subquadratic algorithm for constructin

A subquadratic algorithm for constructing approximately optimal binary search trees

✍ Lawrence L Larmore 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 732 KB

Nearly optimal binary search trees

✍ Kurt Mehlhorn 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

Growing nearly optimal binary search tre

Growing nearly optimal binary search trees

✍ James F. Korsh 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Constructing optimal binary decision tre

Constructing optimal binary decision trees is NP-complete

✍ Laurent Hyafil; Ronald L. Rivest 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 247 KB