开发者

Knuth-Morris-Pratt with Fuzzy String Matching

Does anyone know or have any idea if the KMP algorithm for substring searching can be modified to find not exact mat开发者_开发百科ches but approximate ones?


Have a look at the Bitap algorithm.

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