Motifenumeration $($Dna$,k,d)$

Patterns $-$ an empty set

for each k$-$mer Pattern in Dna

for each k$-$mer Pattern' differing from Pattern by at most $d$

mismatches

if Pattern' appears in each string from Dna with at most $d$

mismatches

add Pattern' to Patterns

remove duplicates from Patterns

return Patterns

Implanted Motif Problem

Implement MotifEnumeration $($shown above$)$ to find all $(k,d-$motifs in a collection of strings.

Given: Integers $k$ and $d,$ followed by a collection of strings Dna.

Return: All $(k,d)-$motifs in Dna.

Sample Dataset

$31$

ATTTGGC

TGCCTTA

CGGTATC

GAAAATT

Sample Output