scholarly journals A memetic algorithm enables global all-atom protein-protein docking with sidechain flexibility

2021 ◽  
Author(s):  
Daniel Varela ◽  
Ingemar André

ABSTRACTProtein-protein docking plays a central role in the characterization and discovery of protein interactions in the cell. Complex formation is encoded by specific interactions at the atomic scale, but the computational cost of modeling proteins at this level often requires the use of simplified energy models, coarse-grained protein descriptions and rigid-body approximations. In this study we present EvoDOCK, which is an evolutionary-based docking algorithm that enables the identification of optimal docking orientations using an atomistic energy function and sidechain flexibility, employing a global search without prior information of the binding site. EvoDOCK is a memetic algorithm that combines the strength of a differential evolution algorithm for efficient exploration of the global search space with the benefits of a local optimization method, built on the Monte Carlo-based RosettaDOCK program, to optimize detailed atomic interactions. This approach resulted in substantial improvements in both sampling efficiency and computation speed compared to calculations using the local optimization method RosettaDOCK alone, with up to 35 times of reduction in computational cost. For all the ten systems investigated in this study, a highly accurate docking prediction could be identified as the lowest energy model with high efficiency. While protein-protein docking with EvoDOCK is still computationally expensive compared to many methods based on Fast Fourier Transforms (FFT), the results demonstrate the tractability of global docking proteins using an atomistic energy function while exploring sidechain flexibility. Comparison with FFT global docking demonstrated the benefits of using an all-atom energy function to identify native-like predictions. The sampling strategy in EvoDOCK can readily be tailored to include backbone flexibility in the search, which is often necessary to tackle more challenging docking challenges.

SPE Journal ◽  
2014 ◽  
Vol 19 (05) ◽  
pp. 891-908 ◽  
Author(s):  
Obiajulu J. Isebor ◽  
David Echeverría Ciaurri ◽  
Louis J. Durlofsky

Summary The optimization of general oilfield development problems is considered. Techniques are presented to simultaneously determine the optimal number and type of new wells, the sequence in which they should be drilled, and their corresponding locations and (time-varying) controls. The optimization is posed as a mixed-integer nonlinear programming (MINLP) problem and involves categorical, integer-valued, and real-valued variables. The formulation handles bound, linear, and nonlinear constraints, with the latter treated with filter-based techniques. Noninvasive derivative-free approaches are applied for the optimizations. Methods considered include branch and bound (B&B), a rigorous global-search procedure that requires the relaxation of the categorical variables; mesh adaptive direct search (MADS), a local pattern-search method; particle swarm optimization (PSO), a heuristic global-search method; and a PSO-MADS hybrid. Four example cases involving channelized-reservoir models are presented. The recently developed PSO-MADS hybrid is shown to consistently outperform the standalone MADS and PSO procedures. In the two cases in which B&B is applied, the heuristic PSO-MADS approach is shown to give comparable solutions but at a much lower computational cost. This is significant because B&B provides a systematic search in the categorical variables. We conclude that, although it is demanding in terms of computation, the methodology presented here, with PSO-MADS as the core optimization method, appears to be applicable for realistic reservoir development and management.


2011 ◽  
Vol 2011 (0) ◽  
pp. _1A1-M13_1-_1A1-M13_2
Author(s):  
Shota INABA ◽  
Masashi FURUKAWA ◽  
Keiko YUKAWA ◽  
Masahiro KINOSHITA ◽  
Takashi KAWAKAMI

2016 ◽  
Vol 32 (2) ◽  
pp. 123-129
Author(s):  
J.-I. Kim ◽  
K. Eom ◽  
S. Na

AbstractThe conformational (structural) change of proteins plays an essential role in their functions. Experiments have been conducted to try to understand the conformational change of proteins, but they have not been successful in providing information on the atomic scale. Simulation methods have been developed to understand the conformational change at an atomic scale in detail. Coarse-grained methods have been developed to calculate protein dynamics with computational efficiency when compared with than all-atom models. A structure-based mass-spring model called the elastic network model (ENM) showed excellent performance in various protein studies. Coarse-grained ENM was modified in various ways to improve the computational efficiency, and consequently to reduce required computational cost for studying the large-scale protein structures. Our previous studies report a modified mass-spring model, which was developed based on condensation method applicable to ENM, and show that the model is able to accurately predict the fluctuation behavior of proteins. We applied this modified mass-spring model to analyze the conformational changes in proteins. We consider two model proteins as an example, where these two proteins exhibit different functions and molecular sizes. It is shown that the modified mass-spring model allows for accurately predicting the pathways of conformation changes for proteins. Our model provides structural insights into the conformation change of proteins related to the biological functions of large protein complexes.


2011 ◽  
Vol 2011 (0) ◽  
pp. 83-84
Author(s):  
Takashi KAWAKAMI ◽  
Shota INABA ◽  
Keiko YUKAWA ◽  
Masahiro KINOSHITA

2005 ◽  
Vol 32 (2) ◽  
pp. 161-179 ◽  
Author(s):  
Adil M. Bagirov ◽  
Alexander M. Rubinov ◽  
Jiapu Zhang

Sign in / Sign up

Export Citation Format

Share Document