Sciweavers

37 search results - page 2 / 8
» Lempel-Ziv Dimension for Lempel-Ziv Compression
Sort
View
SPIRE
2007
Springer
13 years 11 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
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...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
JASIS
2007
55views more  JASIS 2007»
13 years 4 months ago
Lempel-Ziv compression of highly structured documents
Joaquín Adiego, Gonzalo Navarro, Pablo de l...
ISMB
1998
13 years 6 months ago
Compression of Strings with Approximate Repeats
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...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
DCC
2006
IEEE
14 years 4 months ago
Making the Correct Mistakes
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...
Dharmendra S. Modha, Narayana P. Santhanam
BMCBI
2008
101views more  BMCBI 2008»
13 years 5 months ago
Compressing DNA sequence databases with coil
Background: Publicly available DNA sequence databases such as GenBank are large, and are growing at an exponential rate. The sheer volume of data being dealt with presents serious...
W. Timothy J. White, Michael D. Hendy