Sequence comparison and alignment are the fundamental processing in the traditional bioinformatical analysis. No matter the backbone algorithm to perform the comparison and alignment, the scoring matrix is of vital importance. So, let's first fix the scoring matrix as below. Based on this scoring matrix, let's do some simple practice. Scoring matrix: 1. Suppose we want to compare two sequences "ACCG" and "CCT". Essentially, we are looking for the alignment with the highest alignment score. Then, we will consider that score as the similarity score between the sequences. The simplest way to find the best alignment is to enumerate all the alignments. During the enumeration, we get the following two alignments. Please calculate the alignment score for each alignment. Which one would not be the best alignment we are looking for? a. ACCG (4 pts) CCT_ ACGT A 2-7-5-7 C-72-7-5 G-5-72-7 T-7-5-72 Gap penalty = -10 b. ACCG (4 pts) _CCT c. Which one would not be the best alignment we are looking for? (2 pts) 2. Let's use dynamic programming to resolve the problem. Please fill the below dynamic programming table. Please preserve the path to get the table (6 pts). What's the best alignment score (similarity) between the two sequences? (2pts) Based on the path, what is the best alignment? (2 pts) C C T A C G