This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: BCB 567/CprE 548 Fall 2007 Homework 5 Solutions 1. The maximum possible SP score occurs when all sequences are the same. In this case the total score is n k 2 . This is because each column is perfectly matched: AAAA AAAA .... AAAA The worst possible SP score occurs when each string consists of a single unique character from . In this case, the SP score becomes one of two equations. If all sequences are aligning (for a MSA length of n ), the score is: n k 2 ! = nk ( k 1) 2 AAAA BBBB .... KKKK If all sequences are aligned with gaps (total MSA lenght of nk ), the score is: nk ( k 1) = nk ( k 1)2 2 = n k 2 ! 2 AAAA...BBBB... ......KKKK Either of these cases could have lower total score depending on whether or not < 2 . 1 2. Example: XYX, YXY, and YXX. = 1 , = 2 , = 1 In this case, the multiple alignment: XYX YXY YXX is optimal with score of 3. However, obviously the pairwise aligment XYX YXY with a score of 3 is not optimal. XYXYXY with a score of 2 is optimal. 2 3. The first thing we should do is generalize the kband to d dimensions. Recall that we defined the kband to be all cells such that  i j ...
View
Full
Document
This note was uploaded on 10/01/2009 for the course CS BCB/Co taught by Professor Olivereulenstein during the Fall '06 term at Iowa State.
 Fall '06
 OLIVEREULENSTEIN

Click to edit the document details