Scoring the Alignment of Amino Acid Sequences Constructing PAM and Blosum Matrices.

Slides:



Advertisements
Similar presentations
Proteins: Structure reflects function….. Fig. 5-UN1 Amino group Carboxyl group carbon.
Advertisements

Substitution matrices
Measuring the degree of similarity: PAM and blosum Matrix
DNA sequences alignment measurement
Introduction to Bioinformatics
Heuristic alignment algorithms and cost matrices
Sequence analysis course
Sequence Alignment.
Introduction to Bioinformatics Algorithms Sequence Alignment.
Scoring Matrices June 19, 2008 Learning objectives- Understand how scoring matrices are constructed. Workshop-Use different BLOSUM matrices in the Dotter.
Alignment methods and database searching April 14, 2005 Quiz#1 today Learning objectives- Finish Dotter Program analysis. Understand how to use the program.
It & Health 2009 Summary Thomas Nordahl Petersen.
Scoring Matrices June 22, 2006 Learning objectives- Understand how scoring matrices are constructed. Workshop-Use different BLOSUM matrices in the Dotter.
Introduction to bioinformatics
Sequence similarity.
Similar Sequence Similar Function Charles Yan Spring 2006.
Sequence Alignment III CIS 667 February 10, 2004.
Scoring the Alignment of Amino Acid Sequences Constructing PAM and Blosum Matrices.
Class 3: Estimating Scoring Rules for Sequence Alignment.
Introduction to Bioinformatics Algorithms Sequence Alignment.
1-month Practical Course Genome Analysis Lecture 3: Residue exchange matrices Centre for Integrative Bioinformatics VU (IBIVU) Vrije Universiteit Amsterdam.
Scoring matrices Identity PAM BLOSUM.
BLOSUM Information Resources Algorithms in Computational Biology Spring 2006 Created by Itai Sharon.
Bioinformatics Unit 1: Data Bases and Alignments Lecture 3: “Homology” Searches and Sequence Alignments (cont.) The Mechanics of Alignments.
Sequence Alignments Revisited
Alignment IV BLOSUM Matrices. 2 BLOSUM matrices Blocks Substitution Matrix. Scores for each position are obtained frequencies of substitutions in blocks.
Alignment III PAM Matrices. 2 PAM250 scoring matrix.
Substitution matrices
Dayhoff’s Markov Model of Evolution. Brands of Soup Revisited Brand A Brand B P(B|A) = 2/7 P(A|B) = 2/7.
1 CAP5510 – Bioinformatics Substitution Patterns Tamer Kahveci CISE Department University of Florida.
Basics of Sequence Alignment and Weight Matrices and DOT Plot
Alignment Statistics and Substitution Matrices BMI/CS 576 Colin Dewey Fall 2010.
Substitution Numbers and Scoring Matrices
CISC667, S07, Lec5, Liao CISC 667 Intro to Bioinformatics (Spring 2007) Pairwise sequence alignment Needleman-Wunsch (global alignment)
Evolution and Scoring Rules Example Score = 5 x (# matches) + (-4) x (# mismatches) + + (-7) x (total length of all gaps) Example Score = 5 x (# matches)
Introduction to Bioinformatics Algorithms Sequence Alignment.
Amino Acid Scoring Matrices Jason Davis. Overview Protein synthesis/evolution Protein synthesis/evolution Computational sequence alignment Computational.
Alignment methods April 26, 2011 Return Quiz 1 today Return homework #4 today. Next homework due Tues, May 3 Learning objectives- Understand the Smith-Waterman.
Pairwise Sequence Alignment. The most important class of bioinformatics tools – pairwise alignment of DNA and protein seqs. alignment 1alignment 2 Seq.
Pairwise Sequence Alignment (II) (Lecture for CS498-CXZ Algorithms in Bioinformatics) Sept. 27, 2005 ChengXiang Zhai Department of Computer Science University.
Eric C. Rouchka, University of Louisville Sequence Database Searching Eric Rouchka, D.Sc. Bioinformatics Journal Club October.
. Sequence Alignment. Sequences Much of bioinformatics involves sequences u DNA sequences u RNA sequences u Protein sequences We can think of these sequences.
Pairwise alignment of DNA/protein sequences I519 Introduction to Bioinformatics, Fall 2012.
Biology 4900 Biocomputing.
Secondary structure prediction
Learning Targets “I Can...” -State how many nucleotides make up a codon. -Use a codon chart to find the corresponding amino acid.
Comp. Genomics Recitation 3 The statistics of database searching.
Construction of Substitution Matrices
Sequence Alignment Csc 487/687 Computing for bioinformatics.
Pairwise Sequence Analysis-III
DNA. Week 2 Review 1.Draw and label a diagram showing the cell membrane. 2.Define Osmosis 3.Define Active and Passive Transport 4.Describe the difference.
In-Class Assignment #1: Research CD2
©CMBI 2005 Database Searching BLAST Database Searching Sequence Alignment Scoring Matrices Significance of an alignment BLAST, algorithm BLAST, parameters.
Sequence Alignment.
Construction of Substitution matrices
Step 3: Tools Database Searching
Alignment methods April 17, 2007 Quiz 1—Question on databases Learning objectives- Understand difference between identity, similarity and homology. Understand.
The statistics of pairwise alignment BMI/CS 576 Colin Dewey Fall 2015.
©CMBI 2005 Database Searching BLAST Database Searching Sequence Alignment Scoring Matrices Significance of an alignment BLAST, algorithm BLAST, parameters.
Protein Sequence Alignment Multiple Sequence Alignment
Sequence similarity search II Searching for remote homologies.
Techniques for Protein Sequence Alignment and Database Searching G P S Raghava Scientist & Head Bioinformatics Centre, Institute of Microbial Technology,
Prepared By: Syed Khaleelulla Hussaini. Outline Proteins DNA RNA Genetics and evolution The Sequence Matching Problem RNA Sequence Matching Complexity.
Substitution Matrices and Alignment Statistics BMI/CS 776 Mark Craven February 2002.
Arginine, who are you? Why so important?. Release 2015_01 of 07-Jan-15 of UniProtKB/Swiss-Prot contains sequence entries, comprising
Pairwise Sequence Alignment and Database Searching
Sequence similarity, BLAST alignments & multiple sequence alignments
Protein Sequence Alignments
Tutorial 3 – Protein Scoring Matrices PAM & BLOSUM
Alignment IV BLOSUM Matrices
Presentation transcript:

Scoring the Alignment of Amino Acid Sequences Constructing PAM and Blosum Matrices

Proteins are huge molecules made up of large numbers of amino acids. The proteins are usually 100 to 500 amino acids long There are 20 different amino acids that make up the proteins Quotes from page 11 of our Lab Manual:

Name Abbr. Linear structure formula ====================================================== AlanineAlanine ala a CH3-CH(NH2)-COOH ArginineArginine arg r HN=C(NH2)-NH-(CH2)3-CH(NH2)-COOH AsparagineAsparagine asn n H2N-CO-CH2-CH(NH2)-COOH Aspartic acidAspartic acid asp d HOOC-CH2-CH(NH2)-COOH CysteineCysteine cys c HS-CH2-CH(NH2)-COOH GlutamineGlutamine gln q H2N-CO-(CH2)2-CH(NH2)-COOH Glutamic acidGlutamic acid glu e HOOC-(CH2)2-CH(NH2)-COOH GlycineGlycine gly g NH2-CH2-COOH HistidineHistidine his h NH-CH=N-CH=C-CH2-CH(NH2)-COOH IsoleucineIsoleucine ile i CH3-CH2-CH(CH3)-CH(NH2)- LeucineLeucine leu l (CH3)2-CH-CH2-CH(NH2)-COOH LysineLysine lys k H2N-(CH2)4-CH(NH2)-COOH MethionineMethionine met m CH3-S-(CH2)2-CH(NH2)-COOH PhenylalaninePhenylalanine phe f Ph-CH2-CH(NH2)-COOH ProlineProline pro p NH-(CH2)3-CH-COOH SerineSerine ser s HO-CH2-CH(NH2)-COOH ThreonineThreonine thr t CH3-CH(OH)-CH(NH2)-COOH TryptophanTryptophan trp w Ph-NH-CH=C-CH2-CH(NH2)-COOH TyrosineTyrosine tyr y HO-p-Ph-CH2-CH(NH2)-COOH ValineValine val v (CH3)2-CH-CH(NH2)-COOH

The number, variety, and chemical properties of the Amino Acids make the problem of scoring a pair of Amino Acids a much more complicated problem than scoring a pair of nucleotides. In the late 1970’s Dayhoff, Schwartz, and Orcutt decided to look at a database of similar proteins having common ancestors and obtain substitution frequency data. They looked at 71 groupings of protein data that differed by no more than 15% of their residues, i.e. at least 85% similar. They then built phylogenetic trees where each transition from generation to generation has as few changes as possible, given the data, in each ancestral sequence. From this a value is determined for the entry A ab in a matrix giving the frequency data for each pairing.

Constructing a Parsimonious Phylogenetic Tree (taken from page 40 of Krane & Raymer) ACGCTAFKI A -> G I -> L GCGCTAFKI ACGCTAFKL A -> G A -> L C -> S G -> A GCGCTGFKI GCGCTLFKI ASGCTAFKL ACACTAFKL Dayhoff and her team used sequences that were at least 85% similar and calculated the frequency with which each protein was substituted for each of the other proteins.

Dayhoff’s Data NOTE: The diagonals are blank since only the changes are recorded. Also, the upper triangular half of the matrix is not shown since it is assumed that the changes α  and  α are symmetrical.

Calculating the Entry in The Substitution Matrix Let P(b|a,t) = Probability that a is substituted for b in t time units adjusted for divergence time (Dayhoff time unit) q a q b = Probability that a would randomly follow b = (frequency if a)(freqency of b) s(a,b | t) = an entry at position (a, b) or (b, a) in the scoring matrix Then, s(a, b | t) =

The Probabilities Found By Dayhoff The entry in cell M ab is the probability that a would be followed by b in one Dayhoff time unit multiplied by 100. Thus, for example, Alanine would be followed by Proline 0.22% of the time.

Note: The previous matrix is NOT the scoring matrix. It is used to derive the scoring matrix. Recall: s(a, b | t) = However, the probability matrix is the main tool for deriving a sensible scoring matrix. To find the probability that amino acid a will mutate be replaced by amino acid b at a time t time units later, we need to calculate the a,b-th entry of the matrix M t. After calculating this entry, then we apply the “log-odds” formula given above. The reason that the logarithm is used in the scoring formula is that it allows us, among other things, to add the scores of the aligned residues when we compute the score for an overall alignment of two sequences.

The matrix having scores found from the original probability matrix is called a 1 PAM matrix PAM stands for Point Accepted Mutation or Percent Accepted Mutation Dayhoff’s term was Accepted Point Mutation, but PAM rolls off the tongue easier than APM. The 1 means that given the degree of similarity between the sequences used to make up the matrix, the scores in this matrix are the frequencies for one evolutionary time unit. Scores representing longer times and are called PAMt matrices = M t. The most widely used matrix is PAM250 or the log-odds matrix based on: M 250 = the 250 th power of M. This matrix shows the probability of change over a long period of time. However, for closely related sequences, say mouse and rat MSH2, a PAM10 matrix may be more appropriate

The PAM250 Matrix We only show the top half because the bottom half is a reflection of the top half, i.e. S a,b = S b,a

Discussion of PAM The 1 PAM matrix was derived by constructing hypothetical phylogenetic trees relating sequences in 71 families. The higher the power of the matrix, the more evolutionary time units represented by the matrix. Criticism – raising M to high powers does not capture the true difference between short time substitutions and long time substitutions. Note short time substitutions are dominated by amino acid substitutions that come from a single base change in the codon triplets of an Amino Acid, whereas the long time substitutions show all kinds of codon changes

BLOSUM (BLOck Substitution Matrix) Matrices

The criticism given at the end of the last discussion is that the large PAM matrices tend to minimize the effects of short time substitutions such as L I L V and Y F In 1991 – 1992 Henikoff and Henikoff used the BLOCKS database at the Fred Hutchison Cancer Research Center This database contains blocks of multiple alignments of more distantly related sequences Such a database can be used to derive scores more directly

Methodology Sequences from each block were clustered Two sequences were placed in the same cluster if their percent differences were above some level, say α% The frequency A ab is calculated from observing residue a in one clustered alignment against residue b in another clustered alignment. Corrections are made for clusters of differing sizes

Calculating the Matrix Entries Let the following be determined from the observed data: q a = the fraction of pairings that include an a p ab = the fraction of parings of a and b Then and The score is calculated as These values are then scaled and rounded to make calculations easier.

If we set the limit, α, to 62, the we have a BLOSUM62 Matrix

Most popular BLOSUM Matrices are BLOWSUM62 and BLOWSUM50. BLOWSUM62 is used mainly for ungapped matching. BLOWSUM50 is used for alignments with gaps. Note: the lower the number the longer the time span in evolutionary units.

Differences Between PAM and BLOSUM PAM assumes that substitutions probabilities for highly related proteins can be extrapolated to the probabilities for distantly related proteins. BLOWSUM matrices are based on the observation of more distantly related protein alignments. NOTE: Both types of matrices use log-odds values in their scoring systems.