Download presentation

Presentation is loading. Please wait.

Published byKaitlin Crafton Modified about 1 year ago

1
Dynamic Programming: Sequence alignment CS 466 Saurabh Sinha

2
DNA Sequence Comparison: First Success Story Finding sequence similarities with genes of known function is a common approach to infer a newly sequenced gene’s function In 1984 Russell Doolittle and colleagues found similarities between cancer-causing gene and normal growth factor (PDGF) gene A normal growth gene switched on at the wrong time causes cancer !

3
Cystic Fibrosis Cystic fibrosis (CF) is a chronic and frequently fatal genetic disease of the body's mucus glands. CF primarily affects the respiratory systems in children. Search for the CF gene was narrowed to ~1 Mbp, and the region was sequenced. Scanned a database for matches to known genes. A segment in this region matched the gene for some ATP binding protein(s). These proteins are part of the ion transport channel, and CF involves sweat secretions with abnormal sodium content!

4
Role for Bioinformatics Gene similarities between two genes with known and unknown function alert biologists to some possibilities Computing a similarity score between two genes tells how likely it is that they have similar functions Dynamic programming is a technique for revealing similarities between genes

5
Motivating Dynamic Programming

6
Dynamic programming example: Manhattan Tourist Problem Imagine seeking a path (from source to sink) to travel (only eastward and southward) with the most number of attractions (*) in the Manhattan grid Sink * * * * * * * ** * * Source *

7
Imagine seeking a path (from source to sink) to travel (only eastward and southward) with the most number of attractions (*) in the Manhattan grid Sink * * * * * * * ** * * Source * Dynamic programming example: Manhattan Tourist Problem

8
Manhattan Tourist Problem: Formulation Goal: Find a “most weighted” path in a weighted grid. Input: A weighted grid G with two distinct vertices, one labeled “source” and the other labeled “sink” Output: A “most weighted” path in G from “source” to “sink”

9
MTP: An Example 324 073 33 0 132 4 4 5 6 4 6 5 5 8 2 2 5 0123 0 1 2 3 j coordinate i coordinate 13 source sink 4 3240 10 2 43 3 1 1 2 2 2 4 19 95 15 23 0 20 3 4

10
MTP: Greedy Algorithm Is Not Optimal 125 2 1 5 23 4 000 5 3 0 3 5 0 10 3 5 5 1 2 promising start, but leads to bad choices! source sink 18 22

11
MTP: Simple Recursive Program MT(n,m) if n=0 or m=0 return MT(n,m) x MT(n-1,m)+ length of the edge from (n- 1,m) to (n,m) y MT(n,m-1)+ length of the edge from (n,m-1) to (n,m) return max{x,y} What’s wrong with this approach?

12
Here’s what’s wrong M(n,m) needs M(n, m-1) and M(n-1, m) Both of these need M(n-1, m-1) So M(n-1, m-1) will be computed at least twice Dynamic programming: the same idea as this recursive algorithm, but keep all intermediate results in a table and reuse

13
1 5 01 0 1 i source 1 5 S 1,0 = 5 S 0,1 = 1 Calculate optimal path score for each vertex in the graph Each vertex’s score is the maximum of the prior vertices score plus the weight of the respective edge in between MTP: Dynamic Programming j

14
MTP: Dynamic Programming (cont ’ d) 12 5 3 012 0 1 2 source 13 5 8 4 S 2,0 = 8 i S 1,1 = 4 S 0,2 = 3 3 -5 j

15
MTP: Dynamic Programming (cont ’ d) 12 5 3 0123 0 1 2 3 i source 13 5 8 8 4 0 5 8 103 5 -5 9 13 1-5 S 3,0 = 8 S 2,1 = 9 S 1,2 = 13 S 3,0 = 8 j

16
MTP: Dynamic Programming (cont ’ d) greedy alg. fails! 125 -51 3 0 5 3 0 3 5 0 10 -3 -5 0123 0 1 2 3 i source 138 5 8 8 4 9 138 9 12 S 3,1 = 9 S 2,2 = 12 S 1,3 = 8 j

