Find the most frequent k-mers (with mismatches and reverse complements) in a string.
Input: A DNA string Text as well as integers k and d.
Output: All k-mers Pattern maximizing the sum Countd(Text, Pattern)+ Countd(Text, Patternrc) over all possible k-mers.
Find the most frequent k-mers (with mismatches and reverse complements) in a string.
Input: A DNA string Text as well as integers k and d. Output: All k-mers Pattern maximizing the sum Countd(Text, Pattern)+ Countd(Text, Patternrc) over all possible k-mers.