Approximate Pattern Matching Problem

Approximate Pattern Matching Problem

Find all approximate occurrences of a pattern in a string.

Given: Two strings Pattern and Text along with an integer d.

Return: All positions where Pattern appears in Text with at most d mismatches.