Algorithms
A technique for two-dimensional pattern matching
Communications of the ACM - Special issue: multiprocessing
On improving the worst case running time of the Boyer-Moore string matching algorithm
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
An Efficient Algorithm for Matching Multiple Patterns
IEEE Transactions on Knowledge and Data Engineering
3D-List: A Data Structure for Efficient Video Query Processing
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
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.