Description
In this assignment, you are going to implement dynamic pairwise sequence alignment algorithm. You will use your program to align DNA sequences. DNA sequences will be read from your input file. You will use gap and mismatch penalties, match scores while performing alignment. Your program will find the optimum alignment between the given sequences using the following scores.
Default values for scores are as follows:
- match score: +2
- mismatch score: -1
- affine gap penalty: gap opening penalty: -1, gap extension penalty: -0.5
You will be given 5 test sequences and find the optimum alignment for these sequences. Your program will give the optimum alignment and its score as an output.
You will write a report including the alignments for the 5 test sequences with their scores. (You can put screenshots from your program outputs) Your report will also contain the detailed information about your implementation.
