Substitution Matrices

Slides:



Advertisements
Similar presentations
Fa07CSE 182 CSE182-L4: Database filtering. Fa07CSE 182 Summary (through lecture 3) A2 is online We considered the basics of sequence alignment –Opt score.
Advertisements

1 Introduction to Sequence Analysis Utah State University – Spring 2012 STAT 5570: Statistical Bioinformatics Notes 6.1.
Measuring the degree of similarity: PAM and blosum Matrix
DNA sequences alignment measurement
Lecture 8 Alignment of pairs of sequence Local and global alignment
Introduction to Bioinformatics
Optimatization of a New Score Function for the Detection of Remote Homologs Kann et al.
Heuristic alignment algorithms and cost matrices
Sequence analysis course
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.
Fa05CSE 182 CSE182-L4: Scoring matrices, Dictionary Matching.
Scoring Matrices June 22, 2006 Learning objectives- Understand how scoring matrices are constructed. Workshop-Use different BLOSUM matrices in the Dotter.
Sequence similarity.
Similar Sequence Similar Function Charles Yan Spring 2006.
Sequence Alignment III CIS 667 February 10, 2004.
. Computational Genomics Lecture #3a (revised 24/3/09) This class has been edited from Nir Friedman’s lecture which is available at
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.
Multiple Sequence Alignments
Substitution matrices
Information theoretic interpretation of PAM matrices Sorin Istrail and Derek Aguiar.
Alignment Statistics and Substitution Matrices BMI/CS 576 Colin Dewey Fall 2010.
Pairwise Alignment How do we tell whether two sequences are similar? BIO520 BioinformaticsJim Lund Assigned reading: Ch , Ch 5.1, get what you can.
Phylogeny Estimation: Traditional and Bayesian Approaches Molecular Evolution, 2003
An Introduction to Bioinformatics
Protein Evolution and Sequence Analysis Protein Evolution and Sequence Analysis.
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)
Sequence analysis: Macromolecular motif recognition Sylvia Nagl.
Sequence Alignment Goal: line up two or more sequences An alignment of two amino acid sequences: …. Seq1: HKIYHLQSKVPTFVRMLAPEGALNIHEKAWNAYPYCRTVITN-EYMKEDFLIKIETWHKP.
Amino Acid Scoring Matrices Jason Davis. Overview Protein synthesis/evolution Protein synthesis/evolution Computational sequence alignment Computational.
Pairwise Sequence Alignment. The most important class of bioinformatics tools – pairwise alignment of DNA and protein seqs. alignment 1alignment 2 Seq.
Eric C. Rouchka, University of Louisville Sequence Database Searching Eric Rouchka, D.Sc. Bioinformatics Journal Club October.
Pairwise alignment of DNA/protein sequences I519 Introduction to Bioinformatics, Fall 2012.
Comp. Genomics Recitation 3 The statistics of database searching.
Construction of Substitution Matrices
Sequence Alignment Csc 487/687 Computing for bioinformatics.
Function preserves sequences Christophe Roos - MediCel ltd Similarity is a tool in understanding the information in a sequence.
BLAST: Basic Local Alignment Search Tool Altschul et al. J. Mol Bio CS 466 Saurabh Sinha.
Pairwise Sequence Analysis-III
Molecular biology databases Based on Chapter 2 of Post-genome Informatics by Minoru Kanehisa, Oxford University Press, History 2.2 Information.
BLAST Slides adapted & edited from a set by Cheryl A. Kerfeld (UC Berkeley/JGI) & Kathleen M. Scott (U South Florida) Kerfeld CA, Scott KM (2011) Using.
©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
The statistics of pairwise alignment BMI/CS 576 Colin Dewey Fall 2015.
Universal Tree of Life  Universal tree ids the roadmap of life. It depicts the evolutionary history of the cells of all organism and the criteria reveals.
DNA sequences alignment measurement Lecture 13. Introduction Measurement of “strength” alignment Nucleic acid and amino acid substitutions Measurement.
Techniques for Protein Sequence Alignment and Database Searching G P S Raghava Scientist & Head Bioinformatics Centre, Institute of Microbial Technology,
Last lecture summary. Sequence alignment What is sequence alignment Three flavors of sequence alignment Point mutations, indels.
Substitution Matrices and Alignment Statistics BMI/CS 776 Mark Craven February 2002.
Pairwise Sequence Alignment and Database Searching
Sequence similarity, BLAST alignments & multiple sequence alignments
Molecular biology databases
Substitution Matrices Multiple Sequence Alignment (I)
Introduction to bioinformatics 2007
Introduction to bioinformatics Lecture 7
Tutorial 3 – Protein Scoring Matrices PAM & BLOSUM
Phylogenics & Molecular Clocks
Sequence Similarity Andrew Torda, wintersemester 2006 / 2007, Angewandte … What is the easiest information to find about a protein ? sequence history.
Alignment IV BLOSUM Matrices
Basic Local Alignment Search Tool
Introduction to bioinformatics Lecture 5 Pair-wise sequence alignment
Presentation transcript:

