BLOSUM

From Wikipedia, the free encyclopedia
  (Redirected from BLOSUM62)
Jump to: navigation, search
The BLOSUM62 matrix

In bioinformatics, the BLOSUM (BLOcks SUbstitution Matrix) matrix is a substitution matrix used for sequence alignment of proteins. BLOSUM matrices are used to score alignments between evolutionarily divergent protein sequences. They are based on local alignments. BLOSUM matrices were first introduced in a paper by Henikoff and Henikoff.[1] They scanned the BLOCKS database for a very conserved regions of protein families (that do not have gaps in the sequence alignment) and then counted the relative frequencies of amino acids and their substitution probabilities. Then, they calculated a log-odds score for each of the 210 possible substitution pairs of the 20 standard amino acids. All BLOSUM matrices are based on observed alignments; they are not extrapolated from comparisons of closely related proteins like the PAM Matrices.

Biological background[edit]

The genetic instructions of every replicating cell in a living organism are contained within its DNA.[2] Throughout the cell's lifetime, this information is transcribed and replicated by cellular mechanisms to produce proteins or to provide instructions for daughter cells during cell division, and the possibility exists that the DNA may be altered during these processes.[2][3] This is known as a mutation. At the molecular level, there are regulatory systems that correct most — but not all — of these changes to the DNA before it is replicated.[3][4]

The functionality of a protein is highly dependent on its structure.[5] Changing a single amino acid in a protein may reduce its ability to carry out this function, or the mutation may even change the function that the protein carries out.[3] Changes like these may severely impact a crucial function in a cell, potentially causing the cell — and in extreme cases, the organism — to die.[6] Conversely, the change may allow the cell to continue functioning albeit differently, and the mutation can be passed on to the organism's offspring. If this change does not result in any significant physical disadvantage to the offspring, the possibility exists that this mutation will persist within the population. The possibility also exists that the change in function becomes advantageous.

The 20 amino acids translated by the genetic code vary greatly by the physical and chemical properties of their side chains.[5] However, these amino acids can be categorised into groups with similar physicochemical properties.[5] Substituting an amino acid with another from the same category is more likely to have a smaller impact on the structure and function of a protein than replacement with an amino acid from a different category.

Sequence alignment is a fundamental research method for modern biology. The most common sequence alignment for protein is to look for the similarity between different sequences in order to understand the evolutionarily divergent protein sequences on the molecular level, so that researchers could predict the functions initiated by those mutated genes. Matrices are applied as algorithms to calculate the similarity of different sequences of proteins; however, the utility of Dayhoff Matrix which is a widely used method before is limited due to the requirement of sequences with a similarity more than 85%. In order to fill in this gap, Henikoff and Henikoff introduced BLOSUM (BLOcks SUbstitution Matrix) matrix which led to marked improvements in alignments and in searches using queries from each of the groups of related proteins.[1]

Terminology[edit]

BLOSUM: Blocks Substitution Matrix, a substitution matrix used for sequence alignment of proteins.

Scoring metrics (statistical versus biological): When evaluating a sequence alignment, one would like to know how meaningful it is. This requires a scoring matrix, or a table of values that describes the probability of a biologically meaningful amino-acid or nucleotide residue-pair occurring in an alignment. Scores for each position are obtained frequencies of substitutions in blocks of local alignments of protein sequences.[7]

Several sets of BLOSUM matrices exist using different alignment databases, named with numbers. BLOSUM matrices with high numbers are designed for comparing closely related sequences, while those with low numbers are designed for comparing distant related sequences. For example, BLOSUM80 is used for less divergent alignments, and BLOSUM45 is used for more divergent alignments. The matrices were created by merging (clustering) all sequences that were more similar than a given percentage into one single sequence and then comparing those sequences (that were all more divergent than the given percentage value) only; thus reducing the contribution of closely related sequences. The percentage used was appended to the name, giving BLOSUM80 for example where sequences that were more than 80% identical were clustered.

