期刊文献+

一种BM模式匹配的改进算法 被引量:2

The Improving Algorithm of BM
下载PDF
导出
摘要 分析了几种模式匹配算法,通过对BM模式匹配算法的研究,提出一种基于BM模式匹配算法的改进思路。改进算法通过对模式串的预处理提高匹配跳跃的步长,从时间和空间复杂度分析,该改进算法提高了模式匹配的效率,实验证明模式字符串的重复率越低的情况下可以大大提高匹配的效率。 Based on the study of BF, KMP and BM algorithm, BM algorithm is analyzed. To increase the speed of algorithm,the shift position that has matched partially in BM algorithm is improved. A new shift distance function is added based on the old one, and marked the most of known information to increase the shift distance so that it is more efficient. In the end, by citing specific examples an analysis of the BM algorithm that is modified is carded out. The results show that the BM algorithm that is modified is quicker and more efficient.
出处 《后勤工程学院学报》 2008年第1期54-57,共4页 Journal of Logistical Engineering University
关键词 BF算法 KMP算法 BM算法 模式匹配 时间复杂度 BF algorithm KMP algorithm BM algorithm patter matching time complexity
  • 相关文献

参考文献5

二级参考文献22

  • 1[1]Crochemore M, Rytter W. Text algorithms[M]. Oxford University Press, 1994.
  • 2[2]Berry T, Ravindran S. A Fast String Matching Algorithm and Experimental Results[A]. Proceedings of the Prague Stringology Club Workshop ′99[C], 1999.16-28.
  • 3[3]Knuth DE, Morris Jr JH, Prath VR. Fast pattern matching in strings[J]. SIAM J.Comput., 1977,6(1):323-350.
  • 4[4]Boyer RS, Moore JS. A Fast String Searching Algorithm[J]. Commun. ACM, 1977, 20(10):762-772.
  • 5[5]Hume A, Sunday DM. Fast String Searching[J]. Softw. Pract. Exp., 1991, 21(11):1221-1248.
  • 6[6]Sunday DM. A Very Fast Substring Search Algorithm[J]. Commun. ACM, 1990, 33(8):132-142.
  • 7[7]Cormen TH, Leiserson CE, Rivest RL. Introduction to Algorithms[M]. The MIT Press, 1990.
  • 8[8]Lecroq T. Experimental Results on String-matching Algorithms[J]. Softw. Pract. Exp., 1995, 25(7):727-765.
  • 9网络世界.入侵检测技术综述[EB/OL].http:∥www.cnw.com.cn/,.
  • 10Boyer RS,Moore JS.A fast string searching algorithm[J].Communication of the ACM,1997; (20)

共引文献41

同被引文献12

引证文献2

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部