Substitution Matrices F O I G A V B M S U Introduction to bioinformatics 2007 Lecture 8 Substitution Matrices

Sequence Analysis Finding relationships between genes and gene products of different species, including those at large evolutionary distances

Archaea Domain Archaea is mostly composed of cells that live in extreme environments. While they are able to live elsewhere, they are usually not found there because outside of extreme environments they are competitively excluded by other organisms. Species of the domain Archaea are not inhibited by antibiotics, lack peptidoglycan in their cell wall (unlike bacteria, which have this sugar/polypeptide compound), and can have branched carbon chains in their membrane lipids of the phospholipid bilayer.

Archaea (Cnt.) It is believed that Archaea are very similar to prokaryotes (e.g. bacteria) that inhabited the earth billions of years ago. It is also believed that eukaryotes evolved from Archaea, because they share many mRNA sequences, have similar RNA polymerases, and have introns. Therefore, it is generally assumed that the domains Archaea and Bacteria branched from each other very early in history, after which membrane infolding* produced eukaryotic cells in the archaean branch approximately 1.7 billion years ago. There are three main groups of Archaea: extreme halophiles (salt), methanogens (methane producing anaerobes), and hyperthermophiles (e.g. living at temperatures >100º C!). *Membrane infolding is believed to have led to the nucleus of eukaryotic cells, which is a membrane-enveloped cell organelle that holds the cellular DNA. Prokaryotic cells are more primitive and do not have a nucleus.

Example of nucleotide sequence database entry for Genbank LOCUS DRODPPC 4001 bp INV 15-MAR-1990 DEFINITION D.melanogaster decapentaplegic gene complex (DPP-C), complete cds. ACCESSION M30116 KEYWORDS . SOURCE D.melanogaster, cDNA to mRNA. ORGANISM Drosophila melanogaster Eurkaryote; mitochondrial eukaryotes; Metazoa; Arthropoda; Tracheata; Insecta; Pterygota; Diptera; Brachycera; Muscomorpha; Ephydroidea; Drosophilidae; Drosophilia. REFERENCE 1 (bases 1 to 4001) AUTHORS Padgett, R.W., St Johnston, R.D. and Gelbart, W.M. TITLE A transcript from a Drosophila pattern gene predicts a protein homologous to the transforming growth factor-beta family JOURNAL Nature 325, 81-84 (1987) MEDLINE 87090408 COMMENT The initiation codon could be at either 1188-1190 or 1587-1589 FEATURES Location/Qualifiers source 1..4001 /organism=“Drosophila melanogaster” /db_xref=“taxon:7227” mRNA <1..3918 /gene=“dpp” /note=“decapentaplegic protein mRNA” /db_xref=“FlyBase:FBgn0000490” gene 1..4001 /note=“decapentaplegic” /allele=“” CDS 1188..2954 /note=“decapentaplegic protein (1188 could be 1587)” /codon_start=1 /db_xref=“PID:g157292” /translation=“MRAWLLLLAVLATFQTIVRVASTEDISQRFIAAIAPVAAHIPLA SASGSGSGRSGSRSVGASTSTALAKAFNPFSEPASFSDSDKSHRSKTNKKPSKSDANR …………………… LGYDAYYCHGKCPFPLADHFNSTNAVVQTLVNNMNPGKVPKACCVPTQLDSVAMLYL NDQSTBVVLKNYQEMTBBGCGCR” BASE COUNT 1170 a 1078 c 956 g 797 t ORIGIN 1 gtcgttcaac agcgctgatc gagtttaaat ctataccgaa atgagcggcg gaaagtgagc 61 cacttggcgt gaacccaaag ctttcgagga aaattctcgg acccccatat acaaatatcg 121 gaaaaagtat cgaacagttt cgcgacgcga agcgttaaga tcgcccaaag atctccgtgc 181 ggaaacaaag aaattgaggc actattaaga gattgttgtt gtgcgcgagt gtgtgtcttc 241 agctgggtgt gtggaatgtc aactgacggg ttgtaaaggg aaaccctgaa atccgaacgg 301 ccagccaaag caaataaagc tgtgaatacg aattaagtac aacaaacagt tactgaaaca 361 gatacagatt cggattcgaa tagagaaaca gatactggag atgcccccag aaacaattca 421 attgcaaata tagtgcgttg cgcgagtgcc agtggaaaaa tatgtggatt acctgcgaac 481 cgtccgccca aggagccgcc gggtgacagg tgtatccccc aggataccaa cccgagccca 541 gaccgagatc cacatccaga tcccgaccgc agggtgccag tgtgtcatgt gccgcggcat 601 accgaccgca gccacatcta ccgaccaggt gcgcctcgaa tgcggcaaca caattttcaa …………………………. 3841 aactgtataa acaaaacgta tgccctataa atatatgaat aactatctac atcgttatgc 3901 gttctaagct aagctcgaat aaatccgtac acgttaatta atctagaatc gtaagaccta 3961 acgcgtaagc tcagcatgtt ggataaatta atagaaacga g //

