Sciweavers

8 search results - page 1 / 2
» Searching BWT Compressed Text with the Boyer-Moore Algorithm...
Sort
View
DCC
2002
IEEE
14 years 4 months ago
Searching BWT Compressed Text with the Boyer-Moore Algorithm and Binary Search
Tim Bell, Matt Powell, Amar Mukherjee, Donald A. A...
WIA
2007
Springer
13 years 10 months ago
Accelerating Boyer Moore Searches on Binary Texts
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
Shmuel Tomi Klein, Miri Ben-Nissan
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
13 years 9 months 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
CCP
2011
92views more  CCP 2011»
12 years 4 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...
DCC
2010
IEEE
13 years 11 months ago
A New Searchable Variable-to-Variable Compressor
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
Nieves R. Brisaboa, Antonio Fariña, Juan-Ra...