.. (לתיקייה המכילה) | ||
Another clarification for question 2c | |
DB contains only one strand. You don't know if it is the same strand you received as query sequence or not |
Clarification for question 2c | |
You have a query sequence that was produced from one of the strands of a double-stranded DNA molecule. You do not know which strand the sequence came from. You would like to find an alignment in DB to BOTH strands. |
Clarification for question 2b | |
We would like to find alignments with only matches and indels (insertions and deletions). |
Do we have to include in our answer all the alignments with highest score in the local alignment matrix, even if one is contained in the other? | |
Yes you do. All highest scores in the alignment matrix are possible local alignments, as been taught in the lecture and tutorial. |
In question 2 - do we have any limitations on what we can do in the scoring system, for example more than one run of alignment, different scores for A-A or A-T, results in absolute value etc.? | |
You can do whatever change to the algorithm you like, as long as you get to the right solution. Make sure not to get to complicated... |
What is the difference between 3b and 3d? | |
In question 3b you compare a gene with a genome, and in question 3d you compare a gene with another gene. |