It has very important theoretical value and practical meaning to research and design very fast approximate string matching algorithms.
因此，研究(设计)高效的近似字符串匹配算法具有重要的理论价值和实际意义。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
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.
本文首先对与字符串匹配有关的常用算法、各类相关的硬件匹配结构进行了深入分析，并提出了一种面向硬件实现的多模式字符串精确匹配算法。
It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching.
在分析了后缀树和后缀数组字符串匹配算法的基础上，详细阐述了基于后缀数组的精确串联重复序列识别方法。
With respect to dynamic string matching, classic algorithms are extended to provide the ability of inserting and deleting a keyword.
在动态串匹配方面，本文对经典的串匹配算法进行了扩展，提供动态增删关键词的能力。
With respect to dynamic string matching, classic algorithms are extended to provide the ability of inserting and deleting a keyword.
在动态串匹配方面，本文对经典的串匹配算法进行了扩展，提供动态增删关键词的能力。
应用推荐