Haruki Ideguchi

Efficient Parameterized Pattern Matching in Sublinear Space

2023 · arXiv (Cornell University)

The parameterized matching problem is a variant of string matching, which is to search for all parameterized occurrences of a pattern $P$ in a text $T$. In considering matching algorithms, the combinatorial natures of strings, …