| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429250 | Information Processing Letters | 2006 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
