Softwares for Molecular Docking
-
Upload
niranjan-bhuvanaratnam -
Category
Documents
-
view
223 -
download
1
Transcript of Softwares for Molecular Docking
-
7/27/2019 Softwares for Molecular Docking
1/35
Softwares for Molecular Docking
Lokesh P. Tripathi
NCBS17 December 2007
-
7/27/2019 Softwares for Molecular Docking
2/35
Molecular Docking
Attempt to predict structures of an
intermolecular complex betweentwo or more molecules
Receptor-ligand (or drug) Enzyme-substrate
Protein-DNA (or RNA) Protein-protein
-
7/27/2019 Softwares for Molecular Docking
3/35
Brief History of Docking
Crick (1953) suggested that complementarity in
helical coils could be modelled as knobs fittinginto holes
DOCK (Kuntz, 1982) pioneered the field of
molecular docking
GRID (Goodford, 1985) too became a part of
many subsequent softwares
-
7/27/2019 Softwares for Molecular Docking
4/35
General considerations
Molecular representations
Abstract or atoms Fixed or flexible
Juxtaposition of molecules Interactive or automated
Search algorithm to create conformations
Evaluating complementarity (ranking) Scoring function
Force field energy functions
-
7/27/2019 Softwares for Molecular Docking
5/35
Search Algorithms
Potentially several ways of putting two
molecules together; possibilities increaseexponentially with size of molecules involved
Attempt to locate the most stable state in theenergy landscape
Broadly two types: 1) full solution spacesearch; 2) guided search through solutionspace
-
7/27/2019 Softwares for Molecular Docking
6/35
Search Algorithms
Random Genetic algorithms Monte Carlo methods Tabu search
Systematic Fragment-based methods Point complementary methods Distance geometry methods Database
Simulation Molecular dynamics Energy minimisation
Multiple methods Algorithms
-
7/27/2019 Softwares for Molecular Docking
7/35
Docking Softwares
Vi r t ual scr eeni ng De novo desi gn
AutoDock LUDIDOCK GRID
FlexX/E MCSSSLIDE SMoG
Surflex GrowMol
ICM SPROUT
GOLD
-
7/27/2019 Softwares for Molecular Docking
8/35
Random methods
Sample the conformation space by making
single change to a ligand or a population ofligands
Alteration performed at each step andaccepted or rejected based on apredetermined probability function
Include Monte Carlo (MC) methods; Genetic
Algorithm (GA) methods; Tabu search methods
-
7/27/2019 Softwares for Molecular Docking
9/35
Monte Carlo methods Use a simple energy function
Makes random moves and accepting or rejecting basedon Boltzmann probability function
More efficient in stepping over energy barriers,allowing more complete searches of conformationspace
PRODOCK, MC-DOCK, ICM, DockVision, QXP, GLIDE;too slow for extensive flexible docking
-
7/27/2019 Softwares for Molecular Docking
10/35
Energy global minimum conformers generated by Monte
Carlo method
-
7/27/2019 Softwares for Molecular Docking
11/35
Genetic Algorithm methods Apply ideas of genetics and evolution in
docking
Start with an initial population of randomligand conformers wrt protein, each defined by
a set ofvariables called genes
Genetic operators (mutations, crossovers)
applied to sample conformation space tilloptimal population is derived
AUTODOCK, GOLD, DIVALI, DARWIN; too slowfor extensive flexible docking
-
7/27/2019 Softwares for Molecular Docking
12/35
-
7/27/2019 Softwares for Molecular Docking
13/35
Autodock
Suite of automated docking tools
Designed to predict how small molecules(ligands drug candidates) bind to areceptor; AMBER force field
Three constituent programs-Autotors- define torsions in the ligand-Autogrid- calculate grids
-Autodock- docking tool-AutoDockTools (ADT)- GUI to facilitate aboveand other modules accompanying AutoDock
-
7/27/2019 Softwares for Molecular Docking
14/35
Autodock Lamarckian GA
LGA encompasses a genotypic andphenotypic phase i.e. genetic operationsand energy function to be optimised
Energy minimisation performed aftergenotypic changes and these phenotypicchanges mapped back onto genes (by
changing ligand coordinates.
Most efficient and reliable of random methods
-
7/27/2019 Softwares for Molecular Docking
15/35
Autodock Grid maps
Pre-calculated
Grid for each atom type(e.g. C, H, O, N)
Consists of 3D lattice of
regularly spaced points,surrounding and centered
on region of interest in the
macromolecule
Typical spacing is 0.375 Probe atom placed at each
grid point and energy
calculated
-
7/27/2019 Softwares for Molecular Docking
16/35
GOLD
Genetic Optimisation and Ligand Docking, uses
multiple subpopulations of ligand
Force-field based scoring function, includesthree terms: H-bonding term, intermoleculardispersion potential, intramolecular potential
71% success in identifying experimentalbinding mode in 100 protein complexes
-
7/27/2019 Softwares for Molecular Docking
17/35
Tabu Search methods
Impose restrictions preventing searches from
repeating already explored conformations
New conformation is compared to the previous
ones based on RMSD values which determineacceptance
PRO-LEADS
-
7/27/2019 Softwares for Molecular Docking
18/35
Systematic Search methods
Attempt to explore all degrees of freedom in a
molecule
Can be divided into three types:
conformational search methods,fragmentation methods, and databasemethods
-
7/27/2019 Softwares for Molecular Docking
19/35
Conformational Search methods
Brute force or shotgun methods of docking
All rotatable bonds in ligand rotated through360till in fixed increments till all possible
combinations generated and evaluated
Number of structures generated increasesexponentially with number of rotatable bonds-combinatorial explosion
-
7/27/2019 Softwares for Molecular Docking
20/35
Fragmentation Search methods
Incrementally grow ligand into the active site,
by docking several fragments into the activesite followed by covalent-linking to recreatethe initial ligand
Rigid core-fragment of the ligand is dockedfirst followed by addition of flexible regions
DOCK, FlexX, LUDI, ADAM, Hammerhead
-
7/27/2019 Softwares for Molecular Docking
21/35
DOCK
Methodology
-
7/27/2019 Softwares for Molecular Docking
22/35
FlexX Base fragment is picked up and docked using
pose-clustering algorithm
Clustering algorithm is implemented to mergesimilar ligand transformations into active site
Flexible fragments are added incrementallyusing MIMUMBA and evaluated using overlapfunction, followed by energy calculations till
the ligand is completely built
Final evaluation through Bhms scoring
function that includes H-bonds, ionic, aromaticand lipophilic terms
-
7/27/2019 Softwares for Molecular Docking
23/35
Database methods
Tackle combinatorial explosion by usinglibraries ofpregenerated conformations to deal
with ligand flexibility
FLOG generates and docks conformational
libraries called Flexibases using distancegeometry
EUDOC uses conformational searches of ligandsto generate different structures, which areplaced into receptor active-site followed byenergy evaluation
-
7/27/2019 Softwares for Molecular Docking
24/35
Scoring
Essential to rank the ligand conformationsdetermined by the search algorithms
Scoring function must be able to distinguish
between true binding modes and others
Speed and accuracy are most desirable
Three major classes: force-field based;
empirical; knowledge-based
-
7/27/2019 Softwares for Molecular Docking
25/35
Force-field based Scoring Quantify sum of two energies-interaction
energy between receptor-ligand; internal
energy of the ligand
Consist of van der Waals (Lennard-Jones
potential) + electrostatic energy terms(Coulombic function)
Do not include solvation and entropic terms
GoldScore, G-SCORE, D-SCORE, AMBER,CHARRM, GROMOS
-
7/27/2019 Softwares for Molecular Docking
26/35
Empirical Scoring Designed to reproduce experimental data;
binding energy can be approximated by sum ofindividual uncorrelated terms
Experimentally determined binding energiesused to quantify individual terms
Easy computation, but non-versatile due todependence on experimental datasets
ChemScore, Bhms scoring function, F-Score,X-Score
-
7/27/2019 Softwares for Molecular Docking
27/35
Knowledge-based Scoring
Statistically derived principles that aim toreplicate experimentally determined structures
Employ simple interactions to screen large
databases
Dependent on information available in
preexisting datasets
DrugScore, SMoG score, Potential of Meanforce (PMF)
-
7/27/2019 Softwares for Molecular Docking
28/35
Consensus Scoring
Combines information from different scoring
schemes to compensate for individuallimitations
Correlation of individual scoring systems maybe a problem
X-SCORE combines functions from PMF,ChemScore, PMF with FlexX
-
7/27/2019 Softwares for Molecular Docking
29/35
Protein-protein Docking
Prediction of protein complex structure givenindividual components structures
Huge number of degrees of freedom; docking
largely performed as rigid body docking
Z-DOCK, a Fast Fourier Transform-based rigid
body docking program, is one of the mostaccurate programs as rated in CriticalAssessment of Predicted Interactions (CAPRI)
-
7/27/2019 Softwares for Molecular Docking
30/35
Docking- strengths and limitations
Most available softwares are able to predict
known protein-bound conformations with anaccuracy of1.5-2 ; 70-80% success rate
Scoring function- major limitation factor dueto simplifications and assumptions
Solvation effects, quality of crystallographicdata
-
7/27/2019 Softwares for Molecular Docking
31/35
Comparing Docking softwares in difficult
Several studies compare docking programs but
conclusions of general applicability are not
evident
Minor differences in methodology can havesignificant impact on success rates of various
docking programs
Cole et al., 2005 PROTEINS 60, 325-332 provide
a list of recommendations in assessing dockingprograms
Docki ng sof t ar es
-
7/27/2019 Softwares for Molecular Docking
32/35
Docki ng sof t war es
r epr esent at i ons i n
c i ta t ions
D ki S ft Cit ti
-
7/27/2019 Softwares for Molecular Docking
33/35
Docking Softwares- Citations per year
-
7/27/2019 Softwares for Molecular Docking
34/35
-
7/27/2019 Softwares for Molecular Docking
35/35
Challenges
Predicting structures of multi-domain, multi-
subunit protein complexes
Prediction and specificity in protein-nucleic
acid interactions
Protein-docking with backbone flexibility