Efficient parameterized string matching
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. (c) 2006 Elsevier B.V. All rights reserved.
parameterized string matching algorithms bit-parallelism suffix automaton