134 search results - page 2 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
CSB
2004
IEEE
14 years 2 months ago
2004
IEEE
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 ...
CORR
2008
Springer
13 years 10 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...
CPM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The Knuth-Morris-Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the...
DCC
2010
IEEE
14 years 5 months ago
2010
IEEE
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...
STACS
1992
Springer
14 years 2 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...