101
Voted
JDA
2007
15 years 2 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...