I was able to execute the algorithm correctly. But I'm still trying to get a hold of the result I'm achieving.
This is the algorithm I'm trying to understand -
If anyone can, can anybody give a description on why we are using the first DNA's k-mer, as the initial Motif to get a profile, which is further is used on a different DNA string to get its most probable pattern.
How this helps, How they are dependent?
And why a lower score between those Motifs, help us to identify the BestMotifs?
I have gone through the below question, but the perspective is different, it seems to be the same course. -
Greedy Motif Search Using Probability Matrices
Any clear resources also will be helpful