1 paper
Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka +1
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 alg…