✦ LIBER ✦

Efficient implementation of suffix trees

✍ Scribed by Arne Andersson; Stefan Nilsson

Book ID: 112210736
Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 740 KB
Volume: 25
Category: Article
ISSN: 0038-0644
DOI: 10.1002/spe.4380250203

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Linearized Suffix Tree: an Efficient Ind

Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and

✍ Dong Kyue Kim; Minhwan Kim; Heejin Park 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 777 KB

On-line construction of suffix trees

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

Reducing the space requirement of suffix

Reducing the space requirement of suffix trees

✍ Stefan Kurtz 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

We show that suffix trees store various kinds of redundant information. We exploit these redundancies to obtain more space efficient representations. The most space efficient of our representations requires 20 bytes per input character in the worst case, and 10.1 bytes per input character on average

Average sizes of suffix trees and DAWGs

✍ Anselm Blumer; Andrzej Ehrenfeucht; David Haussler 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 333 KB

On-line Construction of Two-Dimensional

On-line Construction of Two-Dimensional Suffix Trees

✍ Raffaele Giancarlo; Daniela Guaiana 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 469 KB