Approximate String Matching Problem

• Input: Two strings S and T in an alphabet S and a scoring function s.

• Output: Two strings S’ and T’ in the alphabet S’ = S union {-} with the properties:

  • S = S’ with the -’s removed.
  • T = T’ with the -’s removed.
  • |S’| = |T’|
  • The score is maximized.

Previous slide

Back to first slide

View graphic version