In: Biology
BIOINFORMATICS (Python)
In the following you are required to present on paper your solution to alignment problems. Please use the Needleman-Wunsch algorithm to find the best global pairwise alignment and use the Smith-Waterman algorithm to find the best local pairwise alignment. For each (global or local) alignment you must: - Construct the dynamic programming matrix F(i,j) keeping track of the pointers Ptr(j,i). - Determine the score of the best pairwise alignment. - Present the best alignment. If there are more than one, present all the best.
PROBLEM 1
Consider the following two nucleotide sequences
Sequence 1: A A C G T T A C
Sequence 2: C G A T A A C
and the following scoring model:
Match = +1
Mismatch = -1
Gap = -1
PROBLEM 2
Consider the following two nucleotide sequences
Sequence 1: A C G C G T
Sequence 2: C G T A A
and the following scoring model:
Match = +5
Mismatch = -3
Gap = -4