All-atom de novo protein folding with a scalable evolutionary algorithm

11Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The search for efficient and predictive methods to describe the protein folding process at the all-atom level remains an important grand-computational challenge. The development of multi-teraflop architectures, such as the IBM BlueGene used in this study, has been motivated in part by the large computational requirements of such studies. Here we report the predictive all-atom folding of the forty-amino acid HIV accessory protein using an evolutionary stochastic optimization technique. We implemented the optimization method as a master-client model on an IBM BlueGene, where the algorithm scales near perfectly from 64 to 4096 processors in virtual processor mode. Starting from a completely extended conformation, we optimize a population of 64 conformations of the protein in our all-atom free-energy model PFF01. Using 2048 processors the algorithm predictively folds the protein to a nearnative conformation with an RMS deviation of 3.43 Å in <24 h. © 2007 Wiley Periodicals, Inc.

Cite

CITATION STYLE

APA

Verma, A., Gopal, S. M., Oh, J. S., Lee, K. H., & Wenzel, W. (2007). All-atom de novo protein folding with a scalable evolutionary algorithm. Journal of Computational Chemistry, 28(16), 2552–2558. https://doi.org/10.1002/jcc.20750

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free