423f11-lec5-msa

423f11-lec5-msa - Multiple Sequence Alignment CMSC 423 Carl...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
Multiple Sequence Alignment CMSC 423 Carl Kingsford
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
3rd source fle here
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Multiple Sequence Alignment (MSA) Multiple sequence alignment: fnd more subtle patterns & fnd common patterns between all sequence.
Background image of page 4
Generalizing Alignment to > 2 Strings Input: Sequences S 1 , S 2 , . .., S p Let cost ( x 1 , x 2 ,... x p ) be a user-supplied function that computes the quality of a column: an alignment between characters x 1 , x 2 .. x p . Goal : Fnd alignment M to minimize cost of the columns: cost ( x 1 , x 2 ,... x p ) = cost( )
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Slow Dynamic Programming Suppose you had just 3 sequences. Apply the same DP idea as sequence alignment for 2 sequences, but now with a 3-dimensional matrix (i, j, k) (i, j-1, k) (i-1, j, k) (i-1, j-1, k) (i-1, j-1, k-1) (i, j-1, k-1) (i-1, j, k-1) (i, j, k-1)
Background image of page 6
DP Recurrence for 3 sequences (i, j, k) (i, j-1, k) (i-1, j, k) (i-1, j-1, k) (i-1, j-1, k-1) (i, j-1, k-1) (i-1, j, k-1) (i, j, k-1) Every possible pattern for the gaps. A [ i, j, k ]=min > > > > > > > > > > < > > > > > > > > > > : cost( x i ,y j ,z k )+ A [ i - 1 ,j - 1 ,k - 1] cost( x i , - , - A [ i - 1 ,j,k ] cost( x i j , - A [ i - 1 - 1 ] cost( - j k A [ i, j - 1 - 1] cost( - j , - A [ i, j - 1 ] cost( x i , - k A [ i - 1 - 1] cost( - , - k A [ i, j, k - 1]
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Running time n 3 subproblems, each takes 2 3 time O( n 3 ) time. For p sequences: n p subproblems, each takes 2 p time for the max and p 2 to compute cost() O( p 2 n p 2 p ) Even O( n 3 ) is often too slow for the length of sequences encountered in practice. One solution: approximation algorithm.
Background image of page 8
SP-Score SP-Score(M) = i<j d M (S i , S j ) S i S j d M (S i j ) = sum of all the scores of the pairwise alignments implied by M. A particular cost() function, the SP-Score, is commonly used and allows us to design an approximation algorithm for the MSA problem. d M (S i j ) = the cost of the alignment between S i and S j as implied by MSA M.
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
MSA A multiple sequence alignment (MSA) implies a pairwise alignment between every pair of sequences.
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/13/2012 for the course CMSC 423 taught by Professor Staff during the Fall '07 term at Maryland.

Page1 / 23

423f11-lec5-msa - Multiple Sequence Alignment CMSC 423 Carl...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online