Quick Boyer-Moore Algorithm for String Matching
一种串匹配的快速Boyer-Moore算法*

This paper suggests a very efficient algorithm for string matching, Quick Boyer-Moore(QBM) algorithm, based on the ideas of the Boyer-Moore(BM) algorithm and the Quick Search(QS) algorithm. Besides the match and mismatch information inside the current window used by the Boyer-Moore algorithm, QBM also uses the information carried by the character immediately after the current window. The good-suffix shift distance of QBM is larger than that of BM algorithm in most circumstances. The tests on actual corpus show that QBM is more efficient than BM and the Improved Boyer-Moore(IBM) algorithm.