期刊文献+

基于改进双链树的多模式匹配算法 被引量:2

Arithmetic for matching multiple patterns based on improved doubly-chained tree
下载PDF
导出
摘要 在基于键树的多模式匹配算法中,键树的物理存储方式为双链树。通过借鉴KMP算法的思想,在键树的基础上增加了将辅助跳转结点变成改进的双链树。改进后的存储方式和匹配算法加快了匹配过程,并且做到了在搜索匹配的过程中不用回溯。 In the arithmetic for matching multiple patterns based on digital search tree,the physical storage mode of digital search tree is doubly-chained tree. Using the idea of KMP arithmetic, digital search tree has been turned into improved doubly-chained tree through added assistant jump-node. The improved storage mode and arithmetic have quickened the speed of matching, and have implemented non-backtracking in process of matching.
作者 唐皓 卢显良
出处 《计算机应用》 CSCD 北大核心 2005年第2期365-366,共2页 journal of Computer Applications
关键词 双链树 多模式匹配 无回溯 doubly-chained tree multiple pattern matching non-backtracking
  • 相关文献

参考文献6

  • 1严蔚敏 吴伟民.数据结构(第二版)[M].北京:清华大学出版社,1997..
  • 2IDURY RM, SCHAFFER AA. Multiple matching of rectangular patterns[ J]. Information and Computation, 1995, 117(1) : 78 -90.
  • 3RICHARD C , HARIHARAN R . Tree Pattern Matching and Subset Matching in randomized O( nlog3 m) time[ A]. Conference Proceedings of the Annum ACM Symposium on Theory of Cornputing[ C], 1997.
  • 4RICHARD C. Tree pattern matching to subset matching in linear time[ J]. SIAM Journal on Computing, 2003, 32(4) : 1056 - 1066.
  • 5RAMANA MI . Multiple matching of parameterized patterns [ J ] .Theoretical Computer Science, 1996, 154(2) : 203 -224.
  • 6FAN J-J. Design of efficient algorithms for two-dimensional pattern matching[ J]. IEEE Transactions on Knowledge and Data Engineering, 1995,7(2):318-327.

共引文献1

同被引文献12

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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