A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Function Matching: Algorithms, Applications, and a Lower Bound
[chapter]
2003
Lecture Notes in Computer Science
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 ΣP . We seek all text locations i for which, for some function f : ΣP → ΣT (f may also depend on i), the m-length substring that starts at i is equal to We give a randomized algorithm which, for any given constant k, solves the function
doi:10.1007/3-540-45061-0_72
fatcat:kx6jrpya3jdalifhx2avotsn2q