โ Scribed by David De Sancho; Lidia Prieto; Ana M. Rubio; Antonio Rey
No coin nor oath required. For personal study only.
Genetic algorithms constitute a powerful optimization method that has already been used in the study of the protein folding problem. However, they often suffer from a lack of convergence in a reasonably short time for complex fitness functions. Here, we propose an evolutionary strategy that can reproducibly find structures close to the minimum of a potential function for a simplified protein model in an efficient way. The model reduces the number of degrees of freedom of the system by treating the protein structure as composed of rigid fragments. The search incorporates a double encoding procedure and a merging operation from subpopulations that evolve independently of one another, both contributing to the good performance of the full algorithm. We have tested it with protein structures of different degrees of complexity, and present our conclusions related to its possible application as an efficient tool for the analysis of folding potentials. ยฉ 2004 Wiley Periodicals, Inc. J Comput Chem 26: 131โ141, 2005
๐ SIMILAR VOLUMES
We have developed a generic evolutionary method with an empirical scoring function for the protein-ligand docking, which is a problem of paramount importance in structure-based drug design. This approach, referred to as the GEMDOCK (Generic Evolutionary Method for molecular DOCKing), combines both c
This paper presents the development of the rigid block version of discontinuous deformation analysis and its preliminary application in rockfall simulation. Modiยฎcations, including the reduction of the error due to large rigid body rotation by using post-correction at each time step of calculation a