Efficient sampling of protein conformational space using fast loop building and batch minimization on highly parallel computers.
|Title||Efficient sampling of protein conformational space using fast loop building and batch minimization on highly parallel computers.|
|Publication Type||Journal Article|
|Year of Publication||2012|
|Authors||Tyka, M. D., Jung K., & Baker D.|
|Journal||Journal of computational chemistry|
|Date Published||2012 Dec 5|
All-atom sampling is a critical and compute-intensive end stage to protein structural modeling. Because of the vast size and extreme ruggedness of conformational space, even close to the native structure, the high-resolution sampling problem is almost as difficult as predicting the rough fold of a protein. Here, we present a combination of new algorithms that considerably speed up the exploration of very rugged conformational landscapes and are capable of finding heretofore hidden low-energy states. The algorithm is based on a hierarchical workflow and can be parallelized on supercomputers with up to 128,000 compute cores with near perfect efficiency. Such scaling behavior is notable, as with Moore's law continuing only in the number of cores per chip, parallelizability is a critical property of new algorithms. Using the enhanced sampling power, we have uncovered previously invisible deficiencies in the Rosetta force field and created an extensive decoy training set for optimizing and testing force fields. © 2012 Wiley Periodicals, Inc.
|Alternate Journal||J Comput Chem|