|
|||||
|
|
| 最佳比较序字符串匹配算法研究和应用 | |
| 引用本文： | 程伟,刘玉军,卢泽新. 最佳比较序字符串匹配算法研究和应用[J]. 计算机工程与设计, 2004, 25(9): 1430-1432 |
| 作者姓名： | 程伟 刘玉军 卢泽新 |
| 作者单位： | 国防科技大学,计算机学院,湖南,长沙,410073;国防科技大学,计算机学院,湖南,长沙,410073;国防科技大学,计算机学院,湖南,长沙,410073 |
| 基金项目： | 国家863高技术计划基金(2001AA112120) |
| 摘 要： | 为了使在数据量很大的环境下的字符匹配工作获得较高的效率，该算法利用概率加权的方法，计算出拥有最大平均跳步的目标串的比较序列，并利用该序列进行字符串的匹配工作。对该算法的效率进行了研究，并将其与利用逐字节比较技术的字符串匹配算法做了比较，找出了本算法的适用环境。 |
| 关 键 词： | 串匹配 位比较 概率加权 环境变量 |
| 文章编号： | 1000-7024(2004)09-1430-03 |
Best reordered string-matching algorithms |
|
| CHENG Wei,LIU Yu-jun,LU Ze-xin College of Computer,National University of Defence Technology,Changsha ,China. Best reordered string-matching algorithms[J]. Computer Engineering and Design, 2004, 25(9): 1430-1432 | |
| Authors: | CHENG Wei LIU Yu-jun LU Ze-xin College of Computer National University of Defence Technology Changsha China |
| Affiliation: | CHENG Wei,LIU Yu-jun,LU Ze-xin College of Computer,National University of Defence Technology,Changsha 410073,China |
| Abstract: | In order to acquire high efficiency of the string-matching in an environment with large amount of date, the algorithm worksout a compare-sequence, which the string-matching has the longest average jump, by using the power coming from probability,andthen compares the words in this sequence. Finally, the performance of the algorithm is studied, and the applied area of the algorithmis found by comparing with the brute force algorithm. |
| Keywords: | string-matching bit compare power of probability environment variable |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |