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.
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 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