BIF401 Assignment 01 Fall 2020 Solution / Discussion Due Date: 30-11-2020
BIF401 Bioinformatics I Assignment 1 Solution & Discussion Fall 2020
Department of Bioinformatics & Computational Biology
Bioinformatics - I (BIF401)
Assignment No. 1 FALL2020
Topic: Smith-Waterman Algorithm Total Marks: 5
Due Date: 11:59 PM, 30th November 2020
Perform the Smith-Waterman Algorithm on the following sequences to find the best local alignment between two sequences (Strings)?
Sequence 1: ATGCATCCCATGAC
Sequence 2: TCTATATCCGT
-5 as a gap penalty, -5 as a mismatch penalty and 5 as the score for a match.
- To succeed in this assignment, you must be familiar with Smith-Waterman Algorithm
- Perform assignment on page by hand, (Like Hardcopy of Assignment), Use only A4 size Page.
- After that, take picture by using any Camera Device, but be sure picture should be clear and must include your name and Registration # on top of page.
- Put the picture in word file by using insert option and submit.