A technique for two-dimensional pattern matching
- 1 September 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 32 (9) , 1110-1120
- https://doi.org/10.1145/66451.66459
Abstract
By reducing an array matching problem to a string matching problem in a natural way, it is shown that efficient string matching algorithms can be applied to arrays, assuming that a linear preprocessing is made on the text.Keywords
This publication has 6 references indexed in Scilit:
- Algorithms for pattern matchingSoftware: Practice and Experience, 1986
- The Boyer–Moore–Galil String Searching Strategies RevisitedSIAM Journal on Computing, 1986
- On improving the worst case running time of the Boyer-Moore string matching algorithmCommunications of the ACM, 1979
- Two dimensional pattern matchingInformation Processing Letters, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Efficient string matchingCommunications of the ACM, 1975