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

  • $\begingroup$ Hi and welcome to the site!. Could you please provide a bit more information on the investigaion? It is difficult to understand question. $\endgroup$
    – M__
    Commented Aug 13, 2020 at 11:01
  • $\begingroup$ Thank you.. this is a course I'm taking on Bioinformatics, with no prior knowledge in Biology or Genes. So There is a concept of searching Motif in a DNA Strings using Probability Matrices... And I have added the link of the algorithm being used for it. I assumed it is common in Bioinformatics to study this algorithm. $\endgroup$
    – zion
    Commented Aug 13, 2020 at 11:09
  • $\begingroup$ Here is the course link - stepik.org/lesson/23066/step/6?unit=6799 $\endgroup$
    – zion
    Commented Aug 13, 2020 at 11:15


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.