Three-dimensional pattern matching
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Inplace run-length 2d compressed search
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On Fine and Wilf's theorem for bidimensional words
Theoretical Computer Science
Multidimensional matching and fast search in suffix trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Inplace 2D matching in compressed images
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Inplace run-length 2d compressed search
Theoretical Computer Science
On a conjecture on bidimensional words
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Inplace 2D matching in compressed images
Journal of Algorithms
Parallel two dimensional witness computation
Information and Computation
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Theoretical Computer Science
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A multidimensional critical factorization theorem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Journal of Discrete Algorithms
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
Parameterized matching on non-linear structures
Information Processing Letters
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Algorithms and theory of computation handbook
Succinct 2D dictionary matching with no slowdown
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Faster two dimensional scaled matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Two dimensional parameterized matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hi-index | 0.01 |
There are many solutions to the string matching problem that are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms is very weak: they allow only simple arithmetic and comparisons of equality between characters of the input. In contrast, algorithms for two-dimensional matching have needed stronger models of computation, most notably assuming a totally ordered alphabet. The fastest algorithms for two-dimensional matching have therefore had a logarithmic dependence on the alphabet size. In the worst case, this gives an algorithm that runs in $O(n^2 \log{m})$ with $O(m^2 \log m)$ preprocessing. The authors show an algorithm for two-dimensional matching with an $O(n^2)$ text-scanning phase. Furthermore, the text scan requires no special assumptions about the alphabet, i.e., it runs on the same model as the standard linear-time string-matching algorithm. The pattern preprocessing requires an ordered alphabet and runs with the same alphabet dependency as the previously known algorithms.