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.
Work supported by the Academy of Finland.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms, chapter 9, pages 318–361. Addison-Wesley, 1974.
A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Inf. Process. Lett., 46(6):295–300, July 1993.
A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Software-Practice and Experience, 25(2):129–141, Feb. 1995.
A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 85–95. Springer-Verlag, 1985.
R. A. Baeza-Yates and G. H. Gonnet. Efficient text searching of regular expressions. In Proc. 16th International Colloquium on Automata, Languages and Programming (ICALP), pages 46–62, 1989.
R. A. Baeza-Yates and G. H. Gonnet. All-against-all sequence matching. Technical report, Department of Computer Science, University of Chile, 1990.
Z. Galil and K. Park. An improved algorithm for approximate string matching. SIAM J. Comput., 19(6):989–999, Dec. 1990.
G. H. Gonnet, R. A. Baeza-Yates, and T. Snider. Lexicographical indices for text: Inverted files vs. PAT trees. Technical Report OED-91-01, Centre for the New OED, University of Waterloo, 1991.
R. W. Irving. Suffix binary search trees. Technical report TR-1995-7, Computing Science Department, University of Glasgow, Apr. 1995.
P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In Proc. 16th International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 240–248, Sept. 1991.
D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming, chapter 6.3, pages 481–505. Addison-Wesley, 1973.
D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM J. Comput., 6(2):323–350, June 1977.
U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22(5):935–948, Oct. 1993.
E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262–272, Apr. 1976.
E. W. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345–374, Oct./Nov. 1994.
Nucleic Acids Research, 20(Sequences Supplement):2009–2210, May 1992.
E. Ukkonen. Constructing suffix trees on-line in linear time. In J. van Leeuwen, editor, Algorithms, Software, Architecture. Information Processing 92, volume 1, pages 484–492, 1992. Full version is to appear in Algorithmica.
E. Ukkonen and D. Wood. Approximate string matching with suffix automata. Algorithmica, 10(5):353–364, Nov. 1993.
P. Weiner. Linear pattern matching algorithms. In Proc. IEEE 14th Annual Symposium on Switching and Automata Theory, pages 1–11, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kärkkäinen, J. (1995). Suffix cactus: A cross between suffix tree and suffix array. In: Galil, Z., Ukkonen, E. (eds) Combinatorial Pattern Matching. CPM 1995. Lecture Notes in Computer Science, vol 937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60044-2_43
Download citation
DOI: https://doi.org/10.1007/3-540-60044-2_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60044-2
Online ISBN: 978-3-540-49412-6
eBook Packages: Springer Book Archive