搜索资源列表
string
- 字符串匹配BM算法算法源码 字符串匹配BM算法 源码 很好的 有新意-BM algorithm for string matching algorithm source BM string matching algorithms have a good new source
VB_code_parser
- VB源代码解释器,用richtext控件编的，对于学习如何使用rtf控件有很大帮助，包括加亮，起始字符串匹配段落功能-VB source code interpreter used for the richtext control, for learning how to use the rtf control of much help, including a bright start paragraphs string matching function
StringMatch
- 字符串匹配问题中求最小编辑距离的源码，精简实用，是作业的好帮手！-String matching problem in order to minimize the distance of the source editor to streamline the utility is operating a good helper!
String
- 字符串的匹配算法，简单的c++算法源码，一共三个文件，文件s和t中存放字符串-String matching algorithm, a simple c++ algorithm source, a total of three documents, document storage s and t in the string
MatchingString
- C语言的字符串匹配函数，我一直在用，挺不错的-C language string matching function
modified_kmp
- 这是KMP字符串匹配算法的实现代码，其中next数组的求解算法也是该进型的，避免了重复搜索的问题-This is the KMP string matching algorithm code, which the next array algorithm is the progressive, and to avoid the problem of duplicate search
second
- 字符串匹配问题。 输入一个字符串，程序计算出字符串里有没前后重复的部分，并输出重复的内容。-String matching problem. Enter a string, the program calculated before and after the string, there are no duplicate parts and duplicate the contents of the output.
KMP
- 字符串匹配问题：输入主串和子串，通过算法实现字符串的匹配：若字串在主串中出现在输出出现的位置，否则匹配失败-String matching problem: Enter the main series and sub-string, through the string matching algorithm: if the string appeared in the main string appear in the output, or the failure to match
TEMP
- 一个字符串表达式匹配算法。支持字符集表达式[],[^],[a-b]；支持*,?,+。仅依赖C库。C++类封装，使用简便，运行迅速。经过实际运用验证。-Expression of a string matching algorithm. support character sets Expression [],[^],[ ab] and support*,?,+。 Rely on the C library. C++ class packaging, simple to use.
bm_algorithm
- 字符串匹配boyer_moore算法—— 首先输入查找模式，然后输入文本，如果匹配，输出文本匹配，如果不匹配输出文本不匹配。-Boyer_moore string matching algorithm- the first input search mode, and then enter the text, if the match, the output text-matching, if you do not match the output of the text do not ma
stringmatching
- 可以采用正则表达式来实现字符串匹配功能。一种简单的正则表达式是由英文字母（区分大小写）、数字及通配符"*"和"?"任意组合而成的。"?"代表任意一个字符，"*"代表零个或任意多个字符。例如，a*b可以匹配acb,aabb,afdfdb,ab等，但不可以匹配ac,bb,abbc；a?b可以匹配acb，abb，但不可以匹配ab，accb。试编写一个程序，从文件中读入N个字符串，再从键盘上读入任意一个合乎规则的正则表达式，例如："a?bb*d"，输出符合正则表达式的字符串。 查询的字典文件为
Boyer-Moore-Horspool-Sunday
- 使用Boyer-Moore-Horspool-Sunday 算法进行字符串匹配的系列函数-Using the Boyer-Moore-Horspool-Sunday algorithm for string matching a series of functions
cb
- 算法VC++编程用bf，bm，kmp解决串匹配-Algorithm for VC++ programming with bf, bm, kmp solve the string matching
pipei
- 字符串匹配的随机算法，不同于传统的KMP算法-The random string matching algorithm, the KMP algorithm is different from the traditional
1
- 字符串匹配问题，找到s2出现在s1中的哪里。-String matching problem, finding s2 in s1 of where.
Structures-Of-String-Matching-And-Data-Compressio
- Structures Of String Matching And Data Compression - Jesper Larsson
Finding-rotational-symmetries-by-cyclic-string-ma
- Finding rotational symmetries by cyclic string matching
string-matching
- 一些比较常用的字符串匹配算法源码实现，较粗糙-Some of the more commonly used in string matching algorithm source, than the rough
String-matching
- 字符匹配问题为典型的字符数组的应用，体现了c语言面向过程的特性。可在VC6.0下进行正确编译及运行。-The character matching problem is a typical character array, which embodies the characteristic of C language. Can be compiled and run under VC6.0.
Mazharul String Matching By Finite Automata
- Mazharul String Matching By Finite Automata