✦ LIBER ✦

Suffix Trees on Words

✍ Scribed by A. Andersson; N. J. Larsson; K. Swanson

Book ID: 111706539
Publisher: Springer
Year: 1999
Tongue: English
Weight: 148 KB
Volume: 23
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009260

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On suffix extensions in suffix trees

✍ Breslauer, Dany; Italiano, Giuseppe F. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Distributed suffix trees

✍ Raphaël Clifford 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 246 KB

On-line construction of suffix trees

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

Space Efficient Suffix Trees

✍ J.Ian Munro; Venkatesh Raman; S.Srinivasa Rao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 131 KB

suffix tree for all the suffixes that start with the bit that occurs more times in the given binary text. The last structure uses an iterative algorithm to search for the Ž . pattern. This structure is the first o n lg n bit index to support the decision version of indexing queries in time linear in

Compressed property suffix trees

✍ Hon, Wing-Kai; Patil, Manish; Shah, Rahul; Thankachan, Sharma V. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Efficient implementation of suffix trees

✍ Arne Andersson; Stefan Nilsson 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 740 KB