Issue No. 02 - April (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.382300
<p><it>Abstract</it>—The two-dimensional pattern matching problem is to find the occurrences of a given two-dimensional pattern array in a two-dimensional text array. This paper presents two efficient algorithms, which combine Fan-Su and Aho-Corasick string search algorithms, to solve this problem. The proposed algorithms need not inspect each character of the text array during the pattern matching in most cases. Additionally, unlike the algorithms proposed by Zhu and Takaoka which are based on the hashing method, these new algorithms require no preprocessing of the text array. The comparison of the performance among various algorithms are depicted in this paper. The result shows that the proposed algorithms are about three to six times faster than the best algorithm proposed previously when the size of the pattern array is less than 1/100 of the size of the text array, which occurs frequently in many applications.</p>
Two-dimensional pattern matching, multiple-pattern matching, algorithms, finite state automata, computational complexity.
K. Su and J. Fanm, "The Design of Efficient Algorithms for Two-Dimensional Pattern Matching," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 318-327, 1995.