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
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Text algorithms
Efficient 2-dimensional approximate matching of half-rectangular figures
Information and Computation
Profile assisted register allocation
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Fusion-based register allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth 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
Genetic Algorithms for Protein Threading
ISMB '98 Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Pattern matching with address errors: rearrangement distances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Journal of Discrete Algorithms
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
Periodicity and repetitions in parameterized strings
Discrete Applied Mathematics
Property matching and weighted matching
Theoretical Computer Science
Note: Pattern matching with pair correlation distance
Theoretical Computer Science
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Pattern Matching with Pair Correlation Distance
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Pattern matching with address errors: Rearrangement distances
Journal of Computer and System Sciences
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
A faster algorithm for the computation of string convolutions using LZ78 parsing
Information Processing Letters
Information Processing Letters
Sublinear algorithms for parameterized matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Approximate matching in the L1 metric
CPM'05 Proceedings of the 16th 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
String rearrangement metrics: a survey
Algorithms and Applications
Approximate function matching under δ- and γ- distances
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Information Sciences: an International Journal
A note on the complexity of matching patterns with variables
Information Processing Letters
| Hi-index | 0.00 |
We introduce a new matching criterion - function matching - that captures several different applications. The function matching problem has as its input a text T of length n over alphabet ΣT and a pattern P = P[1]P[2] ... P[m] of length m over alphabet ΣP. We seek all text locations i for which, for some function f : ΣP → ΣT (f may also depend on i), the m-length substring that starts at i is equal to f(P[1])f(P[2]) ... f(P[m]). We give a randomized algorithm which, for any given constant k, solves the function matching problem in time O(n log n) with probability 1/nk of declaring a false positive. We give a deterministic algorithm whose time is O(n|ΣP| logm) and show that it is almost optimal in the newly formalized convolutions model. Finally, a variant of the third problem is solved by means of two-dimensional parameterized matching, for which we also give an efficient algorithm.