Amino acid substitution matrices from protein blocks.

  title={Amino acid substitution matrices from protein blocks.},
  author={Steven Henikoff and Jorja G. Henikoff},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  volume={89 22},
  • S. Henikoff, J. Henikoff
  • Published 15 November 1992
  • Biology
  • Proceedings of the National Academy of Sciences of the United States of America
Methods for alignment of protein sequences typically measure similarity by using a substitution matrix with scores for all possible exchanges of one amino acid with another. [] Key Result This led to marked improvements in alignments and in searches using queries from each of the groups.

Figures from this paper

Scores for sequence searches and alignments.

  • S. Henikoff
  • Biology
    Current opinion in structural biology
  • 1996

Protein database searches using compositionally adjusted substitution matrices

This work has recently developed a general procedure for transforming a standard matrix into one appropriate for the comparison of two sequences with arbitrary, and possibly differing compositions.

Using BLOSUM in Sequence Alignments.

The blocks amino acid substitution matrices (BLOSUM) scoring matrices were created and how they can best be used.

Structure-derived substitution matrices for alignment of distantly related sequences.

It is found that the structure-derived matrices based on superimpositions from protein pairs of similar structure, but of low or no sequence similarity are applicable for comparisons of distantly related sequences.

The construction of amino acid substitution matrices for the comparison of proteins with non-standard compositions

The mathematical details underlying the compositional adjustment of amino acid or DNA substitution matrices are presented, including the rationale for transforming a standard matrix for use in a non-standard compositional context.

An Amino Acid Substitution Matrix for Protein Conformation Identification

A conformation-specific amino acid substitution matrix CBSM60 is derived from a database of sequence-conformation blocks which explicitly represent sequence-structure relationship and shows an improved performance in conformational segment search and homolog detection.

A Transition Probability Model for Amino Acid Substitutions from Blocks

The PMB (Probability Matrix from Blocks) defines a new evolutionary model for protein evolution that can be used for evolutionary analyses of protein sequences and is directly derived from, and thus compatible with, the BLOSUM matrices.

Three dimensional representation of amino acid characteristics

  • O. U. SezermanR. IslamajEthem Alpaydin
  • Biology, Computer Science
    2001 Conference Proceedings of the 23rd Annual International Conference of the IEEE Engineering in Medicine and Biology Society
  • 2001
Three dimensional representations of amino acids substitution matrices based on the Dayhoff model of evolutionary substitution rates are obtained while preserving most of the information obtained in the matrices.

Hubsm: A Novel Amino Acid Substitution Matrix for Comparing Hub Proteins

A new amino acid substitution matrix is calculated for the disorder and low complexity rich region of Hub proteins, based on residue characteristics, which unveils the  residue substitution patterns which differs from commonly used scoring matrices.

25 Protein Multiple Sequence Alignment

In this chapter, state-of-the-art protein sequence alignment tools are reviewed and practical advice for users of alignment tools is provided.



Finding sequence motifs in groups of functionally related proteins.

The automated method successfully finds and displays nearly all of the sequence motifs that have been previously reported to occur in 33 reverse transcriptases, 18 DNA integrases, and 30 DNA methyltransferases.

A tool for multiple sequence alignment.

The design and application of a tool for multiple alignment of amino acid sequences that implements a new algorithm that greatly reduces the computational demands of dynamic programming is described.

The rapid generation of mutation data matrices from protein sequences

An efficient means for generating mutation data matrices from large numbers of protein sequences is presented, by means of an approximate peptide-based sequence comparison algorithm, which is fast enough to process the entire SWISS-PROT databank in 20 h on a Sun SPARCstation 1, and is fastenough to generate a matrix from a specific family or class of proteins in minutes.

Exhaustive matching of the entire protein sequence database.

The alignments made possible by the exhaustive matching are the starting point for successful de novo prediction of the folded structures of proteins, for reconstructing sequences of ancient proteins and metabolisms in ancient organisms, and for obtaining new perspectives in structural biochemistry.

Automatic generation of primary sequence patterns from sets of related protein sequences.

  • R. F. SmithT. Smith
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 1990
A computer algorithm is developed that can extract the pattern of conserved primary sequence elements common to all members of a homologous protein family through clustering the pairwise similarity scores among a set of related sequences.

Multiple sequence alignment with hierarchical clustering.

  • F. Corpet
  • Computer Science
    Nucleic acids research
  • 1988
An algorithm is presented for the multiple alignment of sequences, either proteins or nucleic acids, that is both accurate and easy to use on microcomputers. The approach is based on the conventional