Literature DB >> 9283753

Introduction of a distance cut-off into structural alignment by the double dynamic programming algorithm.

H Toh1.   

Abstract

Two approximations were introduced into the double dynamic programming algorithm, in order to reduce the computational time for structural alignment. One of them was the so-called distance cut-off, which approximately describes the structural environment of each residue by its local environment. In the approximation, a sphere with a given radius is placed at the center of the side chain of each residue. The local environment of a residue is constituted only by the residues with side chain centers that are present within the sphere, which is expressed by a set of center-to-center distances from the side chain of the residue to those of all the other constituent residues. The residues outside the sphere are neglected from the local environment. Another approximation is associated with the distance cut-off, which is referred to here as the delta N cut-off. If two local environments are similar to each other, the numbers of residues constituting the environments are expected to be similar. The delta N cut-off was introduced based on the idea. If the difference between the numbers of the constituent residues of two local environments is greater than a given threshold value, delta N, the evaluation of the similarity between the local environments is skipped. The introduction of the two approximations dramatically reduced the computational time for structural alignment by the double dynamic programming algorithm. However, the approximations also decreased the accuracy of the alignment. To improve the accuracy with the approximations, a program with a two-step alignment algorithm was constructed. At first, an alignment was roughly constructed with the approximations. Then, the epsilon-suboptimal region for the alignment was determined. Finally, the double dynamic programming algorithm with full structural environments was applied to the residue pairs within the epsilon-suboptimal region to produce an improved alignment.

Mesh:

Substances:

Year:  1997        PMID: 9283753     DOI: 10.1093/bioinformatics/13.4.387

Source DB:  PubMed          Journal:  Comput Appl Biosci        ISSN: 0266-7061


  2 in total

1.  CORA--topological fingerprints for protein structural families.

Authors:  C A Orengo
Journal:  Protein Sci       Date:  1999-04       Impact factor: 6.725

2.  GASH: an improved algorithm for maximizing the number of equivalent residues between two protein structures.

Authors:  Daron M Standley; Hiroyuki Toh; Haruki Nakamura
Journal:  BMC Bioinformatics       Date:  2005-09-08       Impact factor: 3.169

  2 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.