multiple alignment modified from tolga can’s lecture notes (metu)
TRANSCRIPT
![Page 1: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/1.jpg)
Multiple Alignment
Modified from Tolga Can’s lecture notes (METU)
![Page 2: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/2.jpg)
Outline• Problem definition• Can we use Dynamic Programming to solve
MSA?• Progressive Alignment• ClustalW• Scoring Multiple Alignments
• Entropy• Sum of Pairs (SP) Score
![Page 3: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/3.jpg)
Multiple Alignment versus Pairwise Alignment
• Up until now we have only tried to align two sequences.
![Page 4: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/4.jpg)
Multiple Alignment versus Pairwise Alignment
• Up until now we have only tried to align two sequences.
• What about more than two? And what for?
![Page 5: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/5.jpg)
Multiple Alignment versus Pairwise Alignment
• Up until now we have only tried to align two sequences.
• What about more than two? And what for?
• A faint similarity between two sequences becomes significant if present in many
• Multiple alignments can reveal subtle similarities that pairwise alignments do not reveal
![Page 6: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/6.jpg)
Multiple alignment• One of the most essential tools in molecular
biology • Finding highly conserved subregions or embedded
patterns of a set of biological sequences• Conserved regions usually are key functional regions, prime
targets for drug developments• Estimation of evolutionary distance between sequences• Prediction of protein secondary/tertiary structure
• Practically useful methods only since 1987 (D. Sankoff) • Before 1987 they were constructed by hand • Dynamic programming is expensive
![Page 7: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/7.jpg)
Multiple Sequence Alignment (MSA)• What is multiple sequence alignment?• Given k sequences:
VTISCTGSSSNIGAGNHVKWYQQLPGVTISCTGTSSNIGSITVNWYQQLPGLRLSCSSSGFIFSSYAMYWVRQAPGLSLTCTVSGTSFDDYYSTWVRQPPGPEVTCVVVDVSHEDPQVKFNWYVDGATLVCLISDFYPGAVTVAWKADSAALGCLVKDYFPEPVTVSWNSGVSLTCLVKGFYPSDIAVEWESNG
![Page 8: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/8.jpg)
Multiple Sequence Alignment (MSA)• An MSA of these sequences:
VTISCTGSSSNIGAG-NHVKWYQQLPGVTISCTGTSSNIGS--ITVNWYQQLPGLRLSCSSSGFIFSS--YAMYWVRQAPGLSLTCTVSGTSFDD--YYSTWVRQPPGPEVTCVVVDVSHEDPQVKFNWYVDG--ATLVCLISDFYPGA--VTVAWKADS--AALGCLVKDYFPEP--VTVSWNSG---VSLTCLVKGFYPSD--IAVEWESNG--
![Page 9: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/9.jpg)
Multiple Sequence Alignment (MSA)• An MSA of these sequences:
VTISCTGSSSNIGAG-NHVKWYQQLPGVTISCTGTSSNIGS--ITVNWYQQLPGLRLSCSSSGFIFSS--YAMYWVRQAPGLSLTCTVSGTSFDD--YYSTWVRQPPGPEVTCVVVDVSHEDPQVKFNWYVDG--ATLVCLISDFYPGA--VTVAWKADS--AALGCLVKDYFPEP--VTVSWNSG---VSLTCLVKGFYPSD--IAVEWESNG--
Conserved residues
![Page 10: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/10.jpg)
Multiple Sequence Alignment (MSA)• An MSA of these sequences:
VTISCTGSSSNIGAG-NHVKWYQQLPGVTISCTGTSSNIGS--ITVNWYQQLPGLRLSCSSSGFIFSS--YAMYWVRQAPGLSLTCTVSGTSFDD--YYSTWVRQPPGPEVTCVVVDVSHEDPQVKFNWYVDG--ATLVCLISDFYPGA--VTVAWKADS--AALGCLVKDYFPEP--VTVSWNSG---VSLTCLVKGFYPSD--IAVEWESNG--
Conserved regions
![Page 11: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/11.jpg)
Multiple Sequence Alignment (MSA)• An MSA of these sequences:
VTISCTGSSSNIGAG-NHVKWYQQLPGVTISCTGTSSNIGS--ITVNWYQQLPGLRLSCSSSGFIFSS--YAMYWVRQAPGLSLTCTVSGTSFDD--YYSTWVRQPPGPEVTCVVVDVSHEDPQVKFNWYVDG--ATLVCLISDFYPGA--VTVAWKADS--AALGCLVKDYFPEP--VTVSWNSG---VSLTCLVKGFYPSD--IAVEWESNG--
Patterns? Positions 1 and 3 are hydrophobicresidues
![Page 12: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/12.jpg)
Multiple Sequence Alignment (MSA)• An MSA of these sequences:
VTISCTGSSSNIGAG-NHVKWYQQLPGVTISCTGTSSNIGS--ITVNWYQQLPGLRLSCSSSGFIFSS--YAMYWVRQAPGLSLTCTVSGTSFDD--YYSTWVRQPPGPEVTCVVVDVSHEDPQVKFNWYVDG--ATLVCLISDFYPGA--VTVAWKADS--AALGCLVKDYFPEP--VTVSWNSG---VSLTCLVKGFYPSD--IAVEWESNG--
Conserved residues, regions, patterns
![Page 13: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/13.jpg)
MSA Warnings
• MSA algorithms work under the assumption that they are aligning related sequences
• They will align ANYTHING they are given, even if unrelated
• If it just “looks wrong” it probably is
![Page 14: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/14.jpg)
Generalizing the Notion of Pairwise Alignment• Alignment of 2 sequences is represented as a 2-row matrix• In a similar way, we represent alignment of 3
sequences as a 3-row matrix
A T _ G C G _ A _ C G T _ A A T C A C _ A
• Score: more conserved columns, better alignment
![Page 15: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/15.jpg)
Alignments = Paths in k dimensional grids• Align 3 sequences: ATGC, AATC,ATGC
A A T -- C
A -- T G C
-- A T G C
![Page 16: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/16.jpg)
Alignment Paths
0 1 1 2 3 4
A A T -- C
A -- T G C
-- A T G C
x coordinate
![Page 17: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/17.jpg)
Alignment Paths
0 1 1 2 3 4
0 1 2 3 3 4
A A T -- C
A -- T G C
-- A T G C
•
x coordinate
y coordinate
![Page 18: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/18.jpg)
Alignment Paths
0 1 1 2 3 4
0 1 2 3 3 4
A A T -- C
A -- T G C
0 0 1 2 3 4
-- A T G C
• Resulting path in (x,y,z) space:
(0,0,0)(1,1,0)(1,2,1) (2,3,2) (3,3,3) (4,4,4)
x coordinate
y coordinate
z coordinate
![Page 19: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/19.jpg)
Aligning Three Sequences• Same strategy as
aligning two sequences• Use a 3-D matrix, with
each axis representing a sequence to align
• For global alignments, go from source to sink
source
sink
![Page 20: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/20.jpg)
2-D vs 3-D Alignment Grid
V
W
2-D alignment matrix
3-D alignment matrix
![Page 21: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/21.jpg)
2-D cell versus 3-D Alignment Cell
In 3-D, 7 edges in each unit cube
In 2-D, 3 edges in each unit square
![Page 22: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/22.jpg)
Architecture of 3-D Alignment Cell(i-1,j-1,k-1)
(i,j-1,k-1)
(i,j-1,k)
(i-1,j-1,k) (i-1,j,k)
(i,j,k)
(i-1,j,k-1)
(i,j,k-1)
![Page 23: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/23.jpg)
Multiple Alignment: Dynamic Programming
• si,j,k = max
(x, y, z) is an entry in the 3-D scoring matrix
si-1,j-1,k-1 + (vi, wj, uk)
si-1,j-1,k + (vi, wj, _ )
si-1,j,k-1 + (vi, _, uk)
si,j-1,k-1 + (_, wj, uk)
si-1,j,k + (vi, _ , _)
si,j-1,k + (_, wj, _)
si,j,k-1 + (_, _, uk)
cube diagonal: no indels
face diagonal: one indel
edge diagonal: two indels
![Page 24: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/24.jpg)
Multiple Alignment: Running Time
• For 3 sequences of length n, the run time is 7n3; O(n3)
• For k sequences, build a k-dimensional matrix, with run time (2k-1)(nk); O(2knk)
• Conclusion: dynamic programming approach for alignment between two sequences is easily extended to k sequences but it is impractical due to exponential running time
![Page 25: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/25.jpg)
Multiple Alignment Induces Pairwise Alignments
Every multiple alignment induces pairwise alignments
x: AC-GCGG-C y: AC-GC-GAG z: GCCGC-GAG
Induces:
x: ACGCGG-C; x: AC-GCGG-C; y: AC-GCGAGy: ACGC-GAC; z: GCCGC-GAG; z: GCCGCGAG
![Page 26: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/26.jpg)
Reverse Problem: Constructing Multiple Alignment from Pairwise AlignmentsGiven 3 arbitrary pairwise alignments:
x: ACGCTGG-C; x: AC-GCTGG-C; y: AC-GC-GAG
y: ACGC--GAC; z: GCCGCA-GAG; z: GCCGCAGAG
can we construct a multiple alignment that inducesthem?
![Page 27: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/27.jpg)
Reverse Problem: Constructing Multiple Alignment from Pairwise AlignmentsGiven 3 arbitrary pairwise alignments:
x: ACGCTGG-C; x: AC-GCTGG-C; y: AC-GC-GAG
y: ACGC--GAC; z: GCCGCA-GAG; z: GCCGCAGAG
can we construct a multiple alignment that inducesthem? NOT ALWAYS
Pairwise alignments may be inconsistent
![Page 28: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/28.jpg)
Inferring Multiple Alignment from Pairwise Alignments
• From an optimal multiple alignment, we can infer pairwise alignments between all pairs of sequences, but they are not necessarily optimal
• It is difficult to infer a “good” multiple alignment from optimal pairwise alignments between all sequences
![Page 29: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/29.jpg)
Combining Optimal Pairwise Alignments into Multiple Alignment
Can combine pairwise alignments into multiple alignment
Can not combine pairwise alignments into multiple alignment
![Page 30: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/30.jpg)
Multiple alignemnts can improve pairwise alignment results
Catalytic domains of five PI3-kinases and a cAMP-dependent protein kinase
![Page 31: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/31.jpg)
Consensus String of a Multiple Alignment
• The consensus string SM derived from multiple alignment M is the concatenation of the consensus characters for each column of M.
• The consensus character for column i is the character that minimizes the summed distance to it from all the characters in column i. (i.e., if match and mismatch scores are equal for all symbols, the majority symbol is the consensus character)
- A G G C T A T C A C C T G T A G – C T A C C A - - - G C A G – C T A C C A - - - G C A G – C T A T C A C – G G C A G – C T A T C G C – G G
C A G - C T A T C A C - G G ConsensusString: C A G C T A T C A C G G
![Page 32: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/32.jpg)
Profile Representation of Multiple Alignment
- A G G C T A T C A C C T G T A G – C T A C C A - - - G C A G – C T A C C A - - - G C A G – C T A T C A C – G G C A G – C T A T C G C – G G
A 1 1 .8 C .6 1 .4 1 .6 .2 G 1 .2 .2 .4 1T .2 1 .6 .2 - .2 .8 .4 .8 .4
![Page 33: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/33.jpg)
Profile Representation of Multiple Alignment
Earlier, we were aligning a sequence against a sequence
Can we align a sequence against a profile?
Can we align a profile against a profile?
- A G G C T A T C A C C T G T A G – C T A C C A - - - G C A G – C T A C C A - - - G C A G – C T A T C A C – G G C A G – C T A T C G C – G G
A 1 1 .8 C .6 1 .4 1 .6 .2G 1 .2 .2 .4 1T .2 1 .6 .2- .2 .8 .4 .8 .4
![Page 34: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/34.jpg)
PSI-BLAST
Position specific iterative BLAST (PSI-BLAST) refers to a feature ofBLAST 2.0 in which a profileprofile (or position specific scoring matrix, PSSM)is constructed (automatically) from a multiple alignment of the highestscoring hits in an initial BLAST search. The PSSM is generated bycalculating position-specific scores for each position in the alignment.Highly conserved positions receive high scores and weakly conservedpositions receive scores near zero. The profile is used to perform asecond (etc.) BLAST search and the results of each "iteration" used torefine the profile. This iterative searching strategy results in increasedsensitivity.
![Page 35: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/35.jpg)
![Page 36: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/36.jpg)
![Page 37: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/37.jpg)
![Page 38: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/38.jpg)
![Page 39: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/39.jpg)
![Page 40: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/40.jpg)
Aligning alignments
• Given two alignments, can we align them?
x GGGCACTGCATy GGTTACGTC-- Alignment 1 z GGGAACTGCAG
w GGACGTACC-- Alignment 2v GGACCT-----
![Page 41: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/41.jpg)
Aligning alignments• Given two alignments, can we align them? • Hint: use alignment of corresponding profiles
x GGGCACTGCATy GGTTACGTC-- Combined Alignment z GGGAACTGCAG
w GGACGTACC-- v GGACCT-----
![Page 42: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/42.jpg)
Multiple Alignment: Greedy Approach• Choose most similar pair of strings and combine into a
profile , thereby reducing alignment of k sequences to an alignment of of k-1 sequences/profiles. Repeat
• This is a heuristic greedy method
u1= ACGTACGTACGT…
u2 = TTAATTAATTAA…
u3 = ACTACTACTACT…
…
uk = CCGGCCGGCCGG
u1= ACg/tTACg/tTACg/cT…
u2 = TTAATTAATTAA…
…
uk = CCGGCCGGCCGG…
k
k-1
![Page 43: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/43.jpg)
Greedy Approach: Example
• Consider these 4 sequences
s1 GATTCAs2 GTCTGAs3 GATATTs4 GTCAGC
![Page 44: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/44.jpg)
Greedy Approach: Example (cont’d)• There are = 6 possible alignments
2
4
s2 GTCTGAs4 GTCAGC (score = 2)
s1 GAT-TCAs2 G-TCTGA (score = 1)
s1 GAT-TCAs3 GATAT-T (score = 1)
s1 GATTCA--s4 G—T-CAGC(score = 0)
s2 G-TCTGAs3 GATAT-T (score = -1)
s3 GAT-ATTs4 G-TCAGC (score = -1)
![Page 45: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/45.jpg)
Greedy Approach: Example (cont’d)
s2 and s4 are closest; combine:
s2 GTCTGAs4 GTCAGC
s2,4 GTCt/aGa/cA (profile)
s1 GATTCAs3 GATATTs2,4 GTCt/aGa/c
new set of 3 sequences:
![Page 46: Multiple Alignment Modified from Tolga Can’s lecture notes (METU)](https://reader031.vdocument.in/reader031/viewer/2022032203/56649de55503460f94adceed/html5/thumbnails/46.jpg)
Progressive Alignment
• Progressive alignment is a variation of greedy algorithm with a somewhat more intelligent strategy for choosing the order of alignments.
• Progressive alignment works well for close sequences, but deteriorates for distant sequences• Gaps in consensus string are permanent• Use profiles to compare sequences