scholarly journals GPathFinder: Identification of Ligand-Binding Pathways by a Multi-Objective Genetic Algorithm

2019 ◽  
Vol 20 (13) ◽  
pp. 3155 ◽  
Author(s):  
José-Emilio Sánchez-Aparicio ◽  
Giuseppe Sciortino ◽  
Daniel Viladrich Herrmannsdoerfer ◽  
Pablo Orenes Chueca ◽  
Jaime Rodríguez-Guerra Pedregal ◽  
...  
Keyword(s):  
Ligand Binding ◽  
Open Source Software ◽  
Computational Cost ◽  
Ligand Docking ◽  
Enzyme Design ◽  
Ligand Selectivity ◽  
Process Dynamics ◽  
Multi Objective Genetic Algorithm ◽  
Ligand Diffusion ◽  
Energy Pathways

Protein–ligand docking is a widely used method to generate solutions for the binding of a small molecule with its target in a short amount of time. However, these methods provide identification of physically sound protein–ligand complexes without a complete view of the binding process dynamics, which has been recognized to be a major discriminant in binding affinity and ligand selectivity. In this paper, a novel piece of open-source software to approach this problem is presented, called GPathFinder. It is built as an extension of the modular GaudiMM platform and is able to simulate ligand diffusion pathways at atomistic level. The method has been benchmarked on a set of 20 systems whose ligand-binding routes were studied by other computational tools or suggested from experimental “snapshots”. In all of this set, GPathFinder identifies those channels that were already reported in the literature. Interestingly, the low-energy pathways in some cases indicate novel possible binding routes. To show the usefulness of GPathFinder, the analysis of three case systems is reported. We believe that GPathFinder is a software solution with a good balance between accuracy and computational cost, and represents a step forward in extending protein–ligand docking capacities, with implications in several fields such as drug or enzyme design.

Automated, Accurate, and Scalable Relative Protein-Ligand Binding Free Energy Calculations using Lambda Dynamics

2020 ◽  
Author(s):  
E. Prabhu Raman ◽  
Thomas J. Paul ◽  
Ryan L. Hayes ◽  
Charles L. Brooks III
Keyword(s):  
Free Energy ◽  
Ligand Binding ◽  
Binding Affinity ◽  
Binding Free Energy ◽  
Computational Cost ◽  
Combinatorial Libraries ◽  
Free Energy Calculations ◽  
Lead Optimization ◽  
Efficient Estimation ◽  
Lead Compound

<p>Accurate predictions of changes to protein-ligand binding affinity in response to chemical modifications are of utility in small molecule lead optimization. Relative free energy perturbation (FEP) approaches are one of the most widely utilized for this goal, but involve significant computational cost, thus limiting their application to small sets of compounds. Lambda dynamics, also rigorously based on the principles of statistical mechanics, provides a more efficient alternative. In this paper, we describe the development of a workflow to setup, execute, and analyze Multi-Site Lambda Dynamics (MSLD) calculations run on GPUs with CHARMm implemented in BIOVIA Discovery Studio and Pipeline Pilot. The workflow establishes a framework for setting up simulation systems for exploratory screening of modifications to a lead compound, enabling the calculation of relative binding affinities of combinatorial libraries. To validate the workflow, a diverse dataset of congeneric ligands for seven proteins with experimental binding affinity data is examined. A protocol to automatically tailor fit biasing potentials iteratively to flatten the free energy landscape of any MSLD system is developed that enhances sampling and allows for efficient estimation of free energy differences. The protocol is first validated on a large number of ligand subsets that model diverse substituents, which shows accurate and reliable performance. The scalability of the workflow is also tested to screen more than a hundred ligands modeled in a single system, which also resulted in accurate predictions. With a cumulative sampling time of 150ns or less, the method results in average unsigned errors of under 1 kcal/mol in most cases for both small and large combinatorial libraries. For the multi-site systems examined, the method is estimated to be more than an order of magnitude more efficient than contemporary FEP applications. The results thus demonstrate the utility of the presented MSLD workflow to efficiently screen combinatorial libraries and explore chemical space around a lead compound, and thus are of utility in lead optimization.</p>

