2 search results - page 1 / 1 » Fully Compressed Pattern Matching Algorithm for Balanced Str... |
SPIRE
2000
Springer
13 years 8 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...