# Fast Two-Dimensional Pattern Matching

@article{BaezaYates1993FastTP,
title={Fast Two-Dimensional Pattern Matching},
author={Ricardo Baeza-Yates and Mireille R{\'e}gnier},
journal={Inf. Process. Lett.},
year={1993},
volume={45},
pages={51-57}
}
• Published 25 January 1993
• Computer Science
• Inf. Process. Lett.
48 Citations

## Figures and Tables from this paper

### Two and higher dimensional pattern matching in optimal expected time

• Computer Science
SODA '94
• 1994
Algorithms with optimal expected running time are presented for searching the occurrences of a two-dimensional m X m pattern P in a two-dimensional n X n text T over an alphabet of size c. The

### Fast Multi-dimensional Approximate Pattern Matching

• Computer Science
CPM
• 1999
This work addresses the problem of approximate string matching in d dimensions to find a pattern of size m in a text of size n with at most k < m errors (substitutions, insertions and deletions along any dimension), and presents the first search algorithms for the problem.

### Exact and Approximate Two Dimensional Pattern Matchingallowing RotationsKimmo Fredriksson

• Computer Science
• 2001
This work considers the cases of exact and approximate matching under several matching models, improving the previous results, and generalizes the algorithms for the matching model where the sum of absolute diierences between characters is at most k.

### Fast Two-Dimensional Approximate Pattern Matching

• Computer Science
LATIN
• 1998
These are the first search algorithms for the problem of approximate string matching in d dimensions, and the first sublinear-time (on average) searching algorithm is presented, which is O(knd/md-1) for k < (m/(d(logσ m- logσ d)))d-1, where σ is the alphabet size.

### Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations

• Computer Science
CPM
• 2002
We give fast filtering algorithms to search for a 2- dimensional pattern in a 2-dimensional text allowing any rotation of the pattern. We consider the cases of exact and approximate matching under

### A Rotation Invariant Filter for Two-Dimensional String Matching

• Computer Science
CPM
• 1998
A fast filtration-type algorithm is developed that finds in T the locations where a rotated P can occur and the, corresponding rotations are also found.

### New Models and Algorithms for Multidimensional Approximate Pattern Matching

• Computer Science
• 2000
We focus on how to compute the edit distance (or similarity) b etween two images and the problem of approximate string matching in two dimens ions, that is, to find a pattern of sizem m in a text of

### Exact online two-dimensional pattern matching using multiple pattern matching algorithms

• Computer Science
JEAL
• 2013
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 are presented.

## References

SHOWING 1-10 OF 20 REFERENCES

### Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version)

• Computer Science
SWAT
• 1990
A new algorithm for searching a twodimensional m × m pattern in a two dimensional n × n text is presented, which improves on previous results in both time: n2 and space: n or m2, and is nearly optimal.

### Fast Pattern Matching in Strings

• Computer Science
SIAM J. Comput.
• 1977
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.

### Efficient Randomized Pattern-Matching Algorithms

• Computer Science, Mathematics
IBM J. Res. Dev.
• 1987
We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first

### On the exact complexity of string matching

• Computer Science
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
• 1990
The maximal number of character comparisons made by a linear-time string matching algorithm, given a text string of length n and a patternstring of length m over a general alphabet, is investigated and C/sub online/ is determined exactly.

### A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension

• T. Baker
• Computer Science
SIAM J. Comput.
• 1978
A class of algorithms is presented for very rapid on-line detection of occurrences of a fixed set of pattern arrays as embedded subarrays in an input array. By reducing the array problem to a string

### Alphabet independent two dimensional matching

• Computer Science
STOC '92
• 1992
An algorithm for two dimensional matching with an 0(n2) text scanning phase that runs on the same model as standard linear time string matching algorithm and requires no special assumptions about the alphabet.

### A technique for two-dimensional pattern matching

• Computer Science
CACM
• 1989
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

### Efficient string matching

• Economics, Computer Science
Commun. ACM
• 1975
A simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text that has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.

### Knuth-Morris-Pratt Algorithm: An Analysis

This paper deals with an average analysis of the Knuth-Morris-Pratt algorithm, and it is proven that c ∼ 1+1/q, the constant of linearity c, when the cardinality q of the alphabet is large.