A reliable prediction of 3D protein structures from sequence data remains a big challenge due to both theoretical and computational difficulties. We have previously shown that our kinetostatic compliance method (KCM) implemented into the Protofold package can overcome some of the key difficulties faced by other de novo structure prediction methods, such as the very small time steps required by the molecular dynamics (MD) approaches or the very large number of samples needed by the Monte Carlo (MC) sampling techniques. In this article, we improve the free energy formulation used in Protofold by including the typically underrated entropic effects, imparted due to differences in hydrophobicity of the chemical groups, which dominate the folding of most water-soluble proteins. In addition to the model enhancement, we revisit the numerical implementation by redesigning the algorithms and introducing efficient data structures that reduce the expected complexity from quadratic to linear. Moreover, we develop and optimize parallel implementations of the algorithms on both central and graphics processing units (CPU GPU) achieving speed-ups up to two orders of magnitude on the GPU. Our simulations are consistent with the general behavior observed in the folding process in aqueous solvent, confirming the effectiveness of model improvements. We report on the folding process at multiple levels; namely, the formation of secondary structural elements and tertiary interactions between secondary elements or across larger domains. We also observe significant enhancements in running times that make the folding simulation tractable for large molecules.
The inclusion of the solvation free energy computed using an adequately accurate evaluation of the SASA @cite_74 @cite_65 results in a more realistic energy- and force-model for simulating the natural behavior of water-soluble proteins.
@cite_65 @cite_74
2115247521 2024844609 2048171823 2257563257
A realistic computer simulation of protein folding requires a comprehensive account of interaction energetics, placing a substantial demand on processing power. This paper presents an improved computational framework for protein folding software package PROTOFOLD, that enables efficient computation of solvation free energy effects in addition to Coulombic and van der Waals interactions. Efficient data structures have been utilized to speed-up the sequential running times from O(n2) to O(n), n being the number of atoms. It turns out, however, that an accurate evaluation of molecular surface areas characterizing the solvation effects imposes a computational bottleneck to the entire simulation. Massive computational power offered by Graphics Processing Units (GPU) was exploited to develop a simple and efficient Single-Instruction Multiple-Thread (SIMT) algorithm for the latter step. The running times were monitored for different steps of the folding simulation for different molecular sizes. Significant performance improvements were observed, yielding promising results where numerous iterative runs are needed.© 2013 ASME We report the predictive all-atom folding of the 60 amino acid four-helix bacterial ribosomal protein (BRP) L20 with a stochastic evolutionary optimization method in a free-energy force field. The energetically best, as well as six of the 10 lowest conformations, converge to a near-native structure. All of the 10 best energy conformations share the secondary structure elements of the native conformation, but differ in their tertiary alignment. The best conformation has a backbone root-mean-square deviation of 4.6 A to the native conformation and reproduces most distance constraints of the NMR experiment to 1.5 A resolution. Starting from random initial conditions, the native content of the simulated population increases more than 60-fold in the course of the simulation. These data demonstrate the feasibility of predictive unbiased all-atom protein folding with present day computational resources for the BRP L20. Protein structure prediction remains one of the significant challenges in computational biology. We have previously shown that our kinetostatic compliance method can overcome some of the key difficulties faced by other de novo structural prediction methods, such as the very small time steps required by the molecular dynamics approaches, or the very large number of samples required by the sampling based techniques. In this paper we extend the previous free energy formulation by adding the solvent effects, which contribute predominantly to the folding phenomena. We show that the addition of the solvation effects, which complement the existing Coulombic and van der Waals interactions, lead to a physically effective energy function. Furthermore, we achieve significant computational speed-up by employing efficient algorithms and data structures that effectively reduce the time complexity from O(n2) to O(n), n being the number of atoms. Our simulations are consistent with the general behavior observed in protein folding, and show that the hydrophobic atoms tend to pack inside the core of the molecule in an aqueous solvent, while a vacuum environment produces no such effect.Copyright © 2013 by ASME Graphical abstractDisplay Omitted HighlightsGraded energy-model strategically mixes the 20×20 MJ potential matrix with 2×2 HP energy model.HP guided macro-mutation operator within GA provides efficient sampling.Proposed Algorithm outperformed other state-of-the-art approaches.Splits the energy function related complexities into two less complex functions through macro-mutation operator. Protein structure prediction is considered as one of the most challenging and computationally intractable combinatorial problem. Thus, the efficient modeling of convoluted search space, the clever use of energy functions, and more importantly, the use of effective sampling algorithms become crucial to address this problem. For protein structure modeling, an off-lattice model provides limited scopes to exercise and evaluate the algorithmic developments due to its astronomically large set of data-points. In contrast, an on-lattice model widens the scopes and permits studying the relatively larger proteins because of its finite set of data-points. In this work, we took the full advantage of an on-lattice model by using a face-centered-cube lattice that has the highest packing density with the maximum degree of freedom. We proposed a graded energy-strategically mixes the Miyazawa-Jernigan (MJ) energy with the hydrophobic-polar (HP) energy-based genetic algorithm (GA) for conformational search. In our application, we introduced a 2×2 HP energy guided macro-mutation operator within the GA to explore the best possible local changes exhaustively. Conversely, the 20×20 MJ energy model-the ultimate objective function of our GA that needs to be minimized-considers the impacts amongst the 20 different amino acids and allow searching the globally acceptable conformations. On a set of benchmark proteins, our proposed approach outperformed state-of-the-art approaches in terms of the free energy levels and the root-mean-square deviations.