Abstract
We describe a new data structure, the submatrix trees (strees for short). It is a forest of compacted patricia trees representing all sub-matrices of a given matrix TEXT. It can be efficiently built and used to answer quickly a wide variety of queries about TEXT. It can be thought of as a generalization to matrices of the suffix tree of a string [14]. We also introduce the notion of an abstract index data structure for matrices, of which the s-trees is an incarnation, and investigate the inherent space and time needed to build it. We show that the s-trees are optimal for space and within a log factor optimal for time.
On Leave from University of Palermo, ITALY
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA., 1974.
A. Amir, G. Benson, and M. Farach. Alphabet independent two dimensional matching. In Proc. 34th Symposium on Theory of Computing, pages 59–68. ACM, 1992.
A. Amir, M. Farach, R. Idury, J. La Poutre, and A. Schaffer. Improved dynamic dictionary matching. In Proc. Fourth Symposium on Discrete Algorithms, pages 392–401. ACM-SIAM, 1993.
T.J. Baker. A technique for extending rapid exact match string matching to arrays of more than one dimension. SIAM J. on Computing, 7:533–541, 1978.
R.S. Bird. Two dimensional pattern matching. Information Processing Letters, 6:168–170, 1978.
N. G. de Bruijn. A combinatorial problem. Nederl. Akad. Wetensch. Proc., 49:758–764, 1946.
Z. Galil and K. Park. A truly alphabet independent two-dimensional pattern matching algorithm. In Proc. 33th Symposium on Foundations of Computer Science, pages 247–256. IEEE, 1992.
R. Giancarlo. The suffix tree of a square matrix, with applications. In Proc. Fourth Symposium on Discrete Algorithms, pages 402–411. ACM-SIAM, 1993.
G.H. Gonnet. Efficient searching of text and pictures-Extended Abstract. Technical report, University Of Waterloo-ED-88-02, 1988.
I. Idury and A. Schaffer. Multiple matching of rectangular patterns. In Proc. 25th Symposium on Theory of Computing — to appear. ACM, 1993.
R. Jain. Workshop report on visual information systems. Technical report, National Science Foundation, 1992.
D.E. Knuth. The Art of Computer Programming, VOL. 3: Sorting and Searching. Addison-Wesley, Reading, MA., 1973.
U. Manber and E. Myers. Suffix arrays: A new method for on-line string searches. In Proc. First Symposium on Discrete Algorithms, pages 319–327. ACM-SIAM, 1990.
E.M. McCreight. A space economical suffix tree construction algorithm. J. of ACM, 23:262–272, 1976.
A. Rosenfeld and A.C. Kak. Digital Picture Processing. Academic Press, 1982.
D. Sheinwald, A. Lempel, and J. Ziv. Compression of pictures by finite state encoders. In R.M. Capocelli, editor, Sequences: Combinatorics, Compression, Security and Transmission, pages 326–347, Berlin, 1990. Springer-Verlag.
J. A. Storer. Lossy on-line dynamic data compression. In R.M. Capocelli, editor, Sequences: Combinatorics, Compression, Security and Transmission, pages 348–357, Berlin, 1990. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giancarlo, R. (1993). An index data structure for matrices, with applications to fast two-dimensional pattern matching. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_260
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_260
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive