Location:
Search - string match p
Search list
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: 串的模式匹配可以从模式p的p[k]开始与正文t的t[j+i]开始依次比较，（若p[k]==t[j+i]继续比较p[k+1]=？=t[j+i+1]直至出现p[k+l]！=t[j+i+l-1]时，重新寻找新的p[k+l]的那个最大k 然后再比较p[k ]=？=t[j+i+l]直至匹配或遍历结束）。省去了前面的k次比较。当对应p[i]的k有多个，取最大的k。-Pattern matching string from the pattern p, p [k] started with the body of t, t [j+ i] began to turn more, (if p [k] == t [j+ i] continues to compare p [k+1] =? = t [j+ i+1] until the emergence of p [k+ l]! = t [j+ i+ l-1], to re-search for new p [k+ l] in that the largest k ' and then Comparison of p [k' ]=?= t [j+ i+ l] until the end of the match or traversal). Eliminating the need for the previous k comparisons. When the corresponding p [i] k-there are several, take the largest k.
Platform: |
Size: 9216 |
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: lzw解码
编码
1、分析字符串流，从词典中寻找最长匹配串P（P在表中，而P+C不在表中。P为进行编码字符串，C为P后的第一个字符）。
2、输出P对应的词典码字（索引）。
3、将P+C放入词典-lzw decoding coded 1, analysis of a string stream, from the dictionary to find the longest match string P (P in the table, while the P+ C is not in the table. P is encoded as a string, C for the first character after P). 2, the output code word dictionary corresponding P (index). 3, P+ C into the dictionary
Platform: |
Size: 1024 |
Author: xjj |
Hits: