1/p-Approximate String Matching with Section
分段处理的1／p概率字符串匹配

Most of the existing Approximate String Matching(ASM) algorithms can determine the similarity of strings by computing the minimal number of mismatching characters(edition distance) between them,while the problem that deciding whether at least 1/p of the pattern string falls into the text string with order remains unresolved since these algorithms treat the pattern string and text string equally in computing the full edition distance between them.Based on the dynamic programming string matching algorithm(DP-...