Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

bestMotif: represents the positions of motif in each DNA sequence BestMotif, : r

ID: 3906773 • Letter: B

Question

bestMotif: represents the positions of motif in each DNA sequence BestMotif, : represents the position of motif in ith DNA sequence GREEDYMOTIFSEARCH(DNA, t, n, l) 1 bestMotif (1,1,...,1) First scan the first 2 sequences 3 for s11 ton-1+1 4 for s2 ? 1 to n-1 + 1 if Score(s,2, DNA) > Score(bestMotif, 2, DNA) Best Motif ? 81 Best Motif2 82 7 8 81? Best Motif 9 82- BestMotif2 scan the remaining sequences 10 for i -3 tot for s1 to n - 1+1 if Score(s, i, DNA) > Score(bestMotif, i, DNA) 12 13 14 15 return bestMotif bestMotifi-si sibestMotifi O 9509 O 9216 O 9506 0 9312

Explanation / Answer

The correct answer is last one.

On backtracking

We are taking horizontal sequence as first and vertical as second.

A matches A and C matches C

But at T we are not moving diagonally up.

We are going left.

So every time we go left we introduce a gap in second.

Again both T matches.

So backtrack currently is

1.TTCA

2.T_CA

Again A mathes A (we move bacj diagonally)

Now we encounter a case where we are neither going diagonally up nor going left.

We are going up.

It means we have a mismatch is first.

So we introduce a gap in first.

Simple rules:

Going left :- add gap in second.

Going up:- add gap in first.

We can observe that we are going left twice so 2 gap in second.

And up once so one gap in first.

And we will reach our option that is last one.