Sciweavers

SPIRE
2009
Springer
14 years 2 months ago
Generalised Matching
Given a pattern p over an alphabet Σp and a text t over an alphabet Σt, we consider the problem of determining a mapping f from Σp to Σ+ t such that t = f(p1)f(p2) . . . f(pm)....
Raphaël Clifford, Aram Wettroth Harrow, Alexa...