因此，研究(设计)高效的近似字符串匹配算法具有重要的理论价值和实际意义。
It has very important theoretical value and practical meaning to research and design very fast approximate string matching algorithms.
在动态串匹配方面，本文对经典的串匹配算法进行了扩展，提供动态增删关键词的能力。
With respect to dynamic string matching, classic algorithms are extended to provide the ability of inserting and deleting a keyword.
针对这个问题，本丈首先阐述了几种经典的串匹配算法，对它们的适用范围和优缺点进行了分析。
Considering this problem, the paper expatiates on some classical matching algorithms, and analyses their applying ranges, advantages and disadvantages.
实验显示，这种方法解决了单独用字符串匹配算法造成的误检问题，取得了较好的镜头切变检测效果。
The experiments show that this method can solve the problem of the false detection rate caused by using only string matching method, thereby achieving better results of lens switching detection.
在分析了后缀树和后缀数组字符串匹配算法的基础上，详细阐述了基于后缀数组的精确串联重复序列识别方法。
It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching.
在此基础上，提出了一种基于排除的串匹配算法，该算法能快速而准确地排除负载中不包含匹配模式串的数据包。
On the base of this, an exclusion-based matching algorithm is presented. It can exclude the packets whose load doesn't include intrusion stri…
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
适合GPU的串匹配算法的设计与实现：BF算法是串匹配算法中最基础的算法，但它是串行算法，不适合GPU的体系结构。
BF algorithm is the basic algorithm in string matching field. But it is not paralleled, and does not match the system architecture of the GPU.
最近我写过一篇关于在Python中实现模糊子串匹配的算法的文章。
I recently wrote about an algorithm for fuzzy matching of substrings implemented in Python.
当连接打开时，将根据一种精确的匹配算法来创建连接池，该算法会使连接池与连接中的字符串相关联。
When a connection is opened, a connection pool is created based on an exact matching algorithm that associates the pool with the connection string in the connection.
此外，算法还支持带循环引用路径信息的模式串匹配。
In addition, the algorithm support pattern matching with loop reference path information.
实验结果表明，该算法的确能解决字符串有序跳跃模式匹配问题，完全可以适用于句型匹配与主题词跳词匹配。
Experiments demonstrate that the algorithm can solve such approximate string matching problem, and it can be used in the filed of sentence pattern matching and skip word matching.
提出一种高效海量字符串集合的模式匹配算法。
This paper proposes a fast pattern matching algorithm on mass string assemble.
如何利用模式匹配理论，根据串的最大匹配算法思想实现系统流程中最长地址数据优先拆分。
How to use the patter matching theory based on bunch most matching arithmetic to achieve furthest address data first to split in the system flow.
分析了大字符集的特点和人类查找字符串的过程，提出了一个新的单模式匹配算法。
Based on the analysis of the features of large character set language and the string searching procedure of human, a new algorithm was proposed.
围绕精确串匹配的并行算法展开研究。
在初次打开连接时，将根据完全匹配算法创建连接池，该算法将池与连接中的连接字符串关联。
When a connection is first opened, a connection pool is created based on an exact matching algorithm that associates the pool with the connection string in the connection.
掌握串的匹配算法。
本文依据冗余网页的特点引入模糊匹配的思想，利用网页文本的内容、结构信息，提出了基于特征串的中文网页的快速去重算法，同时对算法进行了优化处理。
The idea of fuzzy matching and information of content and structure of the text of web page are introduced into the algorithm, and the efficiency of the algorithm is optimized.
本文首先对与字符串匹配有关的常用算法、各类相关的硬件匹配结构进行了深入分析，并提出了一种面向硬件实现的多模式字符串精确匹配算法。
In this paper, after studed some common string matching algorithms and many matching related hardware structures, a hardware oriented multi-pattern exact string matching algorithm has been presented.
通过对字符串模式匹配BF和KMP算法的分析，提出了改进KMP扫描算法的方法，并通过对算法的复杂性进行分析，结果表明：改进后的算法KMPA比算法KMP更有效。
KMP scan algorithm is improved by means of the analysis of string pattern matching BF and KMP. The complexity analysis reveals that the improved algorithm, KMPA, is more effective than KMP.
实验结果表明，改进的BM模式匹配算法可以有效地减少字符串的匹配次数和比对次数，能获得良好的字符串匹配效率。
Experimental results show that the improved BM pattern matching algorithm can effectively decrease The Times of string matching and comparing, and get the good string matching efficiency.
实验结果表明，改进的BM模式匹配算法可以有效地减少字符串的匹配次数和比对次数，能获得良好的字符串匹配效率。
Experimental results show that the improved BM pattern matching algorithm can effectively decrease The Times of string matching and comparing, and get the good string matching efficiency.
应用推荐