Question 12
Consider the alignment graph based DP table below to find the best global alignment between two strings (represented along the rows and the columns). The DP table has (n + 1) x (m + 1) entries i.e., DP [0, 0] to DP [n,m], where n is length of first string and m is length of second string. DP [i, j] is the score of best global alignment between the length-i prefix of the first string and length-j prefix of the second string.
Fill the DP table given below and answer the given subquestions accordingly. Scoring is done as follows:
• For each match between two symbols: +1 point
• For each mismatch between two symbols: 0 point
• For each removal of symbol from any one sequence: 0 point
In the global alignment, what happens to the last character of the first string? Assume the first string (top string in the alignment) is along the rows i.e., GACAT.
The last character is matched to the corresponding character in the second string.
The last character is involved in a mismatch operation.
The last character is inserted.
The last character is deleted.