Algorithm 1 Global Alignment

The interpretation of the alignment is as follows. Consider the optimal alignment of the first i characters from S and the first j characters from T. In particular, consider the last aligned pair of characters in such an alignment. This last pair must be one of the following  

in which case the remaining alignment exclnding this pair must have grade G(i-1, ) or 

in which case the remaining alignment excluding this pair musthave grade G(t, -1). A traceback procedure is used to obtain all the alignments. 

Demonstrate the dynamic programming method to obtain the global alignment of the two strings with the following sequence distribution  

The grading function used was +2 for a match, -1 for a mismatch, and -1 for an indel. 

---