A technique for two-dimensional pattern matching

Authors:
Rui Feng Zhu;Tadao Takaoka
Affiliations:
Univ. of Ibaraki, Hitachi, Japan;Univ. of Ibaraki, Hitachi, Japan
Venue:
Communications of the ACM - Special issue: multiprocessing
Year:
1989

Citing 6
Cited 16

Algorithms for pattern matching

Software—Practice & Experience
The Boyer Moore Galil string searching strategies revisited

SIAM Journal on Computing
On improving the average case of the Boyer-Moore string matching algorithm

Journal of Information Processing
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

Mesh and pyramid algorithms for iconic indexing

ICS '91 Proceedings of the 5th international conference on Supercomputing
Multiple matching of rectangular patterns

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Two and higher dimensional pattern matching in optimal expected time

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Design of Efficient Algorithms for Two-Dimensional Pattern Matching

IEEE Transactions on Knowledge and Data Engineering
3D-List: A Data Structure for Efficient Video Query Processing

IEEE Transactions on Knowledge and Data Engineering
Fast Multi-dimensional Approximate Pattern Matching

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Multipattern string matching with q-grams

Journal of Experimental Algorithmics (JEA)
Efficient process-hotspot detection using range pattern matching

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Accurate detection for process-hotspots with vias and incomplete specification

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
FCA-Based Two Dimensional Pattern Matching

ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Tuning string matching for huge pattern sets

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Automatically extracting class diagrams from spreadsheets

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
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
An indexing method for two-d pattern matching with applications to digital image searches

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Approximate string matching with reduced alphabet

Algorithms and Applications
Exact online two-dimensional pattern matching using multiple pattern matching algorithms

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

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.