Example of protein sequence database entry for SWISS-PROT (now UNIPROT) ID DECA_DROME STANDARD; PRT; 588AA. AC P07713; DT 01-APR-1988 (REL. 07, CREATED) DT 01-APR-1988 (REL. 07, LAST SEQUENCE UPDATE) DT 01-FEB-1995 (REL. 31, LAST ANNOTATION UPDATE) DE DECAPENTAPLEGIC PROTEIN PRECURSOR (DPP-C PROTEIN). GN DPP. OS DROSOPHILA MELANOGASTER (FRUIT FLY). OC EUKARYOTA; METAZOA; ARTHROPODA; INSECTA; DIPTERA. RN [1] RP SEQUENCE FROM N.A. RM 87090408 RA PADGETT R.W., ST JOHNSTON R.D., GELBART W.M.; RL NATURE 325:81-84 (1987) RN [2] RP CHARACTERIZATION, AND SEQUENCE OF 457-476. RM 90258853 RA PANGANIBAN G.E.F., RASHKA K.E., NEITZEL M.D., HOFFMANN F.M.; RL MOL. CELL. BIOL. 10:2669-2677(1990). CC -!- FUNCTION: DPP IS REQUIRED FOR THE PROPER DEVELOPMENT OF THE CC EMBRYONIC DOORSAL HYPODERM, FOR VIABILITY OF LARVAE AND FOR CELL CC VIABILITY OF THE EPITHELIAL CELLS IN THE IMAGINAL DISKS. CC -!- SUBUNIT: HOMODIMER, DISULFIDE-LINKED. CC -!- SIMILARITY: TO OTHER GROWTH FACTORS OF THE TGF-BETA FAMILY. DR EMBL; M30116; DMDPPC. DR PIR; A26158; A26158. DR HSSP; P08112; 1TFG. DR FLYBASE; FBGN0000490; DPP. DR PROSITE; PS00250; TGF_BETA. KW GROWTH FACTOR; DIFFERENTIATION; SIGNAL. FT SIGNAL 1 ? POTENTIAL. FT PROPEP ? 456 FT CHAIN 457 588 DECAPENTAPLEGIC PROTEIN. FT DISULFID 487 553 BY SIMILARITY. FT DISULFID 516 585 BY SIMILARITY. FT DISULFID 520 587 BY SIMILARITY. FT DISULFID 552 552 INTERCHAIN (BY SIMILARITY). FT CARBOHYD 120 120 POTENTIAL. FT CARBOHYD 342 342 POTENTIAL. FT CARBOHYD 377 377 POTENTIAL. FT CARBOHYD 529 529 POTENTIAL. SQ SEQUENCE 588 AA; 65850MW; 1768420 CN; MRAWLLLLAV LATFQTIVRV ASTEDISQRF IAAIAPVAAH IPLASASGSG SGRSGSRSVG ASTSTAGAKA FNRFSEPASF SDSDKSHRSK TNKKPSKSDA NRQFNEVHKP RTDQLENSKN KSKQLVNKPN HNKMAVKEQR SHHKKSHHHR SHQPKQASAS TESHQSSSIE SIFVEEPTLV LDREVASINV PANAKAIIAE QGPSTYSKEA LIKDKLKPDP STYLVEIKSL LSLFNMKRPP KIDRSKIIIP EPMKKLYAEI MGHELDSVNI PKPGLLTKSA NTVRSFTHKD SKIDDRFPHH HRFRLHFDVK SIPADEKLKA AELQLTRDAL SQQVVASRSS ANRTRYQBLV YDITRVGVRG QREPSYLLLD TKTBRLNSTD TVSLDVQPAV DRWLASPQRN YGLLVEVRTV RSLKPAPHHH VRLRRSADEA HERWQHKQPL LFTYTDDGRH DARSIRDVSG GEGGGKGGRN KRHARRPTRR KNHDDTCRRH SLYVDFSDVG WDDWIVAPLG YDAYYCHGKC PFPLADHRNS TNHAVVQTLV NNMNPGKBPK ACCBPTQLDS VAMLYLNDQS TVVLKNYQEM TVVGCGCR

