求字符串编辑距离 动态规划 设给定样本 ，样本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