This page is also available in: 日本語

URL: /showBlogPost?PID=720

[About ASH]

ASH (Alignment of Structural Homologs) is a structure alignment program that has been developed for PDBj. Earlier versions of ASH were written by Hiroyuki Toh[1]. The core alignment algorithm based on the double dynamic programming algorithm of Orengo and Taylor[2] was then combined with a new scoring function based on NER (Number of Equivalent Residues) by Daron M. Standley[3,4]. The ASH web page serves as a central portal where both web services and source code can be accessed.

The Toh Lab at Kyushu University provides tools described below:

  • mapping functional information from alignments
  • original version ASH (local)
  • original version ASH (global)

[ASH similarity score]

The ASH similarity score uses several heuristics to determine if two structures belong to the same structural domain. The derivation of the ASH score has been described in detail in an open-access article, so we will only give an overview here.

The ASH similarity score consists of five terms:

1. The Number of Equivalent Residues ( NER ) is a reward for C-alpha atoms that can be superimposed in space

2. A sequence similarity term that is derived from a large set of sequence-unique domains aligned by ASH

3. The C-alpha RMSD scored by the number of aligned residues (also known as the SAS score) is a penalty for C-alpha atoms that can not be superimposed

4. A gap penalty of non-terminal gaps

5. An overall difference term that does not depend on the alignment or superposition but instead looks at the secondary structure content, length, size, and contact order of the two structures

The weights of these five terms has been optimized for recognizing domains that belong to the same SCOP fold or CATH topology.

[RASH]

RASH (Rapid ASH) computes pair-wise alignments in under 1 second. RASH is generally sufficient if the structures are very similar.

[GASH]

GASH (Genetic-algorithm ASH) generates very accurate alignments in about twice the time as RASH. GASH is the best choice if the structures are only partially similar or if multiple solutions are required.

[References]

  1. Toh, H. (1997) Introduction of a distance cut-off into structural alignment by the double dynamic programming algorithm. Comput Appl Biosci 13, 387-96.
  2. Orengo, C.A. and Thornton, J.M. (2005) Protein families and their evolution-a structural perspective. Annu Rev Biochem 74, 867-900.
  3. Standley, D.M., Toh, H. and Nakamura, H. (2004) Detecting local structural similarity in proteins by maximizing number of equivalent residues. Proteins 57, 381-91.
  4. Standley, D.M., Toh, H. and Nakamura, H. (2005) GASH: an improved algorithm for maximizing the number of equivalent residues between two protein structures. BMC Bioinformatics 6, 221.
2012-07-11 (last edited: 11 months ago)2016-07-06
PDBj@FacebookPDBj@TwitterwwPDBwwPDB FoundationEM DataBank

Copyright © 2013-2017 Protein Data Bank Japan