Cite as: Cold Spring Harb. Protoc.; 2008; doi:10.1101/pdb.top39

This Protocol
Right arrow Full Text
Right arrow Update/discuss this protocolDiscussion icon
Right arrow Alert me when this protocol is cited
Right arrow Alert me when comments are published
Right arrow Alert me if a correction is posted
Services
Right arrow Similar protocols in this database
Right arrow Alert me to new releases of protocols
Right arrow Save to Personal Folders
Right arrow Download to citation manager
Right arrow Printer-friendly versionPrinter-friendly version
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Mount, D. W.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Mount, D. W.
Related Collections
Right arrow Bioinformatics/Genomics, general
Right arrow Alignment of Sequences
Right arrow Alignment of Pairs of Sequences
Right arrow Computational Biology
Right arrow Genetics, general
Right arrow Proteins and Proteomics, general
Right arrow Proteomics
Right arrow Evolution
Right arrow Genome Analysis
Right arrowRelated Articles
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?
BSN globe

topic_introductionTopic Introduction

Using BLOSUM in Sequence Alignments

David W. Mount

Adapted from "Alignment of Pairs of Sequences," Chapter 3, in Bioinformatics: Sequence and Genome Analysis, 2nd edition, by David W. Mount. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY, USA, 2004.


INTRODUCTION

The original Dayhoff percent accepted mutation (PAM) matrices were developed based on a small number of protein sequences and an evolutionary model of protein change. By extrapolating from the observed changes at small evolutionary distances to large ones, it was possible to establish a PAM250 scoring matrix for sequences that were highly divergent. Another approach to finding a scoring matrix for divergent sequences is to start with a more divergent set of sequences and produce a scoring matrix from the substitutions found in those less-related sequences. The blocks amino acid substitution matrices (BLOSUM) scoring matrices were prepared this way. This article explains how BLOSUM scoring matrices were created and how they can best be used.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?

Related Articles

A Test of the Markov Model of Evolution in Proteins
David W. Mount
CSH Protocols 2008: 58. [Abstract] [Full Text]

Comparison of the PAM and BLOSUM Amino Acid Substitution Matrices
David W. Mount
CSH Protocols 2008: 59. [Abstract] [Full Text]

Studies of Varying Alignment Algorithm, Amino Acid Scoring Matrix, and Gap Penalties
David W. Mount
CSH Protocols 2008: 60. [Abstract] [Full Text]

Using PAM Matrices in Sequence Alignments
David W. Mount
CSH Protocols 2008: 38. [Abstract] [Full Text]

Using Gaps and Gap Penalties to Optimize Pairwise Sequence Alignments
David W. Mount
CSH Protocols 2008: 40. [Abstract] [Full Text]



This article has been cited by other articles:


Home page
 CSH ProtocolsHome page
D. W. Mount
A Test of the Markov Model of Evolution in Proteins
CSH Protocols, June 1, 2008; 2008(7): pdb.ip58 - pdb.ip58.
[Abstract] [Full Text]

Home page
 CSH ProtocolsHome page
D. W. Mount
Comparison of the PAM and BLOSUM Amino Acid Substitution Matrices
CSH Protocols, June 1, 2008; 2008(7): pdb.ip59 - pdb.ip59.
[Abstract] [Full Text]

Home page
 CSH ProtocolsHome page
D. W. Mount
Using Gaps and Gap Penalties to Optimize Pairwise Sequence Alignments
CSH Protocols, June 1, 2008; 2008(7): pdb.top40 - pdb.top40.
[Abstract] [Full Text]