BLOSUM r: the matrix built from blocks with no more the r% of similarity – E.g., BLOSUM62 is the matrix built using sequences with no more than 62% similarity. – Note: BLOSUM 62 is the default matrix for protein BLAST. Experimentation has shown that the BLOSUM-62 matrix is among the best for detecting most weak protein similarities.[1]

Construction of BLOSUM matrices[edit]

BLOSUM matrices are obtained by using blocks of similar amino acid sequences as data, then applying statistical methods to the data to obtain the similarity scores. Statistical Methods Steps : [8]

Eliminating Sequences[edit]

Eliminating the sequences that are more than r% identical. There are two ways to eliminate the sequences. It can be done either by removing sequences from the block or just by finding similar sequences and replace them by new sequences which could represent the cluster. Eliminating is done to avoid bias of the result in favor of a certain protein.

Calculating Frequency & Probability[edit]

A database storing the sequence alignments of the most conserved regions of protein families. These alignments are used to derive the BLOSUM matrices. Only the sequences with a percentage of identity higher are used. By using the block, counting the pairs of amino acids in each column of the multiple alignment.

Log odd ratio[edit]

It gives the ratio of the occurrence each amino acid combination in the observed data to the expected value of occurrence of the pair. It is rounded off and used in the substitution matrix.

LogOddRatio=2 \log_2{\left( \frac{P \left(O \right)}{P \left(E \right)} \right)}

In which P \left(O \right) is the possibility of observed and P \left(E \right) is the possibility of expected.

BLOSUM Matrices[edit]

The odds for relatedness are calculated from log odd ratio, which are then rounded off to get the substitution matrices BLOSUM matrices.

Score of the BLOSUM matrices[edit]

A scoring matrix or a table of values is required for evaluating the significance of a sequence alignment, such as describing the probability of a biologically meaningful amino-acid or nucleotide residue-pair occurring in an alignment. Typically, when two nucleotide sequences are being compared, all that is being scored is whether or not two bases are the same at one position. All matches and mismatches are respectively given the same score (typically +1 or +5 for matches, and -1 or -4 for mismatches).[9] But it is different for proteins. Substitution matrices for amino acids are more complicated and implicitly take into account everything that might affect the frequency with which any amino acid is substituted for another. The objective is to provide a relatively heavy penalty for aligning two residues together if they have a low probability of being homologous (correctly aligned by evolutionary descent). Two major forces drive the amino-acid substitution rates away from uniformity: substitutions occur with the different frequencies, and lessen functionally tolerated than others. Thus, substitutions are selected against.[7]

Commonly used substitution matrices include the blocks substitution (BLOSUM) [1] and point accepted mutation (PAM) [10][11] matrices. Both are based on taking sets of high-confidence alignments of many homologous proteins and assessing the frequencies of all substitutions, but they are computed using different methods.[7]

Scores within a BLOSUM are log-odds scores that measure, in an alignment, the logarithm for the ratio of the likelihood of two amino acids appearing with a biological sense and the likelihood of the same amino acids appearing by chance. The matrices are based on the minimum percentage identity of the aligned protein sequence used in calculating them.[12] Every possible identity or substitution is assigned a score based on its observed frequencies in the alignment of related proteins.[13] A positive score is given to the more likely substitutions while a negative score is given to the less likely substitutions.

To calculate a BLOSUM matrix, the following equation is used:

S_{ij}= \left( \frac{1}{\lambda} \right)\log{\left( \frac{p_{ij}}{q_i * q_j} \right)}

Here, p_{ij} is the probability of two amino acids i and j replacing each other in a homologous sequence, and q_i and q_j are the background probabilities of finding the amino acids i and j in any protein sequence. The factor \lambda is a scaling factor, set such that the matrix contains easily computable integer values.

An example - BLOSUM62[edit]

BLOSUM62: midrange

BLOSUM80: more related proteins

BLOSUM45: distantly related proteins

