Sciweavers

4 search results - page 1 / 1
» A new method to obtain the shift-table in Boyer-Moore's stri...
Sort
View
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
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
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...
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 8 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram