Abstract
The suffix tree of a string S is a compacted trie that represents all suffixes of S. Linear-time algorithms for constructing the suffix tree have been known for quite a while. In two dimensions, however, linear-time construction of two-dimensional suffix trees has been an open problem.We present the first linear-time algorithm for constructing two-dimensional suffix trees.
This work is supported by S.N.U. Research Fund 99-11-1-063.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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, Addison-Wesley, 1974.
A. Amir and M. Farach, Two-dimensional dictionary matching, Inform. Processing Letters 21 (1992), 233–239.
A. Apostolico, The myriad virtues of subword trees, Combinatorial Algorithms on Words, Springer-Verlag, (1985), 85–95
M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1994.
M. Farach, Optimal suffix tree construction with large alphabets, IEEE Symp. Found. Computer Science (1997), 137–143.
M. Farach and S. Muthukrishnan, Optimal logarithmic time randomized suffix tree construction, Int. Colloq. Automata Languages and Programming (1996), 550–561.
R. Giancarlo, A generalization of the suffix tree to square matrices with application, SIAM J. Comput. 24, (1995), 520–562.
R. Giancarlo and R. Grossi, Parallel construction and query of suffix trees for two-dimensional matrices, ACM Symposium on Parallel Algorithms and Architectures (1993), 86–97.
R. Giancarlo and R. Grossi, On the construction of classes of suffix trees for square matrices: algorithms and applications, Information and Computation 130 (1996), 151–182.
R. Giancarlo and R. Grossi, Suffix Tree Data Structures for Matrices. Chap. 11 in Pattern Matching Algorithms, A. Apostolico and Z. Galil eds, Oxford University Press, (1997), 293–340.
G.H. Gonnet, Efficient searching of text and pictures, Technical report, Univ. of Waterloo OED-88-02, (1988).
D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984), 338–355.
R. Hariharan, Optimal parallel suffix tree construction, IEEE Symp. Found. Computer Science (1994), 290–299.
D.K. Kim, Y.A. Kim, and K. Park, Constructing su_x arrays for multi-dimensional matrices, Symp. Combinatorial Pattern Matching (1998), 249–260.
U. Manber and G. Myers, Suffix arrays: A new method for on-line string searches, SIAM J. Comput. 22, (1993), 935–938.
E.M. McCreight, A space-economical suffix tree construction algorithms, J. Assoc. Comput. Mach. 23 (1976), 262–272.
S.C. Sahinalp and U. Vishkin, Symmetry breaking for suffix tree construction, IEEE Symp. Found. Computer Science (1994), 300–309.
B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17, (1988), 1253–1262.
D.D. Sleater and R.E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26, (1983), 362–391.
E. Ukkonen, On-line construction of suffix trees, Algorithmica 14 (1995), 249–260.
P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory (1973), 1–11.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, D.K., Park, K. (1999). Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_43
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive