A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximate parameterized matching

2007
*
ACM Transactions on Algorithms
*

Two equal length strings s and s , over alphabets Σ s and Σ s , parameterize match if there exists a bijection π : Σ s → Σ s , such that π(s) = s , where π(s) is the renaming of each character of s via π. Parameterized matching is the problem of finding all parameterized matches of a pattern string p in a text t and approximate parameterized matching is the problem of finding, at each location, a bijection π that maximizes the number of characters that are mapped from p to the appropriate

doi:10.1145/1273340.1273345
fatcat:yenuutsh6nbrlpkfahwef5dl4m