22 search results - page 2 / 5 » Sublinear Algorithms for Approximating String Compressibilit... |
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...
DCC
2002
IEEE
14 years 4 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
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...
SPIRE
2007
Springer
13 years 11 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...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...