SIAM Journal on Computing
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
Text algorithms
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
Pattern matching algorithms
A fast string searching algorithm
Communications of the ACM
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
| Hi-index | 0.00 |
We present problems in different application areas: tandem repeats (computational biology), poetry and music analysis, and author validation, that require a more sophisticated pattern matching model that hitherto considered. We introduce a new matching criterion – generalized function matching – that encapsulates the notion suggested by the above problems The generalized function matching problem has as its input a text T of length n over alphabet ΣT ∪ {φ } and a pattern P=P[0]P[1]...P[m−1] of length m over alphabet ΣP ∪ { φ } We seek all text locations i where the prefix of the substring that starts at i is equal to f(P[0])f(P[1])...f(P[m–1]) for some function f: ΣP → ΣT*. We give a polynomial time algorithm for the generalized pattern matching problem over bounded alphabets We identify in this problem an important new phenomenon in pattern matching One where there is a significant complexity difference between the bounded alphabet and infinite alphabet case We prove that the generalized pattern matching problem over infinite alphabets is ${\mathcal NP}$-hard To our knowledge, this is the first case in the literature where a pattern matching problem over a bounded alphabet can be solved in polynomial time but the infinite alphabet version is ${\mathcal NP}$-hard.