An article in Nature Biotechnology[14] revealed that the BLOSUM62 used for so many years as a standard is not exactly accurate according to the algorithm described by Henikoff and Henikoff.[1] Surprisingly, the miscalculated BLOSUM62 improves search performance.[14]

The BLOSUM62 matrix with the amino acids in the table grouped according to the chemistry of the side chain, as in (a). Each value in the matrix is calculated by dividing the frequency of occurrence of the amino acid pair in the BLOCKS database, clustered at the 62% level, divided by the probability that the same two amino acids might align by chance. The ratio is then converted to a logarithm and expressed as a log odds score, as for PAM. BLOSUM matrices are usually scaled in half-bit units. A score of zero indicates that the frequency with which a given two amino acids were found aligned in the database was as expected by chance, while a positive score indicates that the alignment was found more often than by chance, and negative score indicates that the alignment was found less often than by chance.

Some uses in bioinformatics[edit]

Research applications[edit]

BLOSUM scores was used to predict and understand the surface gene variants among hepatitis B virus carriers[15] and T-cell epitopes.[16]

Surface gene variants among hepatitis B virus carriers[edit]

DNA sequences of HBsAg were obtained from 180 patients, in which 51 were chronic HBV carrier and 129 newly diagnosed patients, and compared with consensus sequences built with 168 HBV sequences imported from GenBank. Literature review and BLOSUM scores were used to define potentially altered antigenicity.[15]

Reliable prediction of T-cell epitopes[edit]

A novel input representation has been developed consisting of a combination of sparse encoding, Blosum encoding, and input derived from hidden Markov models. this method predicts T-cell epitopes for the genome of hepatitis C virus and discuss possible applications of the prediction method to guide the process of rational vaccine design.[16]

Use in BLAST[edit]

BLOSUM matrices are also used as a scoring matrix when comparing DNA sequences or protein sequences to judge the quality of the alignment. This form of scoring system is utilized by a wide range of alignment software including BLAST.[17]

Comparing PAM and BLOSUM[edit]

In addition to BLOSUM matrices, another more recently developed scoring matrix can be used. This is known as a PAM. The two result in the same scoring outcome, but use differing methodologies. BLOSUM directly look at mutations in motifs of related sequences while PAM's extrapolate evolutionary information based on closely related sequences.[1]

Since both PAM and BLOSUM are different methods for showing the same scoring information, the two can be compared but due to the very different method of obtaining this score, a PAM100 does not equal a BLOSUM100.[18]

PAM BLOSUM
PAM100 BLOSUM90
PAM120 BLOSUM80
PAM160 BLOSUM60
PAM200 BLOSUM52
PAM250 BLOSUM45
The relationship between PAM and BLOSUM[edit]
PAM BLOSUM
To compare the closely related sequences, PAM matrices with lower numbers are created. To compare the closely related sequences, BLOSUM matrices with higher numbers are created.
To compare the distantly related proteins, PAM matrices with high numbers are created. To compare the distantly related proteins, BLOSUM matrices with low numbers are created.
The differences between PAM and BLOSUM[edit]
PAM BLOSUM
Based on global alignments of closely related proteins. based on local alignments.
PAM1 is the matrix calculated from comparisons of sequences with no more than 1% divergence. BLOSUM 62 is a matrix calculated from comparisons of sequences with no more than 62% identical.
Other PAM matrices are extrapolated from PAM1. Based on observed alignments; they are not extrapolated from comparisons of closely related proteins.
Higher numbers in matrices naming scheme denote larger evolutionary distance. Larger numbers in matrices naming scheme denote higher sequence similarity and therefore smaller evolutionary distance.[19]

See also[edit]

