A technique for two-dimensional pattern matching
Communications of the ACM - Special issue: multiprocessing
A new approach to text searching
Communications of the ACM
Efficient pattern matching with scaling
Journal of Algorithms
Fast two-dimensional pattern matching
Information Processing Letters
Text algorithms
A sublinear algorithm for two-dimensional string matching
Pattern Recognition Letters
A framework to animate string algorithms
Information Processing Letters
Pattern matching algorithms
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Factor Oracle: A New Structure for Pattern Matching
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Fast and Practical Approximate String Matching
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Approximate Multiple Strings Search
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Computer Science Handbook, Second Edition
Computer Science Handbook, Second Edition
Average complexity of exact and approximate multiple string matching
Theoretical Computer Science
Compressed pattern matching for text and images
Compressed pattern matching for text and images
Multipattern string matching with q-grams
Journal of Experimental Algorithmics (JEA)
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science
Valgrind: a framework for heavyweight dynamic binary instrumentation
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Hierarchical multi-pattern matching algorithm for network content inspection
Information Sciences: an International Journal
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
WM+: an optimal multi-pattern string matching algorithm based on the WM algorithm
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
A partition-based efficient algorithm for large scale multiple-strings matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
Baker and Bird and Baeza-Yates and Regnier are two of the most efficient and widely used algorithms for exact online two-dimensional pattern matching. Both use the automaton of the Aho-Corasick multiple pattern matching algorithm to locate all the occurrences of a two-dimensional pattern in a two-dimensional input string, a data structure that is considered by many as inefficient, especially when used to process long patterns or data using large alphabet sizes. This article presents variants of the Baker and Bird and the Baeza-Yates and Regnier algorithms that use the data structures of the Set Horspool, Wu-Manber, Set Backward Oracle Matching, and SOG multiple pattern matching algorithms in place of the automaton of Aho-Corasick and evaluates their performance experimentally in terms of preprocessing and searching time.