文章基本信息

标题：Max-Shift BM and Max-Shift Horspool: Practical Fast Exact String Matching Algorithms
本地全文：下载
作者：Mohammed Sahli ; Tetsuo Shibuya
期刊名称：Information and Media Technologies
电子版ISSN：1881-0896
出版年度：2012
卷号：7
期号：2
页码：721-727
DOI：10.11185/imt.7.721
出版社：Information and Media Technologies Editorial Board
摘要：Exact string matching is the problem of finding all occurrences of a pattern P in a text T . The problem is well-known and many sophisticated algorithms have been proposed. Some fast exact string matching algorithms have been described since the 80s (e.g., the Boyer-Moore algorithm and its simplified version the Boyer-Moore-Horspool algorithm). They have been regarded as the standard benchmarks for the practical exact string search literature. In this paper, we propose two algorithms MSBM (Max-Shift BM) and MSH (Max-Shift BMH) both based on the combination of the bad-character rule of the right-most character used in the Boyer-Moore-Horspool algorithm, the extended bad-character rule and the good-suffix rule used in the Gusfield algorithm, which is a modification of the Boyer-Moore algorithm. Only a small extra space and preprocessing time are needed with respect to the BM and BMH algorithms. Nonetheless, empirical results on different data (DNA, Protein and Text Web) with different pattern lengths show that both MSBM and MSH are very fast in practice. MSBM algorithm usually won against other algorithms.
关键词：exact string matching;information retrieval;Boyer-Moore algorithm;linear time;sublinear time