13 search results - page 1 / 3 » An Improved Pattern Matching Algorithm for Strings in Terms ... |
CPM
1997
Springer
13 years 9 months ago
1997
Springer
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
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...
CPM
1998
Springer
13 years 9 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
CPM
1995
Springer
13 years 8 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...