Given a string s and a number n, find the most frequently occurring n-gram in the string, where the n-grams can begin at any point in the string. This comes up in DNA analysis, where the 3-base reading frame for a codon can begin at any point in the sequence.
So for
s = 'AACTGAACG'
and
n = 3
we get the following n-grams (trigrams):
AAC, ACT, CTG, TGA, GAA, AAC, ACG
Since AAC appears twice, then the answer, hifreq, is AAC. There will always be exactly one highest frequency n-gram.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers1377
Suggested Problems
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
2173 Solvers
-
Compute a dot product of two vectors x and y
1057 Solvers
-
Find a subset that divides the vector into equal halves
402 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
699 Solvers
-
find the maximum element of the matrix
597 Solvers
More from this Author96
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
It should be noted that spaces should be ignored or else test suites 3 and 5 fail.