Function Matching: Algorithms, Applications, and a Lower Bound

Download PDF
Open Webpage

Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat

Published: 2003, Last Modified: 12 May 2025ICALP 2003EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We introduce a new matching criterion — function matching — that captures several different applications. The function matching. problem has as its input a text T of length n over alphabet Σ T and a pattern P = P[1]P[2] ... P[m] of length m over alphabet Σ T. We seek all text locations i for which, for some function f: Σ T → Σ T (f may also depend on i), the m-length substring that starts at i is equal to f(P[1])f(P[2]) ... f(P[m]).