A new approach to text searching
Communications of the ACM
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Alphabet dependence in parameterized matching
Information Processing Letters
Text algorithms
Multiple matching of parameterized patterns
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
SIAM Journal on Computing
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth 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
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
String Searching Algorithms Revisited
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Practical and optimal string matching
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Fast parameterized matching with q-grams
Journal of Discrete Algorithms
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Multi-patterns parameterized shift-and string matching algorithm with super alphabets
Proceedings of the International Conference on Advances in Computing, Communication and Control
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
Verifying and enumerating parameterized border arrays
Theoretical Computer Science
Journal of Discrete Algorithms
| Hi-index | 0.89 |
In parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbols of t. We give simple and practical algorithms for finding all such pattern occurrences in sublinear time on average. The algorithms work for a single and multiple patterns.