33 search results - page 1 / 7 » Compression of Strings with Approximate Repeats |
ISMB
1998
13 years 6 months 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...
APPROX
2007
Springer
13 years 10 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...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
DASFAA
2005
IEEE
13 years 10 months ago
2005
IEEE
Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on ...
SPIRE
2007
Springer
13 years 10 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...