Location:
Search - string match
Search list
Description: 一个关于字符串匹配的算法，已经经过编译，希望对你有帮助- About the character string match algorithm, already passed
through the translation, hoped had to you helps
Platform: |
Size: 1358 |
Author: 赵机密 |
Hits:
Description: 在MPI上实现并行串匹配的源代码。- Realizes the parallel string match source code on MPI.
Platform: |
Size: 5120 |
Author: 应伟勤 |
Hits:
Description: 一个关于字符串匹配的算法，已经经过编译，希望对你有帮助- About the character string match algorithm, already passed
through the translation, hoped had to you helps
Platform: |
Size: 1024 |
Author: 赵机密 |
Hits:
Description: 带通配符的字符串匹配算法源代码 vc源代码-the vc source code of string matching with wildcard.
Platform: |
Size: 4096 |
Author: 张云 |
Hits:
Description: 一个简单而有效的字符串近似匹配算法，与大家共享-a simple and effective approximate string matching algorithms, and share
Platform: |
Size: 3072 |
Author: 彭昱 |
Hits:
Description: KMP算法，详细的解释了如何去匹配字符串。做成了实验报告，希望给大家帮助。-KMP algorithm, a detailed explanation of how to match the string. The report resulted in the experiment, we hope to help.
Platform: |
Size: 121856 |
Author: 缪巍巍 |
Hits:
Description: BM 算法是一个较优的模式匹配算法。一般，如果不考虑模式串的长度，一个具有时间复杂度O(n)的算法应该是最优的了，但是事实不是如此。BM算法可以实现更高效率的模式匹配。分析和实验说明，BM匹配算法对于那些字符集比较大，而模式串中出现的字符比较少的时候，工作效率最快。而且，考虑KMP匹配方式的优化，可以结合KMP匹配和BM匹配，进一步提高效率。
-BM algorithm is a better pattern matching algorithm. General, if we do not consider the length of pattern, a time complexity O (n) algorithm should be optimal, but the fact is not the case. BM algorithm can realize more efficient pattern matching. Analysis and experiments, BM-matching algorithm for those relatively large character set, and the mode string of characters appearing in less time, the efficiency of the fastest. Moreover, consider the KMP matching optimization, you can match the combination of KMP and BM match, and further improve efficiency.
Platform: |
Size: 1024 |
Author: Louis |
Hits:
Description: 字符串的kmp匹配算法并行计算的源程序。-KMP string matching algorithm parallel computation of the source.
Platform: |
Size: 4096 |
Author: 成斌 |
Hits:
Description: 求字符串编辑距离 动态规划 设给定样本 ，样本P在文本T中的K-近似匹配（K-approximate match）是指P在T中包含最多K个差异的匹配，求K-For the string edit distance to the set of dynamic programming based sample, the sample P in the text T in the K-approximate match (K-approximate match) refers to P in T contains up to a difference in the match K, and K
Platform: |
Size: 7168 |
Author: 郭涛 |
Hits:
Description: 汇编语言的课程设计，有关字符串匹配的，望参考-Assembly language curriculum design, the string match, hope Reference
Platform: |
Size: 35840 |
Author: 月月 |
Hits:
Description: 本程序用汇编语言实现，完成匹配功能，从字串中查找特定字符串-This procedure using assembly language implementation, the completion of matching features, from a specific search string string
Platform: |
Size: 1024 |
Author: 李坏 |
Hits:
Description: 数据结构串的模式匹配算法Data structures string pattern matching algorithm
-Data structures string pattern matching algorithms Data structures string pattern matching algorithm
Platform: |
Size: 47104 |
Author: ib |
Hits:
Description: 小程序：编写程序实现两个字符串比较。如果相同，则屏幕显示“match”，否则屏幕显示”nomatch”-small routine:input two characters strings,if they are sample ,show"match" on the screen , otherwise show "nomatch" on the screen.
Platform: |
Size: 1024 |
Author: 张双鸣 |
Hits:
Description: 彻底理解字符串查找算法的好书，介绍各种字符串匹配算法的优缺点及适用情况。-the hand-book of the string match agorithum..
Platform: |
Size: 534528 |
Author: mcgrady |
Hits:
Description: 用KMP算法判断正则表达式是否匹配，“？”匹配任意字符，“*”匹配一个或多个任意字符-KMP algorithm to determine whether the regular expression match, " ?" Matches any character, " *" matches one or more arbitrary characters
Platform: |
Size: 1024 |
Author: jingjie |
Hits:
Description: 编写一个使用KMP算法的字符串匹配程序。
使用方法：字符串匹配.exe -f xxx.txt -s xxx
-f 指定要查找的文件
-s 指定要查找的字符串-Writing a string matching algorithm using KMP program. How to use: string matching exe-f xxx.txt-s xxx-f to specify the file you want to find-s to specify the search string
Platform: |
Size: 10240 |
Author: zzh |
Hits:
Description: String.match( regexp ) Source Code for Java Script.
Platform: |
Size: 1024 |
Author: peiqerkong |
Hits:
Description: KMP 快速模式串匹配查找算法。
与一般的字符串匹配算法不同在于，匹配中某个字符不同时，并不是把指针退回原点，而是从第二个匹配点开始匹配。-KMP fast string match algorithm, difference to common match algorithm is not back to original point when fail in matching letters.
Platform: |
Size: 370688 |
Author: HY |
Hits:
Description: KMP string match algorithm slide
Platform: |
Size: 3510272 |
Author: Mazhar
|
Hits:
Description: 万事开头难，这时刚学习LUA的一点心得，我总觉得，这点火苗可以燎原的(str1="women dushi haohaizi 2018/4/13"
print(string.match(str1,"(%a+)%s%s(%a+)")) --nil
print(string.match(str1,"(%a+)%s(%a+)")) --womendushi
print(string.match(str1,"%a+%s%a+")) --women dushi
print(string.match(str1,"%a-%s%a-")))
Platform: |
Size: 24576 |
Author: 天朝的公民 |
Hits: