Compute the max similarity matrix and an alignment using Needleman by hcj

VIEWS: 5 PAGES: 1

									CS 20120, Introduction to Bioinformatics Assignment 2, Feb 12th 2007. Due by Feb 19th 2007, at midnight Kiribati time. 10% of the final mark. 2% penalty for each day late.

Using the grid below, compute the max similarity matrix and optimal upmost alignment using the Needleman-Wunsch algorithm (global comparison) for the following two sequences: CTGACTGAT GCTGTACGAAT Scores: match=1; mismatch=-1; gap=-3;

-

Alignment:

Your name: Student number:


								
To top