1 Sequence alignment [w] Consider the strings APPLE and PAPE over the alphabet E = {A,E,L,P}...

Transcribed Image Text:

1 Sequence alignment [w] Consider the strings APPLE and PAPE over the alphabet E = {A,E,L,P} and a penalty matrix P: A E L P A 1 E 1 1 L. 2 1 2 Compute the sequence alignment of the two strings when the penalty for a gap 8 = 2. Fill the dynamic programming table below, and explain how the minimum cost sequence alignment is found in it. 4 5 A. E 1 2 A 4 E 3. 3. 2. 2. 2. 3. 3. 1 Sequence alignment [w] Consider the strings APPLE and PAPE over the alphabet E = {A,E,L,P} and a penalty matrix P: A E L P A 1 E 1 1 L. 2 1 2 Compute the sequence alignment of the two strings when the penalty for a gap 8 = 2. Fill the dynamic programming table below, and explain how the minimum cost sequence alignment is found in it. 4 5 A. E 1 2 A 4 E 3. 3. 2. 2. 2. 3. 3.

Answer rating: 100% (QA)

Ans Minimum cost for sequence alignment is 4 as computed using the following dp ... View the full answer