17
MTP: Dynamic Programming (cont ’ d) 125 -51 33 00 5 3 0 3 5 0 10 -3 -5 2 0123 0 1 2 3 i source 138 5 8 8 4 9 138 12 9 15 9 j S 3,2 = 9 S 2,3 = 15

18
MTP: Dynamic Programming (cont ’ d) 125 -51 33 00 5 3 0 3 5 0 10 -3 -5 2 0123 0 1 2 3 i source 138 5 8 8 4 9 138 12 9 15 9 j 0 1 16 S 3,3 = 16 (showing all back-traces) Done!

19
MTP: Recurrence Computing the score for a point (i,j) by the recurrence relation: s i, j = max s i-1, j + weight of the edge between (i-1, j) and (i, j) s i, j-1 + weight of the edge between (i, j-1) and (i, j) The running time is n x m for a n by m grid (n = # of rows, m = # of columns)

20
Traveling in the Grid By the time the vertex x is analyzed, the values s y for all its predecessors y should be computed – otherwise we are in trouble. We need to traverse the vertices in some order For a grid, can traverse vertices row by row, column by column, or diagonal by diagonal

21
Traversing the Manhattan Grid 3 different strategies: –a) Column by column –b) Row by row –c) Along diagonals a)b) c)

22
Alignment

23
Aligning DNA Sequences V = ATCTGATG W = TGCATAC n = 8 m = 7 ATCTGATG TGCATAC V W match insertion deletion mismatch indels 4 1 2 2 matches mismatches deletions insertions Alignment : 2 x k matrix ( k m, n )

24
Longest Common Subsequence (LCS) – Alignment without Mismatches Given two sequences v = v 1 v 2 …v m and w = w 1 w 2 …w n The LCS of v and w is a sequence of positions in v : 1 < i 1 < i 2 < … < i t < m and a sequence of positions in w : 1 < j 1 < j 2 < … < j t < n such that i t -th letter of v equals to j t -letter of w and t is maximal

25
LCS: Example AT -- CTGATC TGCT A C elements of v elements of w -- A 1 2 0 1 2 2 3 3 4 3 5 4 5 5 6 6 6 7 7 8 j coords: i coords: Matches shown in red positions in v: positions in w: 2 < 3 < 4 < 6 < 8 1 < 3 < 5 < 6 < 7 Every common subsequence is a path in 2-D grid 0 0 (0,0) (1,0) (2,1) (2,2) (3,3) (3,4) (4,5) (5,5) (6,6) (7,6) (8,7)

26
Computing LCS Let v i = prefix of v of length i: v 1 … v i and w j = prefix of w of length j: w 1 … w j The length of LCS(v i,w j ) is computed by: s i, j = max s i-1, j s i, j-1 s i-1, j-1 + 1 if v i = w j

27
LCS Problem as Manhattan Tourist Problem T G C A T A C 1 2 3 4 5 6 7 0i ATCTGATC 012345678 j

28
Edit Graph for LCS Problem T G C A T A C 1 2 3 4 5 6 7 0i ATCTGATC 012345678 j

29
T G C A T A C 1 2 3 4 5 6 7 0i ATCTGATC 012345678 j Every path is a common subsequence. Every diagonal edge adds an extra element to common subsequence LCS Problem: Find a path with maximum number of diagonal edges

30
Backtracking s i,j allows us to compute the length of LCS for v i and w j s m,n gives us the length of the LCS for v and w How do we print the actual LCS ? At each step, we chose an optimal decision s i,j = max (…) Record which of the choices was made in order to obtain this max

31
Computing LCS Let v i = prefix of v of length i: v 1 … v i and w j = prefix of w of length j: w 1 … w j The length of LCS(v i,w j ) is computed by: s i, j = max s i-1, j s i, j-1 s i-1, j-1 + 1 if v i = w j

