Permuted Scaled Matching
Permuted Scaled Matching. Ayelet Butman Noa Lewenstein Ian Munro. Scale d matching. Input: Text T=t 1 ,…,t n Pattern P=p 1 ,…,p m Scaling: P [ i ] =p 1 …p 1 p 2 …p 2 … p m …p m Output: All text-locations j where i s.t. p [ i ] matches at j. . i. i. i. Scaled matching.
1.03k views • 92 slides