49 search results - page 1 / 10 » Approximate String Matching with Lempel-Ziv Compressed Index... |
81
Voted
SPIRE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
ISMB
1998
15 years 6 days ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
91
Voted
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
DCC
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...