Sciweavers

134 search results - page 1 / 27
» A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Sort
View
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
13 years 9 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
WIA
2007
Springer
13 years 11 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
ICPR
2008
IEEE
13 years 11 months ago
A new method to obtain the shift-table in Boyer-Moore's string matching algorithm
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
Yang Wang