Abstract
We present a version of the alphabet-independent linear-time 2-dimensional pattern matching algorithm of Galil and Park (GP algorithm). The main part of GP algorithm is the construction of a so-called witness table. We develop a series of new tools that makes this construction easier to understand. Some properties of paths on lattices are considered. A useful concept of long duels is introduced, and applied to the 2D-matching problem. Special types of patterns with large monochromatic centers are introduced and investigated. One of the iterations in GP algorithm (related to radiant-periodic images) is removed. Other iterations are simplified, one due to the use of long duels, and the other due to the use of a simpler algorithm for the computation of witnesses for vectors lying on the same line. We give a simpler algorithm for the so-called suffix-testing problem, which is crucial in GP algorithm. As a consequence, our algorithm avoids the need for suffix trees (as well as their compacted versions) that are considered in GP algorithm.
Partially supported by PRC Math-Info and NATO Grant CRG 900293.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Amir, G. Benson, Two-dimensional periodicity and its application, in: (Proc. Symp. On Discrete Algorithms, 1992) 440–452.
A. Amir, G. Benson, M. Farach, Alphabet-independent two-dimensional matching, in: (Proc. 24th ACM Symp. on Theory Of Computing, 1992) 59–68.
T.P. Baker, A technique for extending rapid exact-match string-matching to arrays of more than one dimension, SIAM J. Comput. 7 (1978) 533–541.
R.S. Bird, Two-dimensional pattern-matching, Inf. Process. Lett. 6 (1977) 168–170.
R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Hariharan, S. Muthukrishnan, K. Park, W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, in: (FOCS'93, 1993) 248–258.
Z. Galil, K. Park, Truly alphabet-independent two-dimensional matching, in: (Proc. 33rd Annual IEEE Symposium on the Foundations of Computer Science, 1992) 247–256.
D.E. Knuth, J.H. Morris Jr, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323–350.
U. Vishkin, Optimal parallel pattern matching in strings, Information and Control 67 (1985) 91–113.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crochemore, M., Rytter, W. (1995). On linear-time alphabet-independent 2-dimensional pattern matching. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_91
Download citation
DOI: https://doi.org/10.1007/3-540-59175-3_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59175-7
Online ISBN: 978-3-540-49220-7
eBook Packages: Springer Book Archive