Search

Cryptic pockets are protein cavities that remain hidden in resolved apo structures and generally require the presence of a co-crystallized ligand to become visible. Finding new cryptic pockets is crucial for structure-based drug discovery to identify new ways of modulating protein activity and thus expand the druggable space. We present here a new method and associated web application leveraging mixed-solvent molecular dynamics (MD) simulations using benzene as a hydrophobic probe to detect cryptic pockets. Our all-atom MD-based workflow was systematically tested on 18 different systems and 5 additional kinases and represents the largest validation study of this kind. CrypticScout identifies benzene probe binding hotspots on a protein surface by mapping probe occupancy, residence time, and the benzene occupancy reweighed by the residence time. The method is presented to the scientific community in a web application available via www.playmolecule.org using a distributed computing infrastructure to perform the simulations.

Motivation An important step in structure-based drug design consists in the prediction of druggable binding sites. Several algorithms for detecting binding cavities, those likely to bind to a small drug compound, have been developed over the years by clever exploitation of geometric, chemical and evolutionary features of the protein. Results Here we present a novel knowledge-based approach that uses state-of-the-art convolutional neural networks, where the algorithm is learned by examples. In total, 7622 proteins from the scPDB database of binding sites have been evaluated using both a distance and a volumetric overlap approach. Our machine-learning based method demonstrates superior performance to two other competitive algorithmic strategies. Availability and implementation DeepSite is freely available at www.playmolecule.org. Users can submit either a PDB ID or PDB file for pocket detection to our NVIDIA GPU-equipped servers through a WebGL graphical interface. Supplementary information Supplementary data are available at Bioinformatics online.

SkeleDock is a scaffold docking algorithm which uses the structure of a protein-ligand complex as a template to model the binding mode of a chemically similar system. This algorithm was evaluated in the D3R Grand Challenge 4 pose prediction challenge, where it achieved competitive performance. Furthermore, we show that if crystallized fragments of the target ligand are available then SkeleDock can outperform rDock docking software at predicting the binding mode. This Application Note also addresses the capacity of this algorithm to model macrocycles and deal with scaffold hopping. SkeleDock can be accessed at https://playmolecule.org/SkeleDock/.

Fragment-based drug discovery (FBDD) has become a mainstream approach in drug design because it allows the reduction of the chemical space and screening libraries while identifying fragments with high protein-ligand efficiency interactions that can later be grown into drug-like leads. In this work, we leverage high-throughput molecular dynamics (MD) simulations to screen a library of 129 fragments for a total of 5.85 ms against the CXCL12 monomer, a chemokine involved in inflammation and diseases such as cancer. Our in silico binding assay was able to recover binding poses, affinities, and kinetics for the selected library and was able to predict 8 mM-affinity fragments with ligand efficiencies higher than 0.3. All of the fragment hits present a similar chemical structure, with a hydrophobic core and a positively charged group, and bind to either sY7 or H1S68 pockets, where they share pharmacophoric properties with experimentally resolved natural binders. This work presents a large-scale screening assay using an exclusive combination of thousands of short MD adaptive simulations analyzed with a Markov state model (MSM) framework.

Accurately predicting protein–ligand binding affinities is an important problem in computational chemistry since it can substantially accelerate drug discovery for virtual screening and lead optimization. We propose here a fast machine-learning approach for predicting binding affinities using state-of-the-art 3D-convolutional neural networks and compare this approach to other machine-learning and scoring methods using several diverse data sets. The results for the standard PDBbind (v.2016) core test-set are state-of-the-art with a Pearson’s correlation coefficient of 0.82 and a RMSE of 1.27 in pK units between experimental and predicted affinity, but accuracy is still very sensitive to the specific protein used. KDEEP is made available via PlayMolecule.org for users to test easily their own protein–ligand complexes, with each prediction taking a fraction of a second. We believe that the speed, performance, and ease of use of KDEEP makes it already an attractive scoring function for modern computational ch...

HTMD is a programmable scientific platform intended to facilitate simulation-based research in molecular systems. This paper presents the functionalities of HTMD for the preparation of a molecular dynamics simulation starting from PDB structures, building the system using well-known force fields, and applying standardized protocols for running the simulations. We demonstrate the framework's flexibility for high-throughput molecular simulations by applying a preparation, building, and simulation protocol with multiple force-fields on all of the seven hundred eukaryotic membrane proteins resolved to-date from the orientation of proteins in membranes (OPM) database. All of the systems are available on www.playmolecule.org .

Drug discovery suffers from high attrition because compounds initially deemed as promising can later show ineffectiveness or toxicity resulting from a poor understanding of their activity profile. In this work, we describe a deep self-normalizing neural network model for the prediction of molecular pathway association and evaluate its performance, showing an AUC ranging from 0.69 to 0.91 on a set of compounds extracted from ChEMBL and from 0.81 to 0.83 on an external data set provided by Novartis. We finally discuss the applicability of the proposed model in the domain of lead discovery. A usable application is available via PlayMolecule.org .

The capability to rank different potential drug molecules against a protein target for potency has always been a fundamental challenge in computational chemistry due to its importance in drug design. While several simulation-based methodologies exist, they are hard to use prospectively and thus predicting potency in lead optimization campaigns remains an open challenge. Here we present the first machine learning approach specifically tailored for ranking congeneric series based on deep 3D-convolutional neural networks. Furthermore we prove its effectiveness by blindly testing it on datasets provided by Janssen, Pfizer and Biogen totalling over 3246 ligands and 13 targets as well as several well-known openly available sets, representing one the largest evaluations ever performed. We also performed online learning simulations of lead optimization using the approach in a predictive manner obtaining significant advantage over experimental choice. We believe that the evaluation performed in this study is strong evidence of the usefulness of a modern deep learning model in lead optimization pipelines against more expensive simulation-based alternatives. The authors thank Acellera Ltd. for funding. G. D. F. acknowledges support from MINECO (BIO2014-53095-P), MICINN (PTQ-17-09079) and FEDER. This project has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No 675451 (CompBioMed project).