Generalised Pattern Matching Revisited

Bartłomiej Dudek, Paweł Gawrychowski & Tatiana Starikovskaya
In the problem of Generalised Pattern Matching (GPM) [STOC'94, Muthukrishnan and Palem], we are given a text T of length n over an alphabet Σ_T, a pattern P of length m over an alphabet Σ_P, and a matching relationship ⊆ Σ_T × Σ_P, and must return all substrings of T that match P (reporting) or the number of mismatches between each substring of T of length m and P (counting). In this work, we improve...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.