In silico fragment-based drug design with SEED

BMaps: A Web Application for Fragment-Based Drug Design and Compound Binding Evaluation

Fragment-based drug design uses data about where, and how strongly, small chemical fragments bind to proteins, to assemble new drug molecules. Over the past decade, we have been successfully using fragment data, derived from thermodynamically rigorous Monte Carlo fragment-protein binding simulations, in dozens of preclinical drug programs. However, this approach has not been available to the broader research community because of the cost and complexity of doing simulations and using design tools. We have developed a web application, called BMaps, to make fragment-based drug design widely available with greatly simplified user interfaces. BMaps provides access to a large repository (>550) of proteins with 100s of precomputed fragment maps, druggable hot spots, and high-quality water maps. Users can also employ their own structures or those from the Protein Data Bank and AlphaFold DB. Multigigabyte data sets are searched to find fragments in bondable orientations, ranked by a binding-free energy metric. The designers use this to select modifications that improve affinity and other properties. BMaps is unique in combining conventional tools such as docking and energy minimization with fragment-based design, in a very easy to use and automated web application. The service is available at https://www.boltzmannmaps.com.

Galileo: Three-dimensional searching in large combinatorial fragment spaces on the example of pharmacophores

Fragment spaces are an efficient way to model large chemical spaces using a handful of small fragments and a few connection rules. The development of Enamine's REAL Space has shown that large spaces of readily available compounds may be created this way. These are several orders of magnitude larger than previous libraries. So far, searching and navigating these spaces is mostly limited to topological approaches. A way to overcome this limitation is optimization via metaheuristics which can be combined with arbitrary scoring functions. Here we present Galileo, a novel Genetic Algorithm to sample fragment spaces. We showcase Galileo in combination with a novel pharmacophore mapping approach, called Phariety, enabling 3D searches in fragment spaces. We estimate the effectiveness of the approach with a small fragment space. Furthermore, we apply Galileo to two pharmacophore searches in the REAL Space, detecting hundreds of compounds fulfilling a HSP90 and a FXIa pharmacophore.

A Guide to In Silico Drug Design

The drug discovery process is a rocky path that is full of challenges, with the result that very few candidates progress from hit compound to a commercially available product, often due to factors, such as poor binding affinity, off-target effects, or physicochemical properties, such as solubility or stability. This process is further complicated by high research and development costs and time requirements. It is thus important to optimise every step of the process in order to maximise the chances of success. As a result of the recent advancements in computer power and technology, computer-aided drug design (CADD) has become an integral part of modern drug discovery to guide and accelerate the process. In this review, we present an overview of the important CADD methods and applications, such as in silico structure prediction, refinement, modelling and target validation, that are commonly used in this area.

CAVIAR: a method for automatic cavity detection, description and decomposition into subcavities

The accurate description of protein binding sites is essential to the determination of similarity and the application of machine learning methods to relate the binding sites to observed functions. This work describes CAVIAR, a new open source tool for generating descriptors for binding sites, using protein structures in PDB and mmCIF format as well as trajectory frames from molecular dynamics simulations as input. The applicability of CAVIAR descriptors is showcased by computing machine learning predictions of binding site ligandability. The method can also automatically assign subcavities, even in the absence of a bound ligand. The defined subpockets mimic the empirical definitions used in medicinal chemistry projects. It is shown that the experimental binding affinity scales relatively well with the number of subcavities filled by the ligand, with compounds binding to more than three subcavities having nanomolar or better affinities to the target. The CAVIAR descriptors and methods can be used in any machine learning-based investigations of problems involving binding sites, from protein engineering to hit identification. The full software code is available on GitHub and a conda package is hosted on Anaconda cloud.

LEADS-FRAG: A Benchmark Data Set for Assessment of Fragment Docking Performance

Fragment-based drug design is a popular approach in drug discovery, which makes use of computational methods such as molecular docking. To assess fragment placement performance of molecular docking programs, we constructed LEADS-FRAG, a benchmark data set containing 93 high-quality protein-fragment complexes that were selected from the Protein Data Bank using a rational and unbiased process. The data set contains fully prepared protein and fragment structures and is publicly available. Moreover, we used LEADS-FRAG for evaluating the small-molecule docking programs AutoDock, AutoDock Vina, FlexX, and GOLD for their fragment docking performance. GOLD in combination with the scoring function ChemPLP and AutoDock Vina performed best and generated near-native conformations (root mean square deviation <1.5 Å) for more than 50% of the data set considering the top-ranked docking pose. Taking into account all docking poses, the tested programs generated near-native conformations for up to 86% of the fragments in LEADS-FRAG. By rescoring all docking poses with the GOLD scoring functions and the Protein-Ligand Informatics force field, the number of near-native conformations increased up to 40% with respect to the top-rescored poses. Our results show that conventional small-molecule docking programs achieve a satisfactory fragment docking performance when utilizing rescoring.

