论文信息 - An Improved Algorithm for Approximate String Matching

An Improved Algorithm for Approximate String Matching

Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve upon the known algorithms.

Zvi Galil | Kunsoo Park | Z. Galil | Kunsoo Park

[1] Gad M. Landau,et al. Fast Parallel and Serial Approximate String Matching , 1989, J. Algorithms.

[2] Esko Ukkonen,et al. Algorithms for Approximate String Matching , 1985, Inf. Control..

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

[4] Michael G. Main,et al. An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.

[5] Uzi Vishkin,et al. Fast String Matching with k Differences , 1988, J. Comput. Syst. Sci..

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

[7] Robert A. Wagner,et al. An Extension of the String-to-String Correction Problem , 1975, JACM.

[8] Raffaele Giancarlo,et al. Data structures and algorithms for approximate string matching , 1988, J. Complex..

[9] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.