61 search results - page 1 / 13 » On obtaining the Boyer-Moore string-matching algorithm by pa... |
IPL
2006
13 years 5 months ago
2006
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
CPM
2000
Springer
13 years 9 months ago
2000
Springer
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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
FCCM
2009
IEEE
13 years 9 months ago
2009
IEEE
FPGA has long been considered an attractive platform for high performance implementations of string matching. However, as the size of pattern dictionaries continues to grow, such ...