FragRep: A Web Server for Structure-Based Drug Design by Fragment Replacement

The design of efficient computational tools for structure-guided ligand design is essential for the drug discovery process. We hereby present FragRep, a new web server for structure-based ligand design by fragment replacement. The input is a protein and a ligand structure, either from protein data bank or from molecular docking. Users can choose specific substructures they want to modify. The server tries to find suitable fragments that not only meet the geometric requirements of the remaining part of the ligand but also fit well with local protein environments. FragRep is a powerful computational tool for the rapid generation of ligand design ideas; either in scaffold hopping or bioisosteric replacing. The FragRep Server is freely available to researchers and can be accessed at http://xundrug.cn/fragrep.

Shape-Based Descriptors for Efficient Structure-Based Fragment Growing

Structure-based fragment growing is one of the key techniques in fragment-based drug design. Fragment growing is commonly practiced based on structural and biophysical data. Computational workflows are employed to predict which fragment elaborations could lead to high-affinity binders. Several such workflows exist but many are designed to be long running noninteractive systems. Shape-based descriptors have been proven to be fast and perform well at virtual-screening tasks. They could, therefore, be applied to the fragment-growing problem to enable an interactive fragment-growing workflow. In this work, we describe and analyze the use of specific shape-based directional descriptors for the task of fragment growing. The performance of these descriptors that we call ray volume matrices (RVMs) is evaluated on two data sets containing protein-ligand complexes. While the first set focuses on self-growing, the second measures practical performance in a cross-growing scenario. The runtime of screenings using RVMs as well as their robustness to three dimensional perturbations is also investigated. Overall, it can be shown that RVMs are useful to prefilter fragment candidates. For up to 84% of the 3299 generated self-growing cases and for up to 66% of the 326 generated cross-growing cases, RVMs could create poses with less than 2 Å root-mean-square deviation to the crystal structure with average query speeds of around 30,000 conformations per second. This opens the door for fast explorative screenings of fragment libraries.

An ABSINTH-Based Protocol for Predicting Binding Affinities between Proteins and Small Molecules

The core task in computational drug discovery is to accurately predict binding free energies in receptor-ligand systems for large libraries of putative binders. Here, the ABSINTH implicit solvent model and force field are extended to describe small, organic molecules and their interactions with proteins. We show that an automatic pipeline based on partitioning arbitrary molecules into substructures corresponding to model compounds with known free energies of solvation can be combined with the CHARMM general force field into a method that is successful at the two important challenges a scoring function faces in virtual screening work flows: it ranks known binders with correlation values rivaling that of comparable state-of-the-art methods and it enriches true binders in a set of decoys. Our protocol introduces innovative modifications to common virtual screening workflows, notably the use of explicit ions as competitors and the integration over multiple protein and ligand species differing in their protonation states. We demonstrate the value of modifications to both the protocol and ABSINTH itself. We conclude by discussing the limitations of high-throughput implicit methods such as the one proposed here.

Assessment of the Fragment Docking Program SEED

The fragment docking program solvation energy for exhaustive docking (SEED) is evaluated on 15 different protein targets, with a focus on enrichment and the hit rate. It is shown that SEED allows for consistent computational enrichment of fragment libraries, independent of the effective hit rate. Depending on the actual target protein, true positive rates ranging up to 27% are observed at a cutoff value corresponding to the experimental hit rate. The impact of variations in docking protocols and energy filters is discussed in detail. Remaining issues, limitations, and use cases of SEED are also discussed. Our results show that fragment library selection or enhancement for a particular target is likely to benefit from docking with SEED, suggesting that SEED is a useful resource for fragment screening campaigns. A workflow is presented for the use of the program in virtual screening, including filtering and postprocessing to optimize hit rates.

Selectively Disrupting m6A-Dependent Protein-RNA Interactions with Fragments

We report a crystallographic analysis of small-molecule ligands of the human YTHDC1 domain that recognizes N6-methylated adenine (m⁶A) in RNA. The 30 binders are fragments (molecular weight < 300 g mol^-1) that represent 10 different chemotypes identified by virtual screening. Despite the structural disorder of the binding site loop (residues 429-439), most of the 30 fragments emulate the two main interactions of the -NHCH₃ group of m⁶A. These interactions are the hydrogen bond to the backbone carbonyl of Ser378 and the van der Waals contacts with the tryptophan cage. Different chemical groups are involved in the conserved binding motifs. Some of the fragments show favorable ligand efficiency for YTHDC1 and selectivity against other m⁶A reader domains. The structural information is useful for the design of modulators of m⁶A recognition by YTHDC1.