Alphabet dependence in parameterized matching (1994) [12 citations — 6 self]
Abstract:
The classical pattern matching paradigm is that of seeking occurrences of one string in another, where both strings are drawn from an alphabet set \Sigma. A recently introduced model is that of parameterized pattern matching. The main motivation for this scheme lies in software maintenance where program fragments are considered "identical " even if variables names are different. Besides the fixed symbols from \Sigma, strings under this model have additional symbols from a variable set \Pi and occurrences of one string in the other are sought, where renaming of the variables from \Pi is allowed in a match. In this paper we provide an algorithm to find all occurrences of a pattern string of length m in a text string of length n under the parameterized pattern matching model. Our algorithm takes time O(n log), where = min(m; j\Pij), independent of j\Sigmaj. Our algorithm is optimal since we show that this dependence on j\Pij is inherent to any algorithm for this problem in the comparison model. 1
Citations
| 447 | Fast pattern matching in strings – Knuth, Morris, et al. - 1977 |
| 377 | A fast string searching algorithm – Boyer, Moore - 1977 |
| 52 | Parameterized pattern matching: Algorithms and applications – Baker - 1996 |
| 32 | Efficient string matching – Aho, Corasick - 1975 |
| 31 | Time-space-optimal string matching – Galil, Seiferas - 1983 |
| 17 | Near-optimal Time-Space Tradeoff for Element Distinctness – Yao - 1988 |
| 14 | A Time-Space Tradeoff for Element Distinctness – Borodin, Fich, et al. - 1987 |
| 2 | multiple matching of parameterized patterns. submitted for publication – Idury, Schaffer - 1993 |

