Abstract

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 for a collection of 42 files of different type. This is an advantage of more than 8 bytes per input character over previous work. Our representations can be constructed without extra space, and as fast as previous representations. The asymptotic running times of suffix tree applications are retained. Copyright © 1999 John Wiley & Sons, Ltd. KEY WORDS: data structures; suffix trees; implementation techniques; space reduction

Citations

773	Algorithms on Strings, Trees, and Sequences - Gusfield - 1997
605	The art of computer programming, volume 3: Sorting and searching - Knuth - 1973
574	Text Compression - Bell, Cleary, et al. - 1990
563	E: Suffix arrays: a new method for on-line string searches - Manber, Myers
493	A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
461	D: A block-sorting lossless data compression algorithm - Burrows, Wheeler - 1994
381	Linear pattern matching algorithms - Weiner
118	Optimal suffix tree construction with large alphabets - Farach - 1997
111	R: The string B-Tree: a new data structure for string search in external memory and its applications - Ferragina, Grossi - 1999
110	The myriad virtues of subword trees - Apostolico - 1985
88	The smallest automaton recognizing the subwords of a text - Blumer, Blumer, et al. - 1985
82	Transductions and repetitions - Crochemore - 1986
79	REPuter: Fast computation of maximal repeats in complete genomes. Bioinformatics 15: 426–427 - Kurtz, Schleiermacher - 1999
68	pattern matching algorithms - Linear - 1973
61	From Ukkonen to McCreight and Weiner: a unifying view of linear-time suffix tree construction - Giegerich, Kurtz - 1997
61	On-line Construction of Suffix-Trees - Ukkonen - 1995
57	Completed Inverted Files for Efficient Text Retrieval and Analysis - Blumer
56	Sublinear approximate string matching and biological applications - Chang, Lawler - 1994
47	Space efficient suffix trees - Munro, Raman, et al.
46	A Corpus for the Evaluation of Lossless Compression Algorithms - Arnold, Bell - 1997
38	Suffix cactus: a cross between suffix tree and suffix array - Kärkkäinen - 1995
36	Efficient implementation of lazy suffix trees - GIEGERICH, KURTZ, et al. - 1999
35	Extended application of suffix trees to data compression - Larsson
32	Efficient implementation of suffix trees - Andersson, Nilsson - 1995
28	Generalized suffix trees for biological sequence data: applications and implementation - Bieganski, Riedl, et al. - 1994
23	Modifications of the burrows and wheeler data compression algorithm - Balkenhol, Kurtz, et al. - 1999
16	S.: A comparison of imperative and purely functional suffix tree constructions - Giegerich, Kurtz - 1995
16	The context trees of block sorting compression - Larsson - 1998
16	An efficient implementation of trie structures - Aoe, Morimotto, et al. - 1992
15	Suffix binary search trees - Irving - 1995
13	Fundamental Algorithms for a Declarative Pattern Matching System - Kurtz
11	Average sizes of suffix trees and dawgs - Blumer, Haussler, et al. - 1989
11	Compact hash tables using bidirectional linear probing - Cleary - 1984
11	K: Genome analysis: pattern search in biological macromolecules - HW, Heumann
9	Bonsai: a compact representation of trees - Darragh, Cleary, et al. - 1993
9	The Myriad Virtues of Subword Trees,” Combinatorial Algorithms on - Apostolico - 1985
4	Improved Behavior of Tries by Adaptive Branching - Andersson, Nilsson - 1993
4	Direct Construction of Compact Acyclic Word Graphs - Crochmore, V'erin - 1997
4	A time and space efficient data structure for string searching on large texts - Colussi, Col - 1996
4	Bonsai: a compact representation of trees. Software|Practice and Experience - Darragh, Cleary, et al. - 1993
3	The Strmat Software-Package - Knight, Gusfield, et al. - 1998
3	The position end-set tree: A small automaton for word recognition in biological sequences - Lefevre, Ikeda - 1993
1	Average size of suffix trees - Blumer, Ehrenfeucht, et al. - 1989
1	Aoe, ‘A method of compressing trie structures’, Software—Practice and Experience - Morimoto, Iriguchi, et al. - 1994