This work focuses on the problem of string matching that allows errors, also called approximate string matching. The general goal is toperform string matching of a pattern in a text where one or both of them have suffered some kind of (undesirable) corruption. Someexamples are recovering the original signals after their transmission over noisy channels, finding DNA subsequences after possiblemutations, and text searching where there are typing or spelling errors.

Download Complete Tech Note and Example: Windows | Mac