Automata, Languages and Programming

Volume 372 of the series Lecture Notes in Computer Science pp 394-404


An improved algorithm for approximate string matching

  • Zvi GalilAffiliated withDepartment of Computer Science, Columbia UniversityDepartment of Computer Science, Tel-Aviv University
  • , Kunsoo ParkAffiliated withDepartment of Computer Science, Columbia University

* Final gross prices may vary according to local VAT.

Get Access


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 the known algorithms.