scholarly journals DEELIG: A Deep Learning Approach to Predict Protein-Ligand Binding Affinity

2021 ◽  
Vol 15 ◽  
pp. 117793222110303
Author(s):  
Asad Ahmed ◽  
Bhavika Mam ◽  
Ramanathan Sowdhamini
Keyword(s):  
Deep Learning ◽  
Ligand Binding ◽  
Binding Affinity ◽  
Chemical Space ◽  
Biological Significance ◽  
Protein Crystal ◽  
Ligand Docking ◽  
Complex Data ◽  
Binding Prediction ◽  
Data Set

Protein-ligand binding prediction has extensive biological significance. Binding affinity helps in understanding the degree of protein-ligand interactions and is a useful measure in drug design. Protein-ligand docking using virtual screening and molecular dynamic simulations are required to predict the binding affinity of a ligand to its cognate receptor. Performing such analyses to cover the entire chemical space of small molecules requires intense computational power. Recent developments using deep learning have enabled us to make sense of massive amounts of complex data sets where the ability of the model to “learn” intrinsic patterns in a complex plane of data is the strength of the approach. Here, we have incorporated convolutional neural networks to find spatial relationships among data to help us predict affinity of binding of proteins in whole superfamilies toward a diverse set of ligands without the need of a docked pose or complex as user input. The models were trained and validated using a stringent methodology for feature extraction. Our model performs better in comparison to some existing methods used widely and is suitable for predictions on high-resolution protein crystal (⩽2.5 Å) and nonpeptide ligand as individual inputs. Our approach to network construction and training on protein-ligand data set prepared in-house has yielded significant insights. We have also tested DEELIG on few COVID-19 main protease-inhibitor complexes relevant to the current public health scenario. DEELIG-based predictions can be incorporated in existing databases including RSCB PDB, PDBMoad, and PDBbind in filling missing binding affinity data for protein-ligand complexes.

scholarly journals Identification of protein pockets and cavities by Euclidean Distance Transform

2018 ◽  
Author(s):  
Sebastian Daberdaku
Keyword(s):  
Ligand Binding ◽  
Active Sites ◽  
Euclidean Distance ◽  
Protein Structures ◽  
Ligand Docking ◽  
Distance Transform ◽  
Structure Based Drug Design ◽  
Distance Map ◽  
Euclidean Distance Transform ◽  
Protein Pockets

Protein pockets and cavities usually coincide with the active sites of biological processes, and their identification is significant since it constitutes an important step for structure-based drug design and protein-ligand docking applications. This paper presents a novel purely geometric algorithm for the detection of ligand binding protein pockets and cavities based on the Euclidean Distance Transform (EDT). The EDT can be used to compute the Solvent-Excluded surface for any given probe sphere radius value at high resolutions and in a timely manner. The algorithm is adaptive to the specific candidate ligand: it computes two voxelised protein surfaces using two different probe sphere radii depending on the shape of the candidate ligand. The pocket regions consist of the voxels located between the two surfaces, which exhibit a certain minimum depth value from the outer surface. The distance map values computed by the EDT algorithm during the second surface computation can be used to elegantly determine the depth of each candidate pocket and to rank them accordingly. Cavities on the other hand, are identified by scanning the inside of the protein for voids. The algorithm determines and outputs the best k candidate pockets and cavities, i.e. the ones that are more likely to bind to the given ligand. The method was applied to a representative set of protein-ligand complexes and their corresponding unbound protein structures to evaluate its ligand binding site prediction capabilities, and was shown to outperform most of the previously developed purely geometric pocket and cavity search methods.

scholarly journals Characterization of the High-Affinity Drug Ligand Binding Site of Mouse Recombinant TSPO

