Heuristic Algorithm for Generalized Function Matching

The problem of generalized function matching can be defined as follows: given a pattern p = p1 ⋯ pm and a text t = t1 ⋯ tn, find a mapping f : ∑p→∑t⁎; and all text locations i such that f(p1)f(p2) ⋯ f(pm)=ti ⋯ tj, a substring of t. By modifying the restrictions of the matching function f, one can ob... View More