An alternative to the PAM matrix is BLOSUM (BLocks SUbstitution Matrix), which was derived by Henikoff and Henikoff in 1992. NCBI uses BLOSUM62 as its the default matrix for protein BLAST.
BLOSUM matrices are derived from comparisons of blocks of sequences from the Blocks database.
A block is an ungapped multiple alignments of highly conserved, short regions. Here is what a sample block looks like:
The blocks database contains multiple alignments of conserved regions in protein families.
The Henikoffs developed a database of "blocks" based on sequences with shared motifs. More than 2,000 blocks of aligned sequence segments were analyzed from more than 500 groups of related proteins. Within each block, they counted the relative frequencies of amino acids and their substitution probabilities
The Henikoffs used blocks due to several reasons:
A BLOSUM tells us the likelihood of occurrence of each pairwise substitution, and we can use these values to score a pairwise comparison.
Each scoring matrix is constructed based on how identical the ungapped multiple sequence alignments are. For example, BLOSUM62 is derived from blocks containing at most 62% identity in the ungapped sequence aligments.
Here we'll show you how to calculate a BLOSUM.
Before we start constructing a matrix BLOSUM r, we have to eliminate the sequences that are more than r% identical. This solves us from the bias we get from databases over-representing certain classes of proteins. To do this, we have two options:
ACD DCE DCE DCE BCE BCD ACB
Since most databases today have an over-representation of proteins, the extraneous DCE sequences should be eliminated in order to make our database more representative.
Thus, after elminating redundancies, we look at the first vertical column in our block:
A D B B A
Let's find out how many possible pairwise combinations we can see for each possible pair.
For the AA pair, we have 2 possible combinations, for AB or BA we have 4. For AD we have 2. We continue these calculations until the occurrence of all possible pairs are found.
|Pair||Column 1 score||Column 2 score||Column 3 score||Total|
|AB or BA||4||0||0||4|
|AD or DA||2||0||0||2|
|BD or DB||2||0||2||4|
|DE or ED||0||0||4||4|
Note that the total sum is 26, which we can use to normalize our matrix.
To obtain integer values for our scoring matrix, we need to find the score per cell. We can do this with the following equation:
Where qij is observed frequency and eij is the expected frequency.
cij is the cell value as calculated above.
To calculate the Total T:
Where w is the number of columns and n is the number of sequences. With T, we can calculate qij, which is the rate of change of residue i to residue j.
In our case, T = 30, so let's divide all our cells by 30.
Now pi can be found with the following equation:
The expected frequencies:
Notice how I didn't calculate cell values that had a value of 0 - you'll see that we don't need these values in the actual scoring matrix.
Now we have all we need! Just plug in values from the two matrices above into the equation below to obtain our scoring matrix.
To obtain scores, we multiple sij by two and round.
If you're looking for a fun and easy entry point into bioinformatics algorithms, this book it just for you! Filled with graphics, and written in a light-hearted and humorous story-telling persona, Bioinformatics Algorithms guides you through the intricacies of the problems faced in biology, and the clever solutions used to solve them.$ Check price
Command Line Kung Fu is packed with dozens of tips and practical real-world examples. You won't find theoretical examples in this book. The examples demonstrate how to solve actual problems. The tactics are easy to find, too. Each chapter covers a specific topic and groups related tips and examples together.$ Check price