2019 ◽  
Vol 20 (6) ◽  
pp. 1444 ◽  
Author(s):  
Soria Iatmanen-Harbi ◽  
lucile Senicourt ◽  
Vassilios Papadopoulos ◽  
Olivier Lequin ◽  
Jean-Jacques Lacapere
Keyword(s):  
Ligand Binding ◽  
Binding Site ◽  
Conformational Changes ◽  
Protoporphyrin Ix ◽  
Binding Pocket ◽  
Site Directed Mutagenesis ◽  
Translocator Protein ◽  
Binding Affinities ◽  
Ligand Selectivity ◽  
High Affinity

The optimization of translocator protein (TSPO) ligands for Positron Emission Tomography as well as for the modulation of neurosteroids is a critical necessity for the development of TSPO-based diagnostics and therapeutics of neuropsychiatrics and neurodegenerative disorders. Structural hints on the interaction site and ligand binding mechanism are essential for the development of efficient TSPO ligands. Recently published atomic structures of recombinant mammalian and bacterial TSPO1, bound with either the high-affinity drug ligand PK 11195 or protoporphyrin IX, have revealed the membrane protein topology and the ligand binding pocket. The ligand is surrounded by amino acids from the five transmembrane helices as well as the cytosolic loops. However, the precise mechanism of ligand binding remains unknown. Previous biochemical studies had suggested that ligand selectivity and binding was governed by these loops. We performed site-directed mutagenesis to further test this hypothesis and measured the binding affinities. We show that aromatic residues (Y34 and F100) from the cytosolic loops contribute to PK 11195 access to its binding site. Limited proteolytic digestion, circular dichroism and solution two-dimensional (2-D) NMR using selective amino acid labelling provide information on the intramolecular flexibility and conformational changes in the TSPO structure upon PK 11195 binding. We also discuss the differences in the PK 11195 binding affinities and the primary structure between TSPO (TSPO1) and its paralogous gene product TSPO2.

Improving protein–ligand binding prediction by considering the bridging water molecules in Autodock

2019 ◽  
Vol 18 (05) ◽  
pp. 1950027 ◽  
Author(s):  
Qiangna Lu ◽  
Lian-Wen Qi ◽  
Jinfeng Liu
Keyword(s):  
Ligand Binding ◽  
Considerable Improvement ◽  
Ligand Docking ◽  
Water Molecules ◽  
Binding Modes ◽  
Binding Prediction ◽  
Docking Simulations ◽  
Protein Ligand Interactions ◽  
Ligand Interactions ◽  
Docking Program

Water plays a significant role in determining the protein–ligand binding modes, especially when water molecules are involved in mediating protein–ligand interactions, and these important water molecules are receiving more and more attention in recent years. Considering the effects of water molecules has gradually become a routine process for accurate description of the protein–ligand interactions. As a free docking program, Autodock has been most widely used in predicting the protein–ligand binding modes. However, whether the inclusion of water molecules in Autodock would improve its docking performance has not been systematically investigated. Here, we incorporate important bridging water molecules into Autodock program, and systematically investigate the effectiveness of these water molecules in protein–ligand docking. This approach was evaluated using 18 structurally diverse protein–ligand complexes, in which several water molecules bridge the protein–ligand interactions. Different treatment of water molecules were tested by using the fixed and rotatable water molecules, and a considerable improvement in successful docking simulations was found when including these water molecules. This study illustrates the necessity of inclusion of water molecules in Autodock docking, and emphasizes the importance of a proper treatment of water molecules in protein–ligand binding predictions.

An Improved Kriging Assisted Multi-Objective Genetic Algorithm

2010 ◽  
Author(s):  
Mian Li
Keyword(s):  
Genetic Algorithms ◽  
Computational Cost ◽  
Population Based ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Kriging Metamodel ◽  
Metamodeling Technique ◽  
Important Challenge ◽  
Estimated Error ◽  
Adaptive Metamodeling