32
Printing LCS: Backtracking 1.PrintLCS(b,v,i,j) 2. if i = 0 or j = 0 3. return 4. if b i,j = “ “ 5. PrintLCS(b,v,i-1,j-1) 6. print v i 7. else 8. if b i,j = “ “ 9. PrintLCS(b,v,i-1,j) 10. else 11. PrintLCS(b,v,i,j-1)

33
From LCS to Alignment The Longest Common Subsequence problem— the simplest form of sequence alignment – allows only insertions and deletions (no mismatches). In the LCS Problem, we scored 1 for matches and 0 for indels Consider penalizing indels and mismatches with negative scores Simplest scoring scheme: +1 : match premium -μ : mismatch penalty -σ : indel penalty

34
Simple Scoring When mismatches are penalized by –μ, indels are penalized by –σ, and matches are rewarded with +1, the resulting score is: #matches – μ(#mismatches) – σ (#indels)

35
The Global Alignment Problem Find the best alignment between two strings under a given scoring schema Input : Strings v and w and a scoring schema Output : Alignment of maximum score → = - σ = 1 if match = -µ if mismatch s i-1,j-1 +1 if v i = w j s i,j = max s i-1,j-1 -µ if v i ≠ w j s i-1,j - σ s i,j-1 - σ : mismatch penalty σ : indel penalty

36
Scoring Matrices To generalize scoring, consider a (4+1) x(4+1) scoring matrix δ. In the case of an amino acid sequence alignment, the scoring matrix would be a (20+1)x(20+1) size. The addition of 1 is to include the score for comparison of a gap character “-”. This will simplify the algorithm as follows: s i-1,j-1 + δ (v i, w j ) s i,j = max s i-1,j + δ (v i, -) s i,j-1 + δ (-, w j )

37
Making a Scoring Matrix Scoring matrices are created based on biological evidence. Alignments can be thought of as two sequences that differ due to mutations. Some of these mutations have little effect on the function of the sequence, therefore some penalties, δ(v i, w j ), will be less harsh than others.

38
Scoring Matrix: Example for protein sequences ARNK A5-2 R-7 3 N--70 K---6 Notice that although R and K are different amino acids, they have a positive score. Why? They are both positively charged amino acids will not greatly change function of protein.

39
Conservation Amino acid changes that tend to preserve the physico-chemical properties of the original residue –Polar to polar aspartate glutamate –Nonpolar to nonpolar alanine valine –Similarly behaving residues leucine to isoleucine

40
Local vs. Global Alignment The Global Alignment Problem tries to find the longest path between vertices (0,0) and (n,m) in the edit graph. The Local Alignment Problem tries to find the longest path among paths between arbitrary vertices (i,j) and (i’, j’) in the edit graph. In the edit graph with negatively-scored edges, Local Alignment may score higher than Global Alignment

41
Local Alignment: Example Global alignment Local alignment Compute a “mini” Global Alignment to get Local Alignment

42
Local Alignments: Why? Two genes in different species may be similar over short conserved regions and dissimilar over remaining regions. Example: –Homeobox genes have a short region called the homeodomain that is highly conserved between species. –A global alignment would not find the homeodomain because it would try to align the ENTIRE sequence

43
The Local Alignment Problem Goal: Find the best local alignment between two strings Input : Strings v, w and scoring matrix δ Output : Alignment of substrings of v and w whose alignment score is maximum among all possible alignment of all possible substrings

44
The Problem Is … Long run time O(n 4 ): - In the grid of size n x n there are ~n 2 vertices (i,j) that may serve as a source. - For each such vertex computing alignments from (i,j) to (i’,j’) takes O(n 2 ) time. This can be remedied by allowing every point to be the starting point

45
The Local Alignment Recurrence The largest value of s i,j over the whole edit graph is the score of the best local alignment. The recurrence: 0 s i,j = max s i-1,j-1 + δ (v i, w j ) s i-1,j + δ (v i, -) s i,j-1 + δ (-, w j ) Notice there is only this change from the original recurrence of a Global Alignment

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google