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

Protein folding simulations with genetic algorithms and a detailed molecular description

โœ Scribed by Jan T. Pedersen; John Moult


Book ID
115627913
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
625 KB
Volume
269
Category
Article
ISSN
0022-2836

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Protein folding simulation with genetic
โœ Yan Cui; Run Sheng Chen; Wing Hung Wong ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 225 KB ๐Ÿ‘ 2 views

We describe an algorithm to compute native structures of proteins from their primary sequences. The novel aspects of this method are: 1) The hydrophobic potential was set to be proportional to the nonpolar solvent accessible surface. To make computation feasible, we developed a new algorithm to comp

Ab initio protein folding simulations wi
โœ Pedersen, Jan T.; Moult, John ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 237 KB ๐Ÿ‘ 2 views

Ab-initio folding simulations have been performed on three small proteins using a genetic algorithm-(GA-) based search method which operates on an all atom representation. Simulations were also performed on a number of small peptides expected to be independent folding units. The present genetic algo

Use of a novel Hill-climbing genetic alg
โœ Lee R Cooper; David W Corne; M.James C Crabbe ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

We have developed a novel Hill-climbing genetic algorithm (GA) for simulation of protein folding. The program (written in C) builds a set of Cartesian points to represent an unfolded polypeptide's backbone. The dihedral angles determining the chain's configuration are stored in an array of chromosom