References[edit]

  1. ^ a b c d e f Henikoff, S.; Henikoff, J.G. (1992). "Amino Acid Substitution Matrices from Protein Blocks". PNAS 89 (22): 10915–10919. doi:10.1073/pnas.89.22.10915. PMC 50453. PMID 1438297. 
  2. ^ a b Campbell NA, Reece JB, Meyers N; Urry LA; Cain ML; Wasserman SA; Minorsky PV; Jackson RB (2009). "The Molecular Basis of Inheritance". Biology: Australian Version (8th ed.). Pearson Education Australia. pp. 307–325. ISBN 9781442502215. 
  3. ^ a b c Campbell NA, Reece JB, Meyers N; Urry LA; Cain ML; Wasserman SA; Minorsky PV; Jackson RB (2009). "From Gene to Protein". Biology: Australian Version (8th ed.). Pearson Education Australia. pp. 327–350. ISBN 9781442502215. 
  4. ^ Pal JK, Ghaskadbi SS (2009). "DNA Damage, Repair and Recombination". Fundamentals of Molecular Biology (1st ed.). Oxford University Press. pp. 187–203. ISBN 9780195697810. 
  5. ^ a b c Campbell NA, Reece JB, Meyers N; Urry LA; Cain ML; Wasserman SA; Minorsky PV; Jackson RB (2009). "The Structure and Function of Large Biological Molecules". Biology: Australian Version (8th ed.). Pearson Education Australia. pp. 68–89. ISBN 9781442502215. 
  6. ^ Lobo, Ingrid (2008). "Mendelian Ratios and Lethal Genes". Nature (Nature Publishing Group). Retrieved 19 October 2013. 
  7. ^ a b c pertsemlidis A.; Fondon JW.3rd (September 2001). "Having a BLAST with bioinformatics (and avoiding BLASTphemy)". genome biology 2: reviews2002.1–2002.10. PMID 11597340. 
  8. ^ "BLOSSUM MATRICES: Introduction to BIOINFORMATICS". UNIVERSITI TEKNOLOGI MALAYSIA. 2009. Retrieved 9 September 2014. 
  9. ^ Murali Sivaramakrishnan, Ognjen Perisic,, Shashi Ranjan. "CS#594 - Group 13 (Tools and softwares)". University of Illinois at Chicago - UIC. Retrieved 9 September 2014. 
  10. ^ Margaret O., Dayhoff (1978). "22". Atlas of Protein Sequence and Structure 5. Washington DC: National Biomedical Research Foundation. pp. 345–352. 
  11. ^ States DJ.; Gish W.; Altschul SF. (1991). "Improved sensitivity of nucleic acid database searches using application-specific scoring matrices.". Methods: A Companion to Methods in Enzymology 3: 66–70. ISSN 1046-2023. 
  12. ^ Albert Y. Zomaya (2006). Handbook of Nature-Inspired And Innovative Computing. New York, NY: Springer. ISBN 0-387-40532-1. page 673
  13. ^ NIH "Scoring Systems"
  14. ^ a b Mark P Styczynski; Kyle L Jensen; Isidore Rigoutsos; Gregory Stephanopoulos (2008). "BLOSUM62 miscalculations improve search performance". Nat. Biotech. 26 (3): 274–275. doi:10.1038/nbt0308-274. PMID 18327232. 
  15. ^ a b Roque-Afonso AM,Ferey MP,Ly TD. (2007). "Viral and clinical factors associated with surface gene variants among hepatitis B virus carriers.". Antivir Ther 12 (8): 1255–1263. PMID 18240865. 
  16. ^ a b Nielsen M, Lundegaard C, Worning P, et al. (2003). "Reliable prediction of T‐cell epitopes using neural networks with novel sequence representations". Protein Science 12 (5): 1007–1017. 
  17. ^ "The Statistics of Sequence Similarity Scores". National Centre for Biotechnology Information. Retrieved 20 October 2013. 
  18. ^ Saud, Omama (2009). "PAM and BLOSSUM SUBSITUTION MATRICES". Birec. Retrieved 20 October 2013. 
  19. ^ "The art of aligning protein sequences Part 1 Matrices". Dai hoc Can Tho - Can Tho University. Retrieved 7 September 2014. 

External links[edit]