Efficient parameterized string matching |
| |
| Authors: | Kimmo Fredriksson Maxim Mozgovoy |
| |
| Affiliation: | Department of Computer Science, University of Joensuu, P.O. Box 111, 80101 Joensuu, Finland |
| |
| 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. |
| |
| Keywords: | Algorithms Parameterized string matching Bit-parallelism Suffix automaton |
| 本文献已被 ScienceDirect 等数据库收录！ |
