一种高速精确单模式串匹配算法_范洪博教材.pdfVIP

ISSN 1000-1239 CN 11-1777 TP Journal of Computer Research and Development 6(8):13 1-13 8, 2009 1, 2 1 范洪博 　　姚念民 1 (　　150001) 2 (　　152000) (fanhongbo @) A Fast and Exact Single Pattern Matching Algorithm Fan Hongbo1, 2 and Yao Nianmin1 1 (College of Comp uter Science and Technology, Harbin Engineering University, Harbin 150001) 2 (Dep artment of Comp uter S cience and Technology, Suihua University , S uihua, Heilongj iang 152000) Abstract　String matching problem is a fundamental problem in computer science.It is the key problem of many important scopes such as netw ork security, information retrieval and filtration, computational biology, etc.And the design of exact single pattern string matching algorithm w ith high performance is the basis of all string matching problems.In this paper, the authors improve one of the fastest exact single pattern matching algorithms know n on English text, w hich is SBNDM2. The simplest form of the BNDM core loop is obtained, in w hich there are only 5 instructions per character read by amending the relationship betw een position in the pattern and bit in the bitmask. And a cross-border protection method is added to the algorithm in order to reduce the cost of cross- border inspection.Tw o algorithms named S2BNDM and S2BNDM ′are presented.The experimental results indicate that both S2BNDM and S2BNDM ′are faster than SBNDM2 in any case.It can be considered that S2BNDM is the fastest algorithm on English text (2m≤12) DNA sequence (2 m≤8), and S2BNDM ′is the fastest algorithm on English text (13≤m32). Key words　string matching ;exact single pattern;design of algorithm ;bit parallelism;text searching 　　串匹配问题是计算机科学的基础问题之一, 是网络安全、信息检索与过滤、计算生物学等众 领 域的核心问题, 其中, 高速精确单模式匹配算法设计又是各种串匹配问题的基础.基于SBNDM2, 通过 修改位掩码有效位到无符号整数的高位, 将BNDM 算法核心循环化简至最简形式(5 指令 字符), 并引 入越界保护机制, 提出S2BNDM 系列精确单模式匹配算法.实