A rapid and efficient algorithm for packing polypeptide chains by energy minimization

✍ Scribed by Kenneth D. Gibson; Harold A. Scheraga

• Publisher: John Wiley and Sons
• Year: 1994
• Tongue: English
• Weight: 841 KB
• Volume: 15
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/jcc.540151210

✦ Synopsis

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 chains, and it is several times greater than the speed of convergence of previous algorithms for minimizing the energy of structures consisting of several polypeptide chains. The algorithm has been used to minimize the energy of three-stranded (L-Ala), P-sheets, three-stranded (L-Val), psheets, and five-stranded (~-Ile), psheets, starting from regular structures found previously; of the three-stranded regular and truncated (Gly-L-Pro-L-Pro), structures used in earlier work to model collagen; and of the stacked P-sheet (L-Ala-GLy), structures used to model silk. The antiparallel L-Ala psheet, and Gly-Pro-Pro triple helices, and the silk I1 structure remained nearly regular after energy minimization, but by contrast with results from earlier computations the other structures became significantly irregular.