<p>I was able to execute the algorithm correctly. But I'm still trying to get a hold of the result I'm achieving.</p>
<p>This is the algorithm I'm trying to understand -</p>
<p><a href="http://rosalind.info/problems/ba2d/" rel="nofollow noreferrer">http://rosalind.info/problems/ba2d/</a></p>
<p>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.</p>
<p>How this helps, How they are dependent?</p>
<p>And why a lower score between those Motifs, help us to identify the BestMotifs?</p>
<p>I have gone through the below question, but the perspective is different, it seems to be the same course. -</p>
<p><a href="https://bioinformatics.stackexchange.com/questions/2390/greedy-motif-search-using-probability-matrices">Greedy Motif Search Using Probability Matrices</a></p>
<p>Any clear resources also will be helpful</p>

CC BY-SA 4.0
2020-08-13T11:01:29.980Z
Hi and welcome to the site!. Could you please provide a bit more information on the investigaion? It is difficult to understand question.
M__
CC BY-SA 4.0
2020-08-13T11:09:52.553Z
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.
zion
CC BY-SA 4.0
2020-08-13T11:15:08.433Z
Here is the course link - https://stepik.org/lesson/23066/step/6?unit=6799
zion
<phylogenetics><motifs>
Greedy Motif Search [ Reasoning ]
# Greedy Motif Search [ Reasoning ]

(Asked by: username_0 on 2020-08-13)

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 -

<http://rosalind.info/problems/ba2d/>

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](https://bioinformatics.stackexchange.com/questions/2390/greedy-motif-search-using-probability-matrices)

Any clear resources also will be helpful

**Tags:** phylogenetics, motifs
> **Comments:**
> **username_1**: Hi and welcome to the site!. Could you please provide a bit more information on the investigaion? It is difficult to understand question.  
> **username_0**: 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.  
> **username_0**: Here is the course link - https://stepik.org/lesson/23066/step/6?unit=6799  

---

## 0 answers

