Abstract

We introduce new data structures for compressed suffix trees whose size are linear in the text size. The size is measured in bits; thus they occupy only O(n log |A|) bits for a text of length n on an alphabet A. This is a remarkable improvement on current suffix trees which require O(n log n) bits. Though some components of suffix trees have been compressed, there is no linear-size data structure for suffix trees with full functionality such as computing suffix links, string-depths and lowest common ancestors. The data structure proposed in this paper is the first one that has linear size and supports all operations efficiently. Any algorithm running on a suffix tree can also be executed on our compressed suffix trees with a slight slowdown of a factor of polylog(n). 1

Citations

773	Algorithms on Strings, Trees, and Sequences - Gusfield - 1997
560	G: Suffix arrays: a new method for on-line string searches - Manber, Myers - 1993
493	A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
269	On-line construction of suffix trees - Ukkonen - 1995
172	Compressed suffix arrays and suffix trees with applications to text indexing and string matching - GROSSI, S
144	The LCA problem revisited - Bender, Farach-Colton - 2000
142	G: Opportunistic data structures with applications - Ferragina, Manzini
118	Optimal suffix tree construction with large alphabets - Farach - 1997
116	Succinct representation of balanced parentheses and static trees - Munro, Raman - 2001
77	New text indexing functionalities of the compressed suffix arrays - Sadakane
67	Linear-time longest-common-prefix computation in suffix arrays and its applications - Kasai, Lee, et al. - 2001
61	An Experimental Study of an Opportunistic Index - Ferrragina, Manzini - 2001
57	Optimal bounds for the predecessor problem - Beame, Fich - 1999
55	A space-economical sux tree construction algorithm - McCreight - 1976
47	Space efficient suffix trees - Munro, Raman, et al.
44	Breaking a time-and-space barrier in constructing full-text indices - Hon, Sadakane, et al. - 2003
38	New indices for text - Gonnet, Baeza-Yates, et al. - 1992
36	Sorting and searching on the word ram - Hagerup - 1998
32	On-line construction of sux trees - Ukkonen - 1995
22	Optimal sux tree construction with large alphabets - Farach - 1997
22	On Compressing and Indexing Data - Ferragina, Manzini - 2002
21	Constructing compressed suffix arrays with large alphabets - HON, LAM, et al. - 2003
18	Efficient storage and retrieval by content and address of static files - Elias - 1974
18	Efficient Discovery of Optimal WordAssociation Patterns in Large Text Databases - Shimozono, Arimura, et al.
16	Reducing the Space Requirement of Suffix Trees. Software – Practice and Experience - Kurtz - 1999
15	Compressed sux arrays and sux trees with applications to text indexing and string matching - Grossi, Vitter - 2000
12	Reducing the space requirement of su#x trees - Kurtz - 1998
6	Space ecient sux trees - Munro, Raman, et al. - 2001
4	E#cient Discovery of Optimal WordAssociation Patterns in Large Text Databases - Shimozono, Arimura, et al. - 2000
4	Linear Pattern Matching Algorihms - Weiner - 1973
3	E#cient Su#x Trees on Secondary Storage - Clark, Munro - 1996
3	Higher Order Entropy Analysis of Compressed Suffix Arrays - Grossi, Gupta, et al. - 2003
2	A Space and Time E#cient Algorithm for Constructing Compressed Su#x Arrays - Lam, Sadakane, et al. - 2002
1	Constructing Compressed Su#x Arrays with Large Alphabets - Hon, Lam, et al. - 2003