Years and Authors of Summarized Original Work
2007; Na, Giancarlo, Park
2011; Kim, Na, Sim, Park
Problem Definition
This entry is concerned with designing and building indexes of a two-dimensional matrix, which is basically the generalization of indexes of a string, the suffix tree [12] and the suffix array [11], to a two-dimensional matrix. This problem was first introduced by Gonnet [7]. Informally, a two-dimensional analog of the suffix tree is a tree data structure storing all submatrices of an n × m matrix, n ≥ m. The submatrix tree [2] is an incarnation of such indexes. Unfortunately, building such indexes requires \(\Omega\)(nm2) time [2]. Therefore, much of the attention paid has been restricted to square matrices and submatrices, the important special case in which much better results are available.
For square matrices, the Lsuffix tree and its array form, storing all square submatrices of an n × n matrix, have been proposed [3, 9, 10]. Moreover, the general framework for...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Cole R, Hariharan R (2003) Faster suffix tree construction with missing suffix links. SIAM J Comput 33:26–42
Giancarlo R (1993) An index data structure for matrices, with applications to fast two-dimensional pattern matching. In: Proceedings of workshop on algorithm and data structures, Montréal. Springer Lecture notes in computer science, vol 709, pp 337–348
Giancarlo R (1995) A generalization of the suffix tree to square matrices, with application. SIAM J Comput 24:520–562
Giancarlo R, Grossi R (1996) On the construction of classes of suffix trees for square matrices: algorithms and applications. Inf Comput 130:151–182
Giancarlo R, Grossi R (1997) Suffix tree data structures for matrices. In: Apostolico A, Galil, Z (eds) Pattern matching algorithms, ch. 11. Oxford University Press, Oxford, pp 293–340
Giancarlo R, Guaiana D (1999) On-line construction of two-dimensional suffix trees. J Complex 15:72–127
Gonnet GH (1988) Efficient searching of text and pictures. Technical report OED-88-02, University of Waterloo
Kim DK, Kim YA, Park K (1998) Constructing suffix arrays for multi-dimensional matrices. In: Proceedings of the 9th symposium on combinatorial pattern matching, Piscataway, pp 249–260
Kim DK, Kim YA, Park K (2003) Generalizations of suffix arrays to multi-dimensional matrices. Theor Comput Sci 302:401–416
Kim DK, Na JC, Sim JS, Park K (2011) Linear-time construction of two-dimensional suffix trees. Algorithmica 59:269–297
Manber U, Myers G (1993) Suffix arrays: a new method for on-line string searches. SIAM J Comput 22:935–948
McCreight EM (1976) A space-economical suffix tree construction algorithms. J ACM 23:262–272
Na JC, Giancarlo R, Park K (2007) On-line construction of two-dimensional suffix trees in O(n2log n) time. Algorithmica 48:173–186
Storer JA (1996) Lossless image compression using generalized LZ1-type methods. In: Proceedings of data compression conference, Snowbird, pp 290–299
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Na, J., Ferragina, P., Giancarlo, R., Park, K. (2016). Indexed Two-Dimensional String Matching. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_442
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_442
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering