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. A 1. 3 E L 2. 1 1 Compute the sequence alignment of the two strings when the penalty for a gap o = 2. Fill the dynamic programming table below, and explain how the minimum cost sequence alignment is found in it. j 1 2 3 4 5 i A P E 1 A. 3 P 4 E 1, 2. 2. 2. 1. 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. A 1. 3 E L 2. 1 1 Compute the sequence alignment of the two strings when the penalty for a gap o = 2. Fill the dynamic programming table below, and explain how the minimum cost sequence alignment is found in it. j 1 2 3 4 5 i A P E 1 A. 3 P 4 E 1, 2. 2. 2. 1. 3.

Answer rating: 100% (QA)

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