✦ LIBER ✦

A Note on the Height of Suffix Trees

✍ Scribed by Devroye, Luc; Szpankowski, Wojciech; Rais, Bonita

Book ID: 118178092
Publisher: Society for Industrial and Applied Mathematics
Year: 1992
Tongue: English
Weight: 587 KB
Volume: 21
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0221005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Suffix Trees on Words

✍ A. Andersson; N. J. Larsson; K. Swanson 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 148 KB

On-line construction of suffix trees

✍ E. Ukkonen 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 679 KB

On the Height of Height-Balanced Trees

✍ Luccio, Fabrizio; Pagli, Linda 📂 Article 📅 1976 🏛 IEEE 🌐 English ⚖ 687 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 937 || Suffix cactus: A cross between suffix tree and suffix array

✍ Galil, Zvi; Ukkonen, Esko 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 725 KB

On the sorting-complexity of suffix tree

On the sorting-complexity of suffix tree construction

✍ Farach-Colton, Martin; Ferragina, Paolo; Muthukrishnan, S. 📂 Article 📅 2000 🏛 Association for Computing Machinery 🌐 English ⚖ 175 KB

The suffix tree of a tree and minimizing

The suffix tree of a tree and minimizing sequential transducers

✍ Dany Breslauer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

This paper gives a linear-time algorithm for the construction of the suffix tree of a tree, which was introduced by Kosaraju, as a natural generalization of the suffix tree of a string. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers.