一种改进的字符串匹配模型研究  

Research on an Improved Model of String Matching

作　　者：焦文欢 冯兴杰 JIAO Wen-huan;FENG Xing-jie(Information Network Center,Civil Aviation University of China,Tianjin,300300)

机构地区：[1]中国民航大学信息网络中心,天津300300

出　　处：《计算机仿真》2022年第3期319-324,共6页Computer Simulation

基　　金：国家自然科学基金项目(U1233113);中央高校基金项目(3122019190);中国民航大学实验技术创新基金项目(2018CXJJ29)。

摘　　要：字符串匹配技术作为数据分析的基础和核心,已经被广泛应用于各个领域。通过分析字符串匹配算法的局限性和矛盾性,设计提出一种改进的字符串匹配模型。模型充分利用Tuned BM算法和Zhu-Takaoka算法正特征的显著优势,克服其性能缺点,保证字符串匹配过程中模式串每次都能移动最大安全距离,实现减少字符比较次数和增大模式串移动距离的目的。实验结果表明,与其它字符串匹配算法相比,改进模型在不同数据集的长模式串和短模式串应用中都能表现出良好的匹配效果,模型稳定性较高。As the basis and core part of data analysis,string matching technology has been widely used in various fields.By analyzing the limitations and contradictions of the string matching algorithms,an improved model of string matching is designed.The model makes full use of the significant advantages of the Tuned BM algorithm and the Zhu-Takaoka algorithm,overcomes its performance shortcomings,and ensures that the pattern string can move the maximum safe distance every time during string matching,and achieves the purpose of reducing the number of character comparisons and increases the moving distance of the pattern string.The experimental results show that,compared with other string matching algorithms,the improved model has a better matching effect in the application of long and short pattern strings in different datasets,and the model has high stability.

关 键 词：数据分析 字符串匹配 模式串 改进模型 字符串移动 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]