Computer Science

Total points : 15

Write a python program to the most frequent K-mer in a given search text. The user enters k.

You may mplement the program using a two dimensional array to store every k-mer and the count of each respective k-mer. e.g.

K = 4

dna = "ttaaggacccccaaggc"

ttaa 1

taag 1

aagg 2

agga 1

ggac 1

gacc 1

accc 1

cccc 2

ccca 1

ccaa 1

caag 1

aggc 1

Longest 4-mers are ggac and cccc

Bonus: Also, enter a search substring (kmer) and find if the kmer exists, where the kmer may differ at at most 1 position.