๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Average sizes of suffix trees and DAWGs

โœ Scribed by Anselm Blumer; Andrzej Ehrenfeucht; David Haussler

Book ID
104184354
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
333 KB
Volume
24
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient implementation of suffix trees
Efficient implementation of suffix trees
โœ Arne Andersson; Stefan Nilsson ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 740 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

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.