๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for packing regular multistrand polypeptide structures by energy minimization

โœ Scribed by Kenneth D. Gibson; Harold A. Scheraga


Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
1008 KB
Volume
15
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

โœฆ Synopsis


An algorithm has been developed for packing polypeptide chains by energy minimization subject to regularity conditions, in which regularity is maintained without the addition of pseudoenergy terms by defining the energy as a function of appropriately chosen independent variables. The gradient of the energy with respect to the independent variables is calculated analytically. The speed and efficiency of convergence of the algorithm to a local energy minimum are comparable to those of existing algorithms for minimizing the energy of a single polypeptide chain. The algorithm has been used to reinvestigate the minimum-energy regular structures of three-stranded (L-Ala),, three-stranded (L-Val), , five-stranded (L-Ile),, and the regular and truncated three-stranded (Gly-L-Pro-L-Pro), triple helices. Local minima with improved packing energies, but with essentially unchanged geometrical properties, were obtained in all cases. The algorithm was also used to reinvestigate the structures proposed previously for the I and I1 forms of crystalline silk fibroin. The silk I1 structure was reproduced with slightly improved packing and little other change. The orthorhombic silk I structure showed more change and considerably improved packing energy, but the new regular monoclinic silk I structure had considerably higher energy. The results support the structure proposed previously for silk I1 and the orthorhombic structure, but not the monoclinic structure proposed for silk I. 0 1994 by John Wiley & Sons, Inc. structures of fibrous proteins has lagged behind knowledge of globular protein structures. It has been necessary to call on model building and conformational energy computations to provide plausible structures for biologically important fibrous proteins such as collagen '-l" and In the case of both collagen and silk, understanding of


๐Ÿ“œ SIMILAR VOLUMES


A rapid and efficient algorithm for pack
โœ Kenneth D. Gibson; Harold A. Scheraga ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 841 KB

An improved algorithm for packing polypeptide chains with fixed geometry, which converges to a local energy minimum rapidly and efficiently, is described. The speed of convergence of the new algorithm is comparable to that of existing algorithms for minimizing the energies of single polypeptide chai