Introduction of a distance cut-off into structural alignment by the double dynamic programming algorithm
- PMID: 9283753
- DOI: 10.1093/bioinformatics/13.4.387
Introduction of a distance cut-off into structural alignment by the double dynamic programming algorithm
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.
Similar articles
-
Adaptive Smith-Waterman residue match seeding for protein structural alignment.Proteins. 2013 Oct;81(10):1823-39. doi: 10.1002/prot.24327. Epub 2013 Aug 19. Proteins. 2013. PMID: 23720362
-
Optimal pairwise alignment of fixed protein structures in subquadratic time.J Bioinform Comput Biol. 2011 Jun;9(3):367-82. doi: 10.1142/s0219720011005562. J Bioinform Comput Biol. 2011. PMID: 21714130
-
Robust sequence alignment using evolutionary rates coupled with an amino acid substitution matrix.BMC Bioinformatics. 2015 Aug 14;16:255. doi: 10.1186/s12859-015-0688-8. BMC Bioinformatics. 2015. PMID: 26269100 Free PMC article.
-
Identifying distantly related protein sequences.Comput Appl Biosci. 1997 Aug;13(4):325-32. doi: 10.1093/bioinformatics/13.4.325. Comput Appl Biosci. 1997. PMID: 9283747 Review. No abstract available.
-
A systematic approach to dynamic programming in bioinformatics.Bioinformatics. 2000 Aug;16(8):665-77. doi: 10.1093/bioinformatics/16.8.665. Bioinformatics. 2000. PMID: 11099253 Review.
Cited by
-
GASH: an improved algorithm for maximizing the number of equivalent residues between two protein structures.BMC Bioinformatics. 2005 Sep 8;6:221. doi: 10.1186/1471-2105-6-221. BMC Bioinformatics. 2005. PMID: 16146579 Free PMC article.
-
CORA--topological fingerprints for protein structural families.Protein Sci. 1999 Apr;8(4):699-715. doi: 10.1110/ps.8.4.699. Protein Sci. 1999. PMID: 10211816 Free PMC article.