Abstract

The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.

Citations

560	G: Suffix arrays: a new method for on-line string searches - Manber, Myers - 1993
546	Fast pattern matching in strings - Knuth, Morris, et al. - 1977
493	A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
244	Sorting and Searching, volume 3 of The Art of Computer Programming - Knuth - 1973
110	The myriad virtues of subword trees - Apostolico - 1985
89	A sublinear algorithm for approximate keyword searching - Myers - 1994
75	An improved algorithm for approximate string matching - Galil, Park - 1990
68	pattern matching algorithms - Linear - 1973
64	Two algorithms for approximate string matching in static texts - Jokinen, Ukkonen - 1991
47	Constructing suffix trees on-line in linear time - Ukkonen - 1992
32	Efficient implementation of suffix trees - Andersson, Nilsson - 1995
30	Improved behaviour of tries by adaptive branching - Andersson, Nilsson - 1993
23	Lexicographical Indices for Text: Inverted Files vs. Pat Trees. Waterloo, Ont.: UW Centre for the New Oxford English Dictionary - Gonnet, Baeza-Yates, et al. - 1991
20	Efficient text searching of regular expressions - Baeza-Yates, Gonnet - 1989
18	Approximate string matching with suffix automata - Ukkonen, Wood - 1993
15	Suffix binary search trees - Irving - 1995
8	All-against-all sequence matching - Baeza-Yates, Gonnet - 1990
6	The Design and Analysis of Computer Algorithms,” Chap. 10 - AHO, HOPCROFT, et al. - 1974