We have been working very hard since 2009 to facilitate in learning Read More. We can't keep up without your support. Donate.

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More

BIF401 Assignment 01 Fall 2020 Solution / Discussion Due Date: 30-11-2020


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)


Views: 166

Replies to This Discussion

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

Scores Criteria:
-5 as a gap penalty, -5 as a mismatch penalty and 5 as the score for a match.

Directions:
- 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.

BIF401 Assignment#1 solution // Bioinformatics

RSS

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.