Definition of substitution matrix Two-dimensional matrix with score values describing the probability of one amino acid or nucleotide being replaced by another during sequence evolution.

Scoring matrices for nucleotide sequences Can be simple: e.g. positive value for match and zero for mismatch. frequencies of mutation are equal for all bases. Can be more complicated: taking into account transitions and transversions (e.g. Kimura model)

Scoring matrices for nucleotide sequences Simple model Kimura A C T G 1 purines pyrimidines

What is better to align? DNA or protein sequences? Many mutations within DNA are synonymous  divergence overestimation

Evolutionary relationships can be more accurately expressed using a 20×20 amino acid exchange table DNA sequences contain non-coding regions, which should be avoided in homology searches. Still an issue when translating into (six) protein sequences through a codon table. Searching at protein level: frameshifts can occur, leading to stretches of incorrect amino acids and possibly elongation. However, frameshifts normally result in stretches of highly unlikely amino acids.

So? Rule of thumb:  if ORF exists, then align at protein level

Scoring matrices for amino acid sequences Are complicated, scoring has to reflect: Physio-chemical properties of aa’s Likelihood of residues being substituted among truly homologous sequences Certain aa with similar properties can be more easily substituted: preserve structure/function “Disruptive” substitution is less likely to be selected in evolution (e.g. non functional proteins)

Scoring matrices for amino acid sequences Main chain

Example: Cysteines are very common in metal binding motifs Zn histidine

Now let’s think about alignments Lets consider a simple alignment: ungapped global alignment of two (protein) sequences, x and y, of length n. In scoring this alignment, we would like to assess whether these two sequences have a common ancestor, or whether they are aligned by chance. We therefore want our amino acid substitution table (matrix) to score an alignment by estimating this ratio (= improvement over random). In brief, each substitution score is the log-odds probability that amino acid a could change (mutate) into amino acid b through evolution, based on the constraints of our evolutionary model.  sequences have common ancestor  sequences are aligned by chance

Target and background probabilities Background probability If qa is the frequency of amino acid a in one sequence and qb is the frequency of amino acid b in another sequence, then the probability of the alignment being random is given by: Target probability If pab is now the probability that amino acids a and b have derived from a common ancestor, then the probability that the alignment is due to common ancestry is is given by: A R S V K A R S V K

Source of target and background probabilities: high confidence alignments Target frequencies The “evolutionary true” alignments allow us to get biologically permissible amino acid mutations and derive the frequencies of observed pairs. These are the TARGET frequencies (20x20 combinations). Background frequencies The BACKGROUND frequencies are simply the frequency at which each amino acid type is observed in these “trusted” data sets (20 values).

20/09/2018 Log-odds Substitution matrices apply logarithmic conversions to describe the probability of amino acid substitutions The converted values are the so-called log-odds scores So they are simply the logarithmic ratios of the observed mutation frequency divided by the probability of substitution expected by random chance (target – background) Question for students: Why do we take the logs?

Formulas Odds-ratio of two probabilities Log-odds probability of an alignment being random is therefore given by

Logarithmic functions Logarithms to various bases: red is to base e, green is to base 10, and purple is to base 1.7. Each tick on the axes is one unit. Logarithms of all bases pass through the point (1, 0), because any number raised to the power 0 is 1, and through the points (b, 1) for base b, because any number raised to the power 1 is itself. The curves approach the y axis but do not reach it, due to the singularity of a logarithm at x = 0. http://en.wikipedia.org/wiki/Logarithm

So… for a given substitution matrix: a positive score means that the frequency of amino acid substitutions found in the high confidence alignments is greater than would have occurred by random chance a zero score … that the freq. is equal to that expected by chance a negative score … that the freq. is less to that expected by chance

Alignment score The alignment score S is given by the sum of all amino acid pair substitution scores: Where the substitution score for any amino acid pair [a,b] is given by:

