|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
基于字频的单模式匹配算法
, PP. 2079-2082
Keywords: 字符使用频率,模式匹配,字符串
Abstract:
通过模仿人类查找字符串的过程,本文提出了一种新的单模式匹配算法(MBF算法).该算法利用QS算法的思想和已经成功匹配的前、后缀信息对模式进行预处理.在查找阶段,MBF算法利用了字符使用频率和连续跳跃的查找思想.实验表明,MBF算法比同类的其它算法更加高效.
| [1] | M Crochemore,D Perrin.Two-way string-matching[J].J.Assoc.Comput,1991,38(3): 651-675.
|
| [2] | Thierry Lecroq.Experimental results on string matching algorithms[J].Software Practice and Experience,1995,25(7):727-765.
|
| [3] | Daniel M Sunday.A very fast substring search algorithm[J].Commun.ACM,1990,33(8):132-142.
|
| [4] | Ricardo Baeza-Yates,Gaston H Gonnet.A new approach to text searching[J].Commun.ACM,1992,35(10):74-81.
|
| [5] | A Apostolico,R Giancarlo.The Boyer-Moore-Galil string searching strategies revisited[J].SIAM J.Comput,1986,15(1):98-105.
|
| [6] | Knuth D E,Morris J H,Pratt V R.Fast pattern matching in strings[J].SIAM Journal on Computing,1977,6(1):323-350.
|
| [7] | Richard Cole.Tight bounds on the complexity of the Boyer-Moore string matching algorithm[J].SIAM J.Comput,1994,23(5):1075-1091.
|
| [8] | R S Boyer,J S Moore.A fast string searching algorithm[J].Commun.ACM,1977,20(10):762-772.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
