论文信息 - A Fast Algorithm for String Matching with Mismatches - 字舞流文

A Fast Algorithm for String Matching with Mismatches

[1] Gad M. Landau,et al. Efficient String Matching with k Mismatches , 2018, Theor. Comput. Sci..

[2] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[3] Z Galil,et al. Improved string matching with k mismatches , 1986, SIGA.

[4] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.

[5] Udi Manber,et al. Fast text searching: allowing errors , 1992, CACM.

[6] R. Nigel Horspool,et al. Practical fast searching in strings , 1980, Softw. Pract. Exp..

[7] Richard M. Karp,et al. Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[8] Zvi Galil,et al. An Improved Algorithm for Approximate String Matching , 1989, SIAM J. Comput..

[9] Gaston H. Gonnet,et al. A new approach to text searching , 1992, CACM.