Skip to main content
Article thumbnail
Location of Repository

A Comparison of Approximate String Matching Algorithms

By Petteri Jokinen, Jorma Tarhio and Esko Ukkonen


Experimental comparison of the running time of approximate string matching algorithms for the�differences problem is presented. Given a pattern string, a text string, and integer�, the task is to find all approximate occurrences of the pattern in the text with at most�differences (insertions, deletions, changes). We consider seven algorithms based on different approaches including dynamic programming, Boyer-Moore string matching, suffix automata, and the distribution of characters. It turns out that none of the algorithms is the best for all values of the problem parameters, and the speed differences between the methods can be considerable. 2��� KEY WORDS String matching Edit distance k differences proble

Year: 1991
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.