Alignment score The total score of an alignment: EAAS VF-T would be:

Empirical matrices Are based on surveys of actual amino acid substitutions among related proteins Most widely used: PAM and BLOSUM

The PAM series The first systematic method to derive amino acid substitution matrices was done by Margaret Dayhoff et al. (1978) Atlas of Protein Structure. These widely used substitution matrices are frequently called Dayhoff, MDM (Mutation Data Matrix), or PAM (Point Accepted Mutation) matrices. Key idea: trusted alignments of closely related sequences provide information about biologically permissible mutations.

The PAM design Step 1. Dayhoff used 71 protein families, made hypothetical phylogenetic trees and recorded the number of observed substitutions (along each branch of the tree) in a 20x20 target matrix.

Step 2. The target matrix was then converted to frequencies by dividing each cell (a,b) over the sum of all other substitutions of a. Step 3. The target matrix was normalized so that the expected number of substitutions covered 1% of the protein (PAM-1). Step 4. Determine the final substitution matrix.

PAM units One PAM unit is defined as 1% of the amino acids positions that have been changed E.g. to construct the PAM1 substitution table, a group of closely related sequences with mutation frequencies corresponding to one PAM unit is chosen

But there is a whole series of matrices: PAM10 … PAM250 These matrices are extrapolated from PAM1 matrix (by matrix multiplication) So: a PAM is a relative measure of evolutionary distance 1 PAM = 1 accepted mutation per 100 amino acids 250 PAM = 250 mutations per 100 amino acids, so 2.5 accepted mutations per amino acid X = Multiply Matrices N times to make PAM ‘N’; then take the Log

PAM numbers vs. observed am.ac. mutational rates Observed Mutation Rate (%) Sequence Identity (%) 100 1 99 30 25 75 80 50 110 40 60 200 250 20 Note Think about intermediate “substitution” steps …

The PAM250 matrix R exchange is too large (due to paucity of data) A 2 - 2 6 N 0 0 2 D 1 2 4 C 4 5 12 Q 0 1 1 2 5 4 E 1 1 3 5 2 4 G 1 3 0 1 3 1 0 5 H 1 2 2 1 3 3 1 I 2 5 L 6 2 2 6 K 1 3 1 0 5 1 0 2 0 3 5 M 1 0 5 2 2 4 0 6 F 2 1 2 5 0 9 P 3 0 5 6 S 1 0 1 0 0 1 0 1 3 1 2 T 1 0 0 3 0 1 3 W 6 2 7 8 4 0 5 17 Y 5 0 2 7 3 0 10 V 2 4 2 2 2 2 4 B 1 2 3 4 1 2 0 1 3 1 Z 0 0 1 3 5 3 3 1 2 5 0 0 2 2 3 A R N D C Q E G H I L K M F P S T W Y V B Z R exchange is too large (due to paucity of data)

PAM model The scores derived through the PAM model are an accurate description of the information content (or the relative entropy) of an alignment (Altschul, 1991). PAM1 corresponds to about 1 million years of evolution. PAM120 has the largest information content of the PAM matrix series: “best” for general alignment. PAM250 is the traditionally most popular matrix: “best” for detecting distant sequence similarity.

Summary Dayhoff’s PAM-matrices Derived from global alignments of closely related sequences. Matrices for greater evolutionary distances are extrapolated from those for smaller ones. The number with the matrix (PAM40, PAM100) refers to the evolutionary distance; greater numbers are greater distances. Attempts to extend Dayhoff's methodology or re-apply her analysis using databases with more examples: Jones, Thornton and coworkers used the same methodology as Dayhoff but with modern databases (CABIOS 8:275) Gonnett and coworkers (Science 256:1443) used a slightly different (but theoretically equivalent) methodology

The BLOSUM series BLOSUM stands for: BLOcks SUbstitution Matrices Created by Steve Henikoff and Jorja Henikoff (PNAS 89:10915). Derived from local, un-gapped alignments of distantly related sequences. All matrices are directly calculated; no extrapolations are used. Again: compare observed freqs of each pair to expected freqs Then: Log-odds matrix.

The Blocks database The Blocks Database contains multiple alignments of conserved regions in protein families. Blocks are multiply aligned un-gapped segments corresponding to the most highly conserved regions of proteins. The blocks for the BLOCKS database are made automatically by looking for the most highly conserved regions in groups of proteins represented in the PROSITE database. These blocks are then calibrated against the SWISS-PROT database to obtain a measure of the random distribution of matches. It is these calibrated blocks that make up the BLOCKS database. The database can be searched to classify protein and nucleotide sequences.

