Bit-parallel string matching under Hamming distance in worst case time

A new approach to text searching

Ricardo Baeza‐Yates, Gastón H. Gonnet · Communications of the ACM · 1992 · 605 citations · Full text

Computing, Computer Science, Algorithms +13

A fast bit-vector algorithm for approximate string matching based on dynamic programming

Gene Myers · Journal of the ACM · 1999 · 449 citations · Full text

Computing, Computer Science, Algorithms +12

STRING-MATCHING AND OTHER PRODUCTS

Manuela Fischer, Mike Paterson · DSpace@MIT (Massachusetts Institute of Technology) · 1974 · 398 citations · Full text

Computing, Computer Science, Algorithms +14

Improved string matching with k mismatches

Zvi Galil, Raffaele Giancarlo · ACM SIGACT News · 1986 · 112 citations · Full text

Computing, Computer Science, Computational Linguistics +6

Faster algorithms for string matching with k mismatches

Amihood Amir, Moshe Lewenstein, Ely Porat · 2000 · 69 citations

Computing, Computer Science, Algorithms +12