Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.


BIF401 Assignment 01 Spring 2021 Solution / Discussion

Views: 132

Replies to This Discussion

Share the Assignment Questions & Discuss Here.... 

Stay touched with this discussion, Solution idea will be uploaded as soon as possible in replies here before the due date.

Department of Bioinformatics and Computational Biology BIF401 – Bioinformatics – I

Assignment # 01 (Total Marks: 10)

Spring 2021

Due Date: 11:59 PM, 25th May 2021 Instructions to be followed:

  • Your assignment should be submitted as MS Word/Pdf document
  • There is a Zero-Tolerance policy for plagiarism. Strict action will be taken in this regard.
  • Submit your assignment on your VU LMS Portal within the given time frame. Email assignments will not be

 

Question (10 Marks)

Topic: Needleman-Wunsch Algorithm

Find the best global alignment, and its corresponding score between the sequences,

Sequence a = CAATACCGCA and Sequence b = TTCTAGCGTC. Use a match score of 1, a mismatch score of -1 and a gap penalty of -2. Show your work and complete given Matrix.

 

 

 

T

T

C

T

A

G

C

G

T

C

 

0

 

 

 

 

 

 

 

 

 

 

C

 

 

 

 

 

 

 

 

 

 

 

A

 

 

 

 

 

 

 

 

 

 

 

A

 

 

 

 

 

 

 

 

 

 

 

T

 

 

 

 

 

 

 

 

 

 

 

A

 

 

 

 

 

 

 

 

 

 

 

C

 

 

 

 

 

 

 

 

 

 

 

C

 

 

 

 

 

 

 

 

 

 

 

G

 

 

 

 

 

 

 

 

 

 

 

C

 

 

 

 

 

 

 

 

 

 

 

A

 

 

 

 

 

 

 

 

 

 

 

 

Hints: You can do this assignment on page by hand, capture picture by using any Camera Device. But picture should be clear and must include your Name and Registration # on the top of page. After that, put the picture in MS Word doc by using insert option and submit.

RSS

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

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