A technique for two-dimensional pattern matching
Communications of the ACM - Special issue: multiprocessing
Fast parallel and serial multidimensional approximate array matching
Theoretical Computer Science
Alphabet independent two dimensional matching
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Suffix tree data structures for matrices
Pattern matching algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Suffix Arrays for Multiple Strings: A Method for On-Line Multiple String Searches
ASIAN '96 Proceedings of the Second Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Truly alphabet-independent two-dimensional pattern matching
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Searching patterns in digital image databases
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Hi-index | 0.00 |
The two-dimensional pattern matching problem is to find all occurrences of a two-dimensional m × m matrix P (called the pattern) in another (larger) two-dimensional n × n matrix T (called the text). Most known algorithms for the problem first pre-process the pattern or patterns to make subsequent searches fast. Since each search still takes time proportional to the size of the text, such algorithms are inappropriate in applications in which the text is large and fixed and one will search for many different patterns in the text. We propose an algorithm that first processes the text into an index structure in such a way that subsequent searches with different patterns can be performed very quickly. The construction of the index takes O(n2log n) time and O(n2) space. The algorithm may produce false matches, in which the algorithm claims a “match” between P and some submatrix of T while they are actually not equal. However, as will be seen, the probability that a false match can occur is negligible. All occurrences of P in T, probably with a few false matches, can be found in O(m2) time in the worst case, regardless of the distribution of the elements in T and P. Under the assumption that both T and P are random matrices, the algorithm can find all (correct) occurrences of P in T in O(m + log n) expected time. We applied our algorithm to a digital image search problem and we will present experimental results.