论文信息 - Fast String Matching with Mismatches

Fast String Matching with Mismatches

Abstract We describe and analyze three simple and fast algorithms on the average for solving the problem of string matching with a bounded number of mismatches. These are the naive algorithm, an algorithm based on the Boyer-Moore approach, and ad hoc deterministic finite automata searching. We include simulation results that compare these algorithms to previous works.

Gaston H. Gonnet | Ricardo A. Baeza-Yates

[1] Karl R. Abrahamson. Generalized String Matching , 1987, SIAM J. Comput..

[2] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.

[3] G. H. Gonnet,et al. Handbook of algorithms and data structures: in Pascal and C (2nd ed.) , 1991 .

[4] Gaston H. Gonnet,et al. A new approach to text searching , 1989, SIGIR '89.

[5] G. de V. Smit,et al. A Comparison of Three String Matching Algorithms , 1982, Softw. Pract. Exp..

[6] Esko Ukkonen,et al. Boyer-Moore Approach to Approximate String Matching (Extended Abstract) , 1990, SWAT.

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

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

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

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

[11] Fabrizio Luccio,et al. Simple and Efficient String Matching with k Mismatches , 1989, Inf. Process. Lett..

[12] Ricardo A. Baeza-Yates,et al. String Searching Algorithms Revisited , 1989, WADS.