Software—Practice & Experience
A new approach to text searching
Communications of the ACM
Approximate Boyer-Moore string matching
SIAM Journal on Computing
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
String matching in the DNA alphabet
Software—Practice & Experience
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
Multipattern string matching with q-grams
Journal of Experimental Algorithmics (JEA)
Efficient parameterized string matching
Information Processing Letters
Two dimensional parameterized matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Software maintenance by multi-patterns parameterized string matching with q-gram
ACM SIGSOFT Software Engineering Notes
Parameterized string matching: an application to software maintenance
ACM SIGSOFT Software Engineering Notes
Efficient algorithm for detecting parameterized multiple clones in a large software system
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Approximate string matching with reduced alphabet
Algorithms and Applications
Plagiarism detection in software using efficient string matching
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
Two strings parameterize match if there is a bijection defined on the alphabet that transforms the first string character by character into the second string. The problem of finding all parameterized matches of a pattern in a text 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.