Although Genetic Algorithms (GAs) and Multi-Objective Genetic Algorithms (MOGAs) have been widely used in engineering design optimization, the important challenge still faced by researchers in using these methods is their high computational cost due to the population-based nature of these methods. For these problems it is important to devise MOGAs that can significantly reduce the number of simulation calls compared to a conventional MOGA. We present an improved kriging assisted MOGA, called Circled Kriging MOGA (CK-MOGA), in which kriging metamodels are embedded within the computation procedure of a traditional MOGA. In the proposed approach, the decision as to whether the original simulation or its kriging metamodel should be used for evaluating an individual is based on a new objective switch criterion and an adaptive metamodeling technique. The effect of the possible estimated error from the metamodel is mitigated by applying the new switch criterion. Three numerical and engineering examples with different degrees of difficulty are used to illustrate applicability of the proposed approach. The results show that, on the average, CK-MOGA outperforms both a conventional MOGA and our developed Kriging MOGA in terms of the number of simulation calls.

scholarly journals OnionNet-2: A Convolutional Neural Network Model for Predicting Protein-Ligand Binding Affinity Based on Residue-Atom Contacting Shells

2021 ◽  
Vol 9 ◽  
Author(s):  
Zechen Wang ◽  
Liangzhen Zheng ◽  
Yang Liu ◽  
Yuanyuan Qu ◽  
Yong-Qiang Li ◽  
...  
Keyword(s):  
Neural Network ◽  
Ligand Binding ◽  
Convolutional Neural Network ◽  
Binding Affinity ◽  
Binding Free Energy ◽  
Computational Cost ◽  
Scoring Function ◽  
Quality Data ◽  
Great Success ◽  
Data Set

One key task in virtual screening is to accurately predict the binding affinity (△G) of protein-ligand complexes. Recently, deep learning (DL) has significantly increased the predicting accuracy of scoring functions due to the extraordinary ability of DL to extract useful features from raw data. Nevertheless, more efforts still need to be paid in many aspects, for the aim of increasing prediction accuracy and decreasing computational cost. In this study, we proposed a simple scoring function (called OnionNet-2) based on convolutional neural network to predict △G. The protein-ligand interactions are characterized by the number of contacts between protein residues and ligand atoms in multiple distance shells. Compared to published models, the efficacy of OnionNet-2 is demonstrated to be the best for two widely used datasets CASF-2016 and CASF-2013 benchmarks. The OnionNet-2 model was further verified by non-experimental decoy structures from docking program and the CSAR NRC-HiQ data set (a high-quality data set provided by CSAR), which showed great success. Thus, our study provides a simple but efficient scoring function for predicting protein-ligand binding free energy.

scholarly journals Simulating Protein-Ligand Binding with Neural Network Potentials

2019 ◽  
Author(s):  
Shae-Lynn Lahey ◽  
Christopher Rowley
Keyword(s):  
Neural Network ◽  
Ligand Binding ◽  
Computational Cost ◽  
Bound State ◽  
Drug Binding ◽  
Cancer Drug ◽  
Molecular Conformations ◽  
Drug Molecules ◽  
The Stability ◽  
Dynamics Simulations

Drug molecules adopt a range of conformations both in solution and in their protein-bound state. The strain and reduced flexibility of bound drugs can partially counter the intermolecular interactions that drive protein–ligand binding. To make accurate computational predictions of drug binding affinities, computational chemists have attempted to develop efficient empirical models of these interactions, although these methods are not always reliable. Machine learning has allowed the development of highly-accurate neural-network potentials (NNPs), which are capable of predicting the stability of molecular conformations with accuracy comparable to state-of-the-art quantum chemical calculations but at a billionth of the computational cost. Here, we demonstrate that these methods can be used to represent the intramolecular forces of protein-bound drugs within molecular dynamics simulations. These simulations are shown to be capable of predicting the protein–ligand binding pose and conformational component of the absolute Gibbs energy of binding for a set of drug molecules. Notably, the conformational energy for anti-cancer drug erlotinib binding to its target was found to considerably overestimated by a molecular mechanical model, while the NNP predicts a more moderate value. Although the ANI-1ccX NNP was not trained to describe ionic molecules, reasonable binding poses are predicted for charged ligands, although this method is not suitable for modeling the ligands in solution.

Sign in / Sign up

Export Citation Format

Share Document