139
click to vote
SPIRE
2000
Springer
15 years 6 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...