𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimization of polypeptide energy: X. A global search algorithm

✍ Scribed by G.M. Crippen; H.A. Scheraga


Book ID
115701063
Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
802 KB
Volume
144
Category
Article
ISSN
0003-9861

No coin nor oath required. For personal study only.


πŸ“œ 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

An algorithm for packing regular multist
✍ Kenneth D. Gibson; Harold A. Scheraga πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 1008 KB

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

Monte Carlo sampling algorithm for searc
✍ Hideaki Nakamura πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 131 KB

## Abstract A Monte Carlo sampling algorithm for searching a scale‐transformed conformational energy space of polypeptides is presented. This algorithm is based on the assumption that energy barriers can be overcome by a uniform sampling of the logarithmically transformed energy space. This algorit