Upcoming SlideShare
×

Bioalgo 2013-07-alignment-2

74

Published on

0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total Views
74
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
0
0
Likes
0
Embeds 0
No embeds

No notes for slide

Bioalgo 2013-07-alignment-2

1. 1. Alignments II
2. 2. Dynamic programming table
3. 3. Maximum sum subarray problem Given array of numbers [a_1, a_2, ... a_n] find continuous sub array with maximum sum.
4. 4. Local alignment Find most common regions of two sequences
5. 5. Formal problem Find two substrings with maximal score Score[0, i] = -gap_penalty * i Score[j, 0] = -gap_penalty * j Score[i, j] = max( Score[i-1, j] - gap_penalty, Score[i, j-1] - gap_penalty, Score[i, j] + match_score)
6. 6. Smith-Waterman Score[0, i] = 0 Score[j, 0] = 0 Score[i, j] = max( 0, Score[i-1, j] - gap_penalty, Score[i, j-1] - gap_penalty, Score[i, j] + match_score)
7. 7. FItting alignment Align the whole pattern(TAGATA) against substring of the text(GTAGGCTTAAGGTTA)
8. 8. Affine gap penalty total_penalty = gap_open + gap_extend * (length-1) - -- --- ---- 10 11 12 13
1. A particular slide catching your eye?

Clipping is a handy way to collect important slides you want to go back to later.