%0 Journal Article
%T Quick Boyer-Moore Algorithm for String Matching<br>一种串匹配的快速Boyer-Moore算法*
%A LI Xue-mei
%A DAI Liu-Ling
%A TONG Xin-hai
%A LI Li
%A <br>李雪梅
%A 代六玲
%A 童新海
%A 李莉
%J 计算机应用研究
%D 2005
%I 
%X 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.
%K String Matching
%K Boyer-Moore Algorithm
%K Improved Boyer-Moore Algorithm
%K Quick Boyer-Moore Algorithm<br>串匹配
%K Boyer-Moore算法
%K Improved
%K Boyer-Moore算法
%K Quick
%K Boyer-Moore算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=21E6E869FC45AF3B&yid=2DD7160C83D0ACED&vid=BC12EA701C895178&iid=9CF7A0430CBB2DFD&sid=2A3781E88AB1776F&eid=987EDA49D8A7A635&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=3&reference_num=5