Example: Approximate String Matching

• P -- a pattern string

• T -- a text string

• Edit distance between P and T is smallest number of changes to transform T into P, where changes are:

  • Substitution ....kat.... ----> ....cat....
  • Insertion ....ct.... ----> ....cat....
  • Deletion ....caat.... ----> ....cat....

Previous slide

Next slide

Back to first slide

View graphic version