Boyer-Moore algorithm

Boyer-Moore algorithm

A formula that speeds up searching for text. Instead of comparing each character in the target area, the pointer is moved ahead by several bytes based on the last non-matching characters.
References in periodicals archive ?
However, our experiment result shows that this brutal force algorithm performed equally efficient compared with both the Knuth-Morris-Pratt (KMP) algorithm and the Boyer-Moore algorithm in the siRNA off-target homology search.
Many hybrids algorithms are based on Boyer-Moore algorithm [4], Kunth-Moris-pratt algorithms [1], Horspool algorithms [6], Cloussi algorithms [7], Galil-Giancarlo algorithms [8], Quick Search algorithm [9][10], Zhu-Takaoka algorithm [11], Berry-Ravindran algorithm [12], Turbo-BM algorithm [13] and many more are also the variants of BM and KMP algorithms.
Conclusions: Hybrid algorithm clearly shows comparison it performs better than its parent algorithm as well as some of fast string matching algorithms such as Quick search, Boyer-Moore algorithm.
However, the changes of memory usage with the increase of the keyword set sizes for the set-wise multi-pattern Boyer-Moore algorithm and Wu-Manber algorithm are not evident.
Our algorithm is based on finite automata theory, as in the Knuth-Morris-Pratt algorithm [24], and also exploits the finiteness of the alphabet, as in the Boyer-Moore algorithm [12].
The two most famous algorithms for this problem are the Boyer-Moore algorithm [3] and the Knuth Morris Pratt algorithm [10].