Deterministic sampling: a new technique for fast pattern matching
SIAM Journal on Computing
International Journal of Computer Vision
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
SIAM Journal on Computing
Alphabet dependence in parameterized matching
Information Processing Letters
Parameterized pattern matching: algorithms and applications
Journal of Computer and System Sciences
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
SIAM Journal on Computing
Faster suffix tree construction with missing suffix links
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Separable attributes: a technique for solving the sub matrices character count problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Parallel Pattern Matching in Strings (Extended Summary)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Faster algorithms for the construction of parameterized suffix trees
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fast parameterized matching with q-grams
Journal of Discrete Algorithms
On the Longest Common Parameterized Subsequence
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the longest common parameterized subsequence
Theoretical Computer Science
Verifying and enumerating parameterized border arrays
Theoretical Computer Science
Sublinear algorithms for parameterized matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
Two equal length strings, or two equal sized two dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two dimensional parameterized matching is the task of finding all m × m substrings of an n× n text that p-match to an m× m pattern. This models, for example, searching for color images with changing of color maps. We present an algorithm that solves the two dimensional parameterized matching problem in O(n2+m2.5·polylog(m)) time.