Two dimensional pattern matching
References (3)
- et al.
Efficient string matching
C. ACM
(1975)
There are more references available in the full text version of this article.
Cited by (108)
Periodicity in rectangular arrays
2017, Information Processing LettersCitation Excerpt :The literature features a good deal of previous work on pattern matching in two-dimensional arrays. The problem of finding every occurrence of a fixed rectangular pattern in a rectangular array was first solved independently by Bird [6] and by Baker [5]. Amir and Benson later introduced the notion of two-dimensional periodicity in a series of papers [2,1,3].
Two-Dimensional Block Trees
2024, Computer JournalPattern matching and text compression algorithms
2022, Computing Handbook: Two-Volume SetComputing covers of 2D-Strings
2021, Leibniz International Proceedings in Informatics, LIPIcsThe number of repetitions in 2D-strings
2020, Leibniz International Proceedings in Informatics, LIPIcs
Copyright © 1977 Published by Elsevier B.V.