113 search results - page 11 / 23 » Combinatorics of Periods in Strings |
195
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
155
click to vote
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
149
click to vote
CPM
1993
Springer
15 years 10 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
215
click to vote
CPM
1998
Springer
15 years 10 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...
152
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...