Key Topics in Molecular Docking for Drug Design
Pedro H M Torres, Ana C R Sodero, Paula Jofily, Floriano P Silva-Jr
Read Key Topics in Molecular Docking for Drug Design by Pedro H M Torres, Ana C R Sodero, Paula Jofily, Floriano P Silva-Jr in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/europmc-pmc6769580.txt.
Introduction
Torres and co-authors review key topics in molecular docking for drug design. Docking uses computers to fit candidate drug molecules into a target's binding pocket. It is fast and cheap, so both universities and industry rely on it. Yet finding true binders, and their exact poses, stays tricky. No straightforward route guarantees the right answer.
The review covers four fronts. Benchmark sets for testing docking tools come first, with their strengths and traps. Consensus methods, which combine several tools, come next. Fragment-based algorithms and machine learning approaches round out the survey. Each advance adds a little accuracy. With growing computer power, the field may one day reach its full potential.
Catalog record
| CREATOR | Pedro H M Torres, Ana C R Sodero, Paula Jofily, Floriano P Silva-Jr |
|---|---|
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 103 KB |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |
Browse the full library · About the Tower of Babel
Full text
The opening of the work, from the library's hosted text:
Key Topics in Molecular Docking for Drug Design By Pedro H M Torres, Ana C R Sodero, Paula Jofily, Floriano P Silva-Jr Published in: International Journal of Molecular Sciences DOI: 10.3390/ijms20184574 ABSTRACT Abstract Molecular docking has been widely employed as a fast and inexpensive technique in the past decades, both in academic and industrial settings. Although this discipline has now had enough time to consolidate, many aspects remain challenging and there is still not a straightforward and accurate route to readily pinpoint true ligands among a set of molecules, nor to identify with precision the correct ligand conformation within the binding pocket of a given target molecule. Nevertheless, new approaches continue to be developed and the volume of published works grows at a rapid pace. In this review, we present an overview of the method and attempt to summarise recent developments regarding four main aspects of molecular docking approaches: (i) the available benchmarking sets, highlighting their advantages and caveats, (ii) the advances in consensus methods, (iii) recent algorithms and applications using fragment-based approaches, and (iv) the use of machine learning algorithms in molecular docking. These recent developments incrementally contribute to an increase in accuracy and are expected, given time, and together with advances in computing power and hardware capability, to eventually accomplish the full potential of this area. Keywords: computer-aided drug design, structure-based drug design, benchmarking sets, consensus methods, fragment-based, machine learning 1. INTRODUCTION Molecular docking is a method which analyses the conformation and orientation (referred together as the “pose”) of molecules into the binding site of a macromolecular target. Searching algorithms generate possible poses, which are ranked by scoring functions [1]. Several software were developed during the last decades, amongst which are some well-known examples, such as AutoDock [2], AutoDock Vina [3], DockThor [4,5], GOLD [6,7], FlexX [8] and Molegro Virtual Docker [9]. The first step in a docking calculation is to obtain the target structure, which commonly consists of a large biological molecule (protein, DNA or RNA) [10] (Figure 1). The structures of these macromolecules can be readily retrieved from the Protein Data Bank (PDB) [11], which provides access to 3D atomic coordinates obtained by experimental methods. However, it is not unusual that the experimental 3D structure of the target is not available. In order to overcome this issue, computational prediction methods, such as comparative and ab initio modelling can be used to obtain the three-dimensional structure of proteins [1]. [Figure: General workflow of molecular docking calculations. The approaches normally start by obtaining 3D structures of target and ligands. Then, protonation states and partial charges are assigned. If not previously known, the target binding site is detected, or a blind docking simulation may be performed. Molecular docking calculations are carried out in two main steps: posing and scoring, thus generating a ranked list of possible complexes between target and ligands.] Usually, the binding site location on which to focus the docking calculations is known. However, when the binding region information is missing, there are two commonly employed approaches: either the most probable binding sites are algorithmically predicted or a “blind docking” simulation is carried out. The latter has a high computational cost, since the search covers all the target structure [12]. Several available software can be used to detect binding sites. MolDock [9], for example, uses an integrated cavity detection algorithm to identify potential binding sites. DoGSiteScorer is an algorithm that determines possible pockets and their druggability scores, which describe the potential of the binding site to interact with a small drug-like molecule [13]. Fragment Hotspot Maps [14] uses small molecular probes to identify surface regions in the receptor that are prone to interact with small molecules. These predicted interaction sites can then be provided as the centre of the sampling space. Moreover, information derived from such hotspots or even from previous experimental knowledge (e.g., NMR, mass spectrometry) can be used to generate distance restraints, which is known to greatly increase protein-small molecule docking accuracy [15]. During docking calculations, a common strategy is to employ a grid representation that includes precalculated potential energies for interaction within the target binding site [16]. This approach speeds up the docking runs and basically consists of the discretisation of the binding site [17]. Then, at each grid point, interactions related to the Lennard–Jones and electrostatic potentials are calculated. Ligand structure is also required and can be obtained from small molecules databases, such as ZINC [18] and PubChem [19]. These online databases facilitate the retrieval of a large number of compounds for subsequent virtual screening. If not directly available, the 3D atomic coordinates of these compounds can be obtained from the 2D structures (or even from simpler representation schemes, such as SMILES) using several available software, such as ChemSketch (Advanced Chemistry Development, Inc., Toronto, On, Canada, www.acdlabs.com, 2019), ChemDraw (PerkinElmer Informatics), Avogadro [20] and Concord [21]. It is worth noting that for small molecule ligands all that is needed initially is a stereochemically defined geometry with the correct relevant protonation state, since conformations will be explored by the docking software in the context of the target’s binding site. Charges are usually assigned through algorithms that distribute the net charge of a molecule among its constituent atoms as partial atom-centred charges. Furthermore, most docking methods assume that a particular protonation state and charge distribution in the molecules do not change between their bound and unbound states [3]. Nevertheless, it is crucial for successful docking to evaluate free torsions, protonation states and charge assignments. The protonation states of the target’s amino acid residues can be critical to ligand interactions and, consequently, to the binding affinity prediction. There are several software available to evaluate the pKa of the amino acid residues, such as PropKa [22] and H++ [23]. Ligand protonation is also important since it affects the net charge of the molecule and the partial charges of individual atoms. Nonetheless, each docking program will employ a different charge assignment protocol [1]. For example, in the MolDock program, the protein and the ligands are automatically prepared (charges and protonation states assigned) and simplified charge and protonation schemes are used, as described by Thomsen and Christensen (2006). AutoDock uses Gasteiger–Marsili atomic charges whereas the closely-related AutoDock Vina does not require the assignment of atomic charges, since the terms that compose its scoring function are charge-independent [3,24]. The DockThor algorithm, as implemented in the homonymous web portal, automatically generates the topology files (i.e., atom types and partial charges) for the protein, ligand and cofactors according to the MMFF94S force field [4,5,25]. Two aspects are crucial to docking programs: search algorithms and scoring functions. The search algorithm analyses and generates ligand pose at a target’s binding site, taking into consideration the roto-translational and internal degrees of freedom of the ligand [10]. Search strategies are often classified as systematic, stochastic or deterministic [16]. Systematic search algorithms explore each ligand’s degree of freedom incrementally. As the number of free rotatable bonds increases, the number of evaluations can undergo a combinatorial explosion [16,26,27]. This class of search algorithms can be subdivided in exhaustive, incremental construction (which relies on the fragmentation of the ligand) and conformational ensemble [26]. FlexX [8] and eHits [28], for example, employ fragment-based approaches with systematic algorithms (incremental construction and