The Blocks database Gapless alignment blocks

The BLOSUM series BLOSUM30, 35, 40, 45, 50, 55, 60, 62, 65, 70, 75, 80, 85, 90. The number after the matrix (BLOSUM62) refers to the minimum percent identity of the blocks (in the BLOCKS database) used to construct the matrix (all blocks have >=62% sequence identity); No extrapolations are made in going to higher evolutionary distances High number - closely related sequences Low number - distant sequences BLOSUM62 is the most popular: best for general alignment.

The log-odds matrix for BLOSUM62

PAM versus BLOSUM Based on an explicit evolutionary model Derived from small, closely related proteins with ~15% divergence Higher PAM numbers to detect more remote sequence similarities Errors in PAM 1 are scaled 250X in PAM 250 Based on empirical frequencies Uses much larger, more diverse set of protein sequences (30-90% ID) Lower BLOSUM numbers to detect more remote sequence similarities Errors in BLOSUM arise from errors in alignment

Comparing exchange matrices 20/09/2018 Comparing exchange matrices To compare amino acid exchange matrices, the "Entropy" value can be used. This is a relative entropy value (H) which describes the amount of information available per aligned residue pair. PAM250 was “historical” matrix which roughly corresponds to BLOSUM45; However nowadays BLOSUM62 is used although this is a “more severe” matrix. Reason: BLOSUM62 performs “best” for local alignments.

Evolution and Matrix “landscape” 20/09/2018 Evolution and Matrix “landscape” Recent evolution  identity matrix Ancient evolution  convergence to random model

Specialized matrices E H C 20/09/2018 Specialized matrices Several other aa exchange matrices have been constructed, for situations in which non-standard amino acid frequencies occur Secondary structure based exchange matrix (Lüthy R, McLachlan AD, Eisenberg D, Proteins 1991; 10(3):229-39) Batmas: TM kernels of bacterial proteins. In TM-kernels, polar and charged residues, as well as proline and tyrosine, are highly conserved, whereas there are more substitutions within the group of hydrophobic residues, in contrast to non-TM-proteins that have fewer, relatively more conserved, hydrophobic residues. Also differences bact & euk TM kernels E H C

Specialized matrices Transmembrane specific substitution matrices: 20/09/2018 Specialized matrices Transmembrane specific substitution matrices: PHAT (Ng P, Henikoff J, Henikoff S, Bioinformatics 2000;16(9):760-766) Built from predicted hydrophobic and transmembrane regions of the blocks database BATMAS (Sutormin RA, Rakhmaninova AB, Gelfand S, Proteins 2003; 51(1):85-95) Derived from predicted TM-kernels of bacterial proteins Batmas: TM kernels of bacterial proteins. In TM-kernels, polar and charged residues, as well as proline and tyrosine, are highly conserved, whereas there are more substitutions within the group of hydrophobic residues, in contrast to non-TM-proteins that have fewer, relatively more conserved, hydrophobic residues. Also differences bact & euk TM kernels

A note on reliability All these matrices are designed using standard evolutionary models. Circular problem It is important to understand that evolution is not the same for all proteins, not even for the same regions of proteins. alignment matrix

… No single matrix performs best on all sequences. Some are better for sequences with few gaps, and others are better for sequences with fewer identical amino acids. Therefore, when aligning sequences, applying a general model to all cases is not ideal. Rather, re-adjustment can be used to make the general model better fit the given data.

Pair-wise alignment quality versus sequence identity 20/09/2018 Pair-wise alignment quality versus sequence identity Vogt et al., JMB 249, 816-831,1995 Gonnett’s matrix performed best and achieved the above presented results. Twilight zone

Take-home messages - 1 If ORF exists, then align at protein level. Amino acid substitution matrices reflect the log-odds ratio between the evolutionary and random model and can therefore help in determining homology via the alignment score. The evolutionary and random models depend on generalized data sets used to derive them. This not an ideal solution.

Take-home messages - 2 Apart from the PAM and BLOSUM series, a great number of further matrices have been developed. Matrices have been made based on DNA, protein structure, information content, etc. For local alignment, BLOSUM62 is often superior; for distant (global) alignments, BLOSUM50, GONNET, or (still) PAM250 work well. Remember that gap penalties are always a problem: unlike the matrices themselves, there is no formal way to calculate their values -- you can follow recommended settings, but these are based on trial and error and not on a formal framework.