Sciweavers

273 search results - page 17 / 55
» Compressed String Dictionaries
Sort
View
IWOCA
2009
Springer
193views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Gray Code Compression
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...
Darko Dimitrov, Tomás Dvorák, Petr G...
DCC
2011
IEEE
13 years 2 months ago
Improving PPM Algorithm Using Dictionaries
—We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic ide...
Yichuan Hu, Jianzhong (Charlie) Zhang, Farooq Khan...
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
14 years 2 days ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 3 months ago
A Bijective String Sorting Transform
Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compressio...
Joseph Yossi Gil, David Allen Scott
SPIRE
2007
Springer
14 years 1 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 ...