Software—Practice & Experience
A new approach to text searching
Communications of the ACM
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Alphabet dependence in parameterized matching
Information Processing Letters
Multiple matching of parameterized patterns
Theoretical Computer Science
A sublinear algorithm for two-dimensional string matching
Pattern Recognition Letters
Combinatorial algorithms: generation, enumeration, and search
ACM SIGACT News
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Faster suffix tree construction with missing suffix links
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A fast string searching algorithm
Communications of the ACM
Speeding Up Two String-Matching Algorithms
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Faster algorithms for the construction of parameterized suffix trees
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Function matching: algorithms, applications, and a lower bound
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Two dimensional parameterized matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Hi-index | 0.00 |
Two strings parameterize match if there is a bijection that transforms the first string character by character into the second string. This problem has been studied in both one and two dimensions but the research has been centered on developing algorithms with good worst-case performance. We present algorithms that solve this problem in sublinear time on average for moderately repetitive patterns.