SlideShare a Scribd company logo
1 of 67
Download to read offline
Structural Bioinformatics
(C3210)
Molecular Docking
2
Molecular Recognition, Molecular Docking
๎€Œ Molecular recognition is the ability of biomolecules to recognize
other biomolecules and selectively interact with them in order to
promote fundamental biological events such as transcription,
translation, signal transduction, transport, regulation, enzymatic
catalysis, viral and bacterial infection and immune response.
๎€Œ Molecular docking is the process that involves placing molecules
in appropriate configurations to interact with a receptor.
Molecular docking is a natural process which occurs within
seconds in a cell.
๎€Œ In molecular modeling the term โ€œmolecular dockingโ€ refers to
the study of how two or more molecular structures fit together
3
Understanding Molecular Recognition
๎€Œ Understanding the principles of molecular recognition at the
molecular level is essential to a good understanding of
molecular function and biological process
๎€Œ Knowledge of the mechanical features of a biological signal can
be used to design novel therapeutic agents
4
Molecular Docking Models
๎€Œ Over the years biochemists have developed numerous models
to capture the key elements of the molecular recognition
process. Although very simplified, these models have proven
highly useful to the scientific community.
5
The Lock and Key Theory
๎€Œ As far back as 1890 Emil Fischer proposed a model called the
"lock-and-key model" that explained how biological systems
function. A substrate fits into the active site of a macromolecule,
just like a key fits into a lock. Biological 'locks' have unique
stereochemical features that are necessary to their function.
6
The Induced-Fit Theory
๎€Œ In 1958 Daniel Koshland introduced the "induced-fit theory". The
basic idea is that in the recognition process, both ligand and
target mutually adapt to each other through small
conformational changes, until an optimal fit is achieved.
7
The Conformation Ensemble Model
๎€Œ In addition to small induced-fit adaptation, it has been observed
that proteins can undergo much larger conformational changes.
A recent model describes proteins as a pre-existing ensemble of
conformational states. The plasticity of the protein allows it to
switch from one state to another.
8
From the Lock and Key to the Ensemble Model
๎€Œ Lock-and-key, induced-fit and the conformation ensemble model
are not contradictory. Each one focuses on a particular aspect of
the recognition process. The lock-and-key model introduces the
principle of 3D complementarity, the induced-fit model explains
how complementarity is achieved, and the ensemble model
depicts the conformational complexity of proteins.
9
Experimental Methods to Study
Molecular Docking
๎€Œ Experimental techniques for study molecular recognition include
X-ray crystallography, NMR, electron microscopy, site directed
mutagenesis, co-immuno-precipitation etc...
๎€Œ They allow us to experimentally solve the detailed
3โ€‘dimensional structures of biomolecules in their association
form which is a necessary step in identifying crucial residues,
study the strength of interaction forces, their energetics,
understand how molecular structures fit together, and
investigate mechanisms of action
10
A Bottleneck in Drug Discovery
๎€Œ Due to the limitations of current experimental methods, 3D
structures of complexes are rarely available. But knowledge of
the separated molecules in 3D is only weakly informative if we
do not know how to assemble them.
11
Triggering the Computational Docking Discipline
๎€Œ The difficulties in obtaining experimentally structural data of
macromolecular complexes have triggered the development of
computational predictive methods
๎€Œ Computational docking (also called in silico molecular docking or
just docking) is a computational science aiming at predicting the
optimal binding orientation and conformation of interacting
molecules in space, and to estimate the stability of their
complex
๎€Œ Molecular docking predicts whether or not the two molecules
interact, the binding affinity and the 3D structure of the complex
๎€Œ Computational docking is an
essential component in
modern drug discovery. Over
the last few decades, it has
been routinely and
successfully applied in most
pharmaceutical and biotech
companies for a large number
of applications.
12
Docking Classification
๎€Œ Molecular docking classifies biomolecules into three categories:
small molecules (also called 'ligands'), proteins, and nucleic
acids
๎€Œ The most important types of docking systems are: protein-
ligand, protein-protein and nucleic acid-protein
๎€Œ The interactions between a small molecule and a protein are by
far much better understood than those between a protein and a
nucleic acid
13
Definition of the "Pose"
๎€Œ A "pose" is a term widely adopted for describing the geometry
of a particular complex (also called "binding mode")
๎€Œ It refers to a precise configuration which is characterized not
only by the relative orientation of the docked molecules but also
their respective conformations
14
Molecular Complementarity in Computational
Docking
๎€Œ Computational docking exploit the concept of molecular
complementarity. The structures interact like a hand in a glove,
where both the shape and the physico-chemical properties of
the structures contribute to the fit.
๎€Œ Shape complementarity is the primary criterion for evaluating
the fit in the computational docking of two candidate structures
๎€Œ In addition to shape compatibility, chemical and physico-
chemical complementarity are also important criteria in the
docking between candidate structures
15
Energy Dictates Molecular Associations
๎€Œ The process of "self-assembly" is dictated by forces that are
energy based: the complex has a lower potential energy than its
constituent parts, and this keeps the parts together
๎€Œ The goal of computational docking is to find the 3D
configuration of the complex that minimizes the energy
16
Molecular Flexibility in Protein-Ligand Docking
๎€Œ The mutual adaptation of a ligand with its receptor is crucial to
understanding ligand binding and protein function
๎€Œ One of the major challenges in molecular docking is how to
account for this adaptation in docking calculations
๎€Œ The docking problem can be classified according to the way
flexibility is modeled. In ascending order of complexity:
1. Rigid body docking ignores the flexibility of the molecules
and treats them like rigid objects
2. Rigid receptor โ€“ flexible ligand docking: only the ligand is
treated as flexible, receptor is rigid
3. Flexible receptor โ€“ flexible ligand docking: both protein and
ligand are treated as flexible.
17
Molecular Flexibility in Protein-Ligand Docking
18
Three Components of Docking Software
๎€Œ Docking software can be categorised based on the following
criteria:
1. Molecular representation - a way to represent structures and
properties (atomic, surface, grid representation)
2. Scoring method - a method to assess the quality of docked
complexes (force field, knowledge-based approach, ...)
3. Searching algorithm - an efficient search algorithm that
decides which poses to generate (exhaustive search, Monte
Carlo, genetic algorithms, simulated annealing, tabu search)
19
Molecular Representation
20
Molecular Representation
๎€Œ There are three representations commonly used in docking
programs:
๎€Œ the atomic representation (the most common)
๎€Œ the surface representation
๎€Œ the grid representation
๎€Œ The choice of representation dictates the way the docking
problem will be tackled
21
Atomic Representation
๎€Œ In atomic representation, each atom is characterized by its
coordinates and atom-type
22
Protein Preparation
๎€Œ The preparation of the protein calls for great care. Important
decisions include the choice of the tautomeric forms of histidine
residues, the protonation states of amino-acids and
conformations of some residues; their incorrect assignments
may lead to docking errors.
23
Small Molecule Preparation
๎€Œ Before generating and docking the 3D structures of a library of
ligands, it is important to "clean up" the 2D structures being
used by removing any counter ions, salts, or water molecules
that might be part of the registered structure
๎€Œ All reactive or otherwise undesirable compounds must also be
removed
๎€Œ Possibly generate all optical isomers (enantiomers), cis/trans
isomers, tautomers, and protonation states of the structures
๎€Œ For most docking programs the tautomeric and protonation
state of the ligands to be docked is defined by the user; in
general the structure considered to be dominant at a neutral pH
is generated; here also, incorrect assignments may lead to
docking errors
24
Small Molecule Preparation
Tautomers generation
Salt removing Optical isomers (enantiomers) generation
Double bond cis/trans isomers generation
25
Scoring Methods
26
Scoring Methods
๎€Œ Scoring methods aim at assessing the quality of docked
complexes and guiding the docking algorithm
๎€Œ The binding process that leads to the formation of a complex
between a ligand and its receptor is controlled by several factors
including:
1. the interaction energies between the two molecules
2. the desolvation and solvation energies associated with the
interacting molecules
3. the entropic factors that occur upon binding
๎€Œ The final free energy of binding will depend on the overall
balance of these factors
27
Interaction Energies
๎€Œ The interaction forces between two molecules can be divided
into:
โ— Electrostatic interactions
โ— Hydrogen bond interactions
โ— Van der Waals interactions
โ— Hydrophobic forces
28
Desolvation Energies
๎€Œ The binding of a ligand to a protein is a complex process
influenced by desolvation and solvation phenomena where the
interacting entities become partially desolvated
๎€Œ This thermodynamically driven chain of events leads to the
formation of favorable interactions between the ligand and the
protein where hydrophobic contacts are the driving forces:
hydrophobic moieties associate together to reduce the
interactions with the surrounding water
๎€Œ Another important energy term is electrostatic interaction
between charged atoms and water molecules
29
Entropic Effects
๎€Œ The flexibility of the molecules and the consequences in terms
of entropy can have a significant impact on the binding energy
of a ligand
30
Calculation of the Binding Energies
๎€Œ The binding energy ฮ”Gbinding is the energy required to
separate a complex into separate parts (protein and ligand). It is
defined as the difference between the energy of the associated
(bound) form (Ecomplex) and that of the separated (unbound)
molecules (Eprotein and Eligand).
๎€Œ A complex has a lower potential energy than its constituent
parts. This is what keeps them together.
31
Force-Field Calculations
๎€Œ Molecular mechanics can be used to estimate the internal
energy of the system, which makes it useful for calculating ฮ”G
๎€Œ The total energy of a system is described as the sum of the
independent terms of the force field
๎€Œ The energies obtained by force field methods can be used
directly to approximate free energies of binding
32
Searching Algorithms
33
Rigid Docking Methods
๎€Œ If we assume that the molecules are rigid, we are then looking
for a transformation in 3D space of one of the molecules which
brings it into optimal fit with the other molecule in terms of a
scoring function
๎€Œ In rigid-body docking, the search space is restricted to three
rotational and three translational degrees of freedom
34
Two Docking Philosophies
๎€Œ A large number of docking approaches have been developed to
predict the formation of molecular complexes. They can be
divided into two broad classes that correspond to two different
philosophies:
๎€Œ Feature-based matching matches local complementarity
features among molecules involved in the recognition
๎€Œ Stepwise search explores the 'search space' guided by a
scoring function
35
Components of Feature-Based Matching
Methods
๎€Œ The way feature-based matching applies to the docking problem
is similar to solving a jigsaw puzzle. You pick a piece and look for
a complementary one from among the rest of the pieces
(feature extraction). Once a piece is found (feature matching),
the elements are assembled (transformation), the solution is
then assessed globally for final approval of the compatibility
(filtering and scoring).
36
The Stepwise Search Approach
๎€Œ The stepwise search approach tries to explore the search space
(defined as the set of all possible solutions), with the hope of
finding an optimal solution
๎€Œ The approach is driven by a scoring function which guides the
search algorithm
๎€Œ In computational docking the stepwise search involves two
components:
1. A positioning module which generates new complex
arrangements
2. A scoring module that assesses the quality of each
individual arrangement
๎€Œ The positioning module is directly connected to the search
module, which dictates the configuration of the next pose to be
generated (by appropriate search algorithm)
๎€Œ In rigid-body docking the variables to optimize are the three
rotation angles and the three translation parameters
37
Search Algorithms
๎€Œ The following approaches are used in computational docking:
๎€Œ Exhaustive search (for small systems only)
๎€Œ Monte Carlo
๎€Œ Genetic Algorithms
๎€Œ Simulated Annealing
๎€Œ Tabu searches
๎€Œ Tabu search (TS) is a stochastic searching algorithm that
maintains a list of previously visited poses. These poses are
forbidden and cannot be revisited (they are "taboo"). TS
effectively guides the search process into unvisited areas of the
space.
38
Methods for Incorporating Flexibility
39
Degrees of Freedom in Flexible Docking
๎€Œ The rigid-body docking approaches are often not sufficient to
predict the structure of a protein complex from the separate
unbound structures
๎€Œ The incorporation of molecular flexibility into docking algorithms
requires to add conformational degrees of freedom to
translations and rotations
๎€Œ Approximation algorithms need to be introduced to reduce the
dimensionality of the problem and produce acceptable results
within a reasonable computing time
40
Methods for Handling Ligand Flexibility
๎€Œ Many methods have been developed for incorporating flexible
small molecules into docking software; they include:
1. Ligand-ensemble docking method
2. Fragmentation method
3. Stochastic conformational search method
41
Ligand-Ensemble Docking Method
๎€Œ The simplest method to account for small molecule flexibility is
to consider it as an "ensemble" of rigid and independent ligand
conformations
๎€Œ In the first step low energy conformers of ligand are generated
by conformational analysis
๎€Œ In the second step, rigid docking is applied for each conformer
independently in order to find the most favorable small
molecule-protein complex
42
The Fragmentation Docking Method
๎€Œ Fragmentation methods break down the molecule into small
rigid fragments, the fragments are then reassembled in the
binding pocket
๎€Œ Two different approaches are used for reassembling the
disconnected moieties: the place-and-join and the incremental
approach
43
Place-and-Join Algorithm
๎€Œ The place-and-join method splits the molecule into rigid
subparts
๎€Œ Each subpart is docked independently
๎€Œ Assembly of the fragments is then done by looking at their
relative location and assessing the possibility of re-connecting
them with the connectivity of the initial molecule, in
geometrically correct conformations
44
Incremental-Based Methods
๎€Œ The incremental based approach starts with an initial core
docked in the active site, and new fragments are progressively
added and minimized; the treatment is terminated when the
entire molecule is formed
45
Incremental Algorithm
๎€Œ The main problem of incremental construction algorithms is
their dependence on the choice of the first fragment to be
docked, which requires an exploration of several possibilities
๎€Œ In the example below the initial rigid fragment has been docked
three times (A, B, C). For each one, we have a set of potential
solutions that can be generated. Each intermediate level is
extended to the next one by adding a new next fragment in all
possible configurations. Solutions with a bad score are
eliminated.
46
Stochastic Search Methods
๎€Œ Stochastic search methods modify the conformation of the small
molecule in the receptor site and assess it on the fly
๎€Œ In the case of genetic algorithms, the torsion angles are added
on the chromosomes; in Monte Carlo based methods they are
set as parameters for optimization
47
Incorporating Protein Flexibility
48
Incorporating Protein Flexibility
๎€Œ Incorporating protein flexibility into molecular docking software
is a difficult optimization problem involving a huge number of
degrees of freedom that represent the receptor flexibility
๎€Œ For practical reasons, four types of protein flexibility are
recognized:
โ— small atom fluctuations (solved by soft docking methods)
โ— side-chain flexibility
โ— backbone flexibility
โ— domain movements
49
Flexibility Through Soft Docking Methods
๎€Œ The simple approach to tackle the protein flexibility problem is
the 'soft docking' method
๎€Œ It allows for slight penetrations between the receptor and the
ligand molecules; this is a mathematical trick where the
receptor and the ligand are held rigid and a 'soft' scoring
function is used, allowing some overlap between them.
๎€Œ In the example below, the fit between the substrate and the
protein is acceptable, except however for a bump with the
phenyl group. The idea behind a soft scoring function is that
instead of resolving bumps by conformational changes, it is
possible to reduce their importance by using softer interaction
energy functions. A soft scoring function increases the chances
of not overlooking good solutions.
50
Soft Van der Waals Repulsion Functions
๎€Œ When calculated with force fields from molecular mechanics,
steric clashes correspond to high energies
๎€Œ Modifying the normal Van der Waals repulsion function (in blue)
into a softer curve (such as the yellow one) enables them to be
less dominant and to simulate the plasticity of the receptor
without changing its geometry
Fig. 2: Another approach
implemented in AutoDock software
51
Problems with Soft Scoring
๎€Œ The major disadvantage of the soft scoring approach is the large
number of false-positive hits it produces which therefore makes
it harder to discriminate the near native solution from the other
candidates
๎€Œ It has been suggested that the soft scoring function approach
should be used as a first filtering algorithm to be complemented
by more refined quantitative methods
52
Protein Side-Chains Flexibility
๎€Œ Side chains are critical for the binding of the ligand to proteins
๎€Œ Altering the side chain conformations in docking calculations
enables the maximization of favourable interactions with the
protein
๎€Œ Studies comparing the X-ray structures of complexes with that
of the corresponding unbound proteins (in protein-protein and
protein-ligand associations) reveal that about 60% of side chains
modify their conformations upon binding
53
Side Chain Rotamer Libraries
๎€Œ Exploring the conformational space of protein side chains is a
complex optimization problem that leads to a combinatorial
explosion of conformers
๎€Œ Protein side chains can be represented adequately by a small
set of discrete rotamers
๎€Œ Analysis of side-chain Ramachadran plots of pdb structures
show that 17 of the 20 amino acids can be represented
adequately by 67 side-chain rotamers
๎€Œ This approach greatly simplified the problem and enabled side-
chain flexiblity to be tackled
54
Backbone Flexibility
๎€Œ One of the greatest challenges in molecular docking is the
incorporation of backbone flexibility in docking algorithms
๎€Œ Due to the complexity level introduced by the huge number
degrees of freedom, traditional methods such as the systematic
approach or stochastic algorithms cannot be used as a general
method
55
The Multiple Protein Structure (MPS) Approach
๎€Œ The most efficient method for considering the full flexibility of
the protein is the "Multiple Protein Structure" (MPS) approach
(also called "multiple receptor structure" or "ensemble
approach" or "multiple copy approach")
๎€Œ The MPS approach is based on the use of multiple structures of
the target protein as obtained either from experimental (X-ray,
NMR) determinations or generated by theoretical simulations
(molecular dynamics)
๎€Œ The example illustrates
the CDK2 protein as
determined by seven
independent X-ray
studies
56
How the MPS are Exploited?
๎€Œ Diverse approaches have been developed to exploit multiple
protein structure (MPS):
๎€Œ Successive and Independent Docking Treatments
๎€Œ The United Protein Approach
๎€Œ The Average Grid Approach
57
Successive and Independent Docking
Treatments
๎€Œ The most trivial method of exploiting the MPS is to treat each
member of the MPS independently, by applying a rigid docking
for each protein of the ensemble
๎€Œ The advantage of this approach is its ease of implementation
since the rigid docking software does not need to be modified
58
The United Protein Approach
๎€Œ The united protein approach consists of combining the multiple
receptor conformations into a united protein description
obtained from the superimposition of all the structures of the
ensemble
๎€Œ Induced-fit is considered locally, each residue (backbone
included) in the united protein structure is independent of the
others. When a new candidate molecule is docked, the best
scoring combination for each residue is selected.
59
The Average Grid Approach
๎€Œ A grid is used to characterize the shape and 3D specificity of
each protein of the ensemble. The space is systematically
explored by calculating the interaction energy (generally Van
der Waals and electrostatic energies) between a chemical probe
and each protein structure, at each grid point
๎€Œ The multiple structures are aligned in 3D, the information from
aligned multiple protein structures is combined into "energy-
weighted" averages of the interaction energies and "geometry-
weighted" averages.
60
Average Grid Approach vs. Soft Scoring
๎€Œ The average grid approach can be considered as an
improvement on soft-scoring function calculations. Both
methods alter the scoring function to allow for slight
penetrations between the interacting molecules. In the average
grid approach, information from the MPS results from many local
scoring functions, depending on the flexibility regions of the
protein; whereas in the soft-docking approach a mathematical
trick is used to modify the scoring function globally.
61
Domain Movements
๎€Œ Domains motions are often key determinants in the mechanism
and the functions of a protein
๎€Œ Three mechanisms were identified in the movement of domains:
๎€Œ intrinsic flexibility can lead some proteins to encounter large
motions of domains
๎€Œ hinged domain movements are similar to rotations around an
articulated joint, in that they involve a small number of residues
๎€Œ ball-and-socket motions - involve the rotation of a variable
domain with respect to a constant one by a combination of
hinge and shear motions
๎€Œ It is still a challenge to simulate this type of flexibility in
computational docking
62
Computational Docking in Drug Discovery
63
Computational Docking in Drug Discovery
๎€Œ Docking methods are used by scientists dealing with 3D
mechanisms occurring in cellular events: molecular modelers and
computational chemists use docking for drug discovery,
biochemists to elucidate mechanisms of action, crystallographers
for structure refinement, combinatorial chemists for designing
new libraries etc...
๎€Œ Docking has become a key tool in the pharmaceutical and biotech
industry
๎€Œ Typical applications of molecular docking in drug discovery:
๎€Œ Virtual Screening
๎€Œ Lead Hopping
๎€Œ Increasing HTS hit rates
64
Virtual Screening
๎€Œ When the goal of docking is to dock all the compounds of a library
(the molecules being available or not yet synthesized), the
process is called virtual screening or high throughput docking
๎€Œ Virtual screening identifies active compounds in a large database
and ranks them by their affinity to the receptor
65
Lead Hopping
๎€Œ Based on the structure of an active compound, "lead hopping"
consists of the identification of novel structures with different
topologies that still show the same activity
๎€Œ Molecular docking can be used for that purpose
๎€Œ The resulting molecule has a novel structure and may show
increased activities, as compared to that of the initial lead
66
Increasing HTS Hit Rates
๎€Œ The most widely used type of docking today involves the
selection of molecules to be processed for subsequent high
through-put screening (HTS)
๎€Œ The method is not used to recognize active molecules but to
eliminate those that are likely to be inactive
67
Limitations in Computational Docking
๎€Œ Computational docking has emerged recently as a new discipline.
Despite the important achievements that have been obtained,
substantial progress remains to be made to exploit the full
potential of this approach
๎€Œ Current challenges of docking methods are:
โ€ข Trade off between efficiency and accuracy
โ€ข More effective scoring functions
โ€ข Better model of flexibility

More Related Content

What's hot

3 d qsar approaches structure
3 d qsar approaches structure3 d qsar approaches structure
3 d qsar approaches structureROHIT PAL
ย 
Virtual screening techniques
Virtual screening techniquesVirtual screening techniques
Virtual screening techniquesROHIT PAL
ย 
Virtual sreening
Virtual sreeningVirtual sreening
Virtual sreeningMahendra G S
ย 
Structure based in silico virtual screening
Structure based in silico virtual screeningStructure based in silico virtual screening
Structure based in silico virtual screeningJoon Jyoti Sahariah
ย 
Presentation on insilico drug design and virtual screening
Presentation on insilico drug design and virtual screeningPresentation on insilico drug design and virtual screening
Presentation on insilico drug design and virtual screeningJoon Jyoti Sahariah
ย 
Fragment based drug design complementary tool for drug design
Fragment based drug design  complementary tool for drug designFragment based drug design  complementary tool for drug design
Fragment based drug design complementary tool for drug designNIPER hyderabad
ย 
Lecture 4 ligand based drug design
Lecture 4 ligand based drug designLecture 4 ligand based drug design
Lecture 4 ligand based drug designRAJAN ROLTA
ย 
In silico drug desigining
In silico drug desiginingIn silico drug desigining
In silico drug desiginingDevesh Shukla
ย 
Coupling Reactions
Coupling ReactionsCoupling Reactions
Coupling ReactionsShafnaJose
ย 
Quantitative Structure Activity Relationship
Quantitative Structure Activity RelationshipQuantitative Structure Activity Relationship
Quantitative Structure Activity RelationshipRaniBhagat1
ย 
Peptide therapeutics
Peptide therapeuticsPeptide therapeutics
Peptide therapeuticsGurwinder97
ย 
Pharmacophore
PharmacophorePharmacophore
Pharmacophoresachin panwar
ย 
Homology modelling
Homology modellingHomology modelling
Homology modellingAyesha Choudhury
ย 
Molecular docking
Molecular dockingMolecular docking
Molecular dockingRahul B S
ย 
High Throughput Screening
High Throughput ScreeningHigh Throughput Screening
High Throughput ScreeningDr Debasish Pradhan
ย 
Process chemistry
Process chemistryProcess chemistry
Process chemistryDivya V
ย 

What's hot (20)

3 d qsar approaches structure
3 d qsar approaches structure3 d qsar approaches structure
3 d qsar approaches structure
ย 
Homology modeling
Homology modelingHomology modeling
Homology modeling
ย 
Virtual screening techniques
Virtual screening techniquesVirtual screening techniques
Virtual screening techniques
ย 
Virtual sreening
Virtual sreeningVirtual sreening
Virtual sreening
ย 
Structure based in silico virtual screening
Structure based in silico virtual screeningStructure based in silico virtual screening
Structure based in silico virtual screening
ย 
Presentation on insilico drug design and virtual screening
Presentation on insilico drug design and virtual screeningPresentation on insilico drug design and virtual screening
Presentation on insilico drug design and virtual screening
ย 
Fragment based drug design complementary tool for drug design
Fragment based drug design  complementary tool for drug designFragment based drug design  complementary tool for drug design
Fragment based drug design complementary tool for drug design
ย 
ce ms.pptx
ce ms.pptxce ms.pptx
ce ms.pptx
ย 
Lecture 4 ligand based drug design
Lecture 4 ligand based drug designLecture 4 ligand based drug design
Lecture 4 ligand based drug design
ย 
In silico drug desigining
In silico drug desiginingIn silico drug desigining
In silico drug desigining
ย 
Coupling Reactions
Coupling ReactionsCoupling Reactions
Coupling Reactions
ย 
Quantitative Structure Activity Relationship
Quantitative Structure Activity RelationshipQuantitative Structure Activity Relationship
Quantitative Structure Activity Relationship
ย 
Peptide therapeutics
Peptide therapeuticsPeptide therapeutics
Peptide therapeutics
ย 
Pharmacophore
PharmacophorePharmacophore
Pharmacophore
ย 
3d qsar
3d qsar3d qsar
3d qsar
ย 
Homology modelling
Homology modellingHomology modelling
Homology modelling
ย 
microarrary
microarrarymicroarrary
microarrary
ย 
Molecular docking
Molecular dockingMolecular docking
Molecular docking
ย 
High Throughput Screening
High Throughput ScreeningHigh Throughput Screening
High Throughput Screening
ย 
Process chemistry
Process chemistryProcess chemistry
Process chemistry
ย 

Similar to Structural Bioinformatics.pdf

Pharmacophore Modeling and Docking Techniques.ppt
Pharmacophore Modeling and Docking Techniques.pptPharmacophore Modeling and Docking Techniques.ppt
Pharmacophore Modeling and Docking Techniques.pptDrVivekChauhan1
ย 
cadd-191129134050 (1).pptx
cadd-191129134050 (1).pptxcadd-191129134050 (1).pptx
cadd-191129134050 (1).pptxNoorelhuda2
ย 
43_EMIJ-06-00212.pdf
43_EMIJ-06-00212.pdf43_EMIJ-06-00212.pdf
43_EMIJ-06-00212.pdfUmeshYadava1
ย 
MOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptx
MOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptxMOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptx
MOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptxPranavi Uppuluri
ย 
Applied Bioinformatics Assignment 5docx
Applied Bioinformatics Assignment  5docxApplied Bioinformatics Assignment  5docx
Applied Bioinformatics Assignment 5docxUniversity of Allahabad
ย 
Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...
Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...
Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...ijtsrd
ย 
Basics Of Molecular Docking
Basics Of Molecular DockingBasics Of Molecular Docking
Basics Of Molecular DockingSatarupa Deb
ย 
Project report: Investigating the effect of cellular objectives on genome-sca...
Project report: Investigating the effect of cellular objectives on genome-sca...Project report: Investigating the effect of cellular objectives on genome-sca...
Project report: Investigating the effect of cellular objectives on genome-sca...Jarle Pahr
ย 
MOLECULAR DOCKING.pptx
MOLECULAR DOCKING.pptxMOLECULAR DOCKING.pptx
MOLECULAR DOCKING.pptxSOREMEKUNOLADIMEJI
ย 
Assignment 105B.pptx
Assignment 105B.pptxAssignment 105B.pptx
Assignment 105B.pptxRajendraRawat27
ย 
Criterion based Two Dimensional Protein Folding Using Extended GA
Criterion based Two Dimensional Protein Folding Using Extended GA Criterion based Two Dimensional Protein Folding Using Extended GA
Criterion based Two Dimensional Protein Folding Using Extended GA IJCSEIT Journal
ย 
Limitations & lessons in the use of x ray structural information in drug design
Limitations & lessons in the use of x ray structural information in drug designLimitations & lessons in the use of x ray structural information in drug design
Limitations & lessons in the use of x ray structural information in drug designDilip Darade
ย 
Java tutorial: Programmatic Access to Molecular Interactions
Java tutorial: Programmatic Access to Molecular InteractionsJava tutorial: Programmatic Access to Molecular Interactions
Java tutorial: Programmatic Access to Molecular InteractionsRafael C. Jimenez
ย 
Molecular docking.pptx
Molecular docking.pptxMolecular docking.pptx
Molecular docking.pptxDiptanshuSawai
ย 
Protdock - Aatu Kaapro
Protdock - Aatu KaaproProtdock - Aatu Kaapro
Protdock - Aatu KaaproSwapnesh Singh
ย 
Molecular docking.pptx
Molecular docking.pptxMolecular docking.pptx
Molecular docking.pptxdineshkumar4566
ย 
Structure based drug design
Structure based drug designStructure based drug design
Structure based drug designADAM S
ย 
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...ijsc
ย 
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...ijsc
ย 

Similar to Structural Bioinformatics.pdf (20)

CADD
CADDCADD
CADD
ย 
Pharmacophore Modeling and Docking Techniques.ppt
Pharmacophore Modeling and Docking Techniques.pptPharmacophore Modeling and Docking Techniques.ppt
Pharmacophore Modeling and Docking Techniques.ppt
ย 
cadd-191129134050 (1).pptx
cadd-191129134050 (1).pptxcadd-191129134050 (1).pptx
cadd-191129134050 (1).pptx
ย 
43_EMIJ-06-00212.pdf
43_EMIJ-06-00212.pdf43_EMIJ-06-00212.pdf
43_EMIJ-06-00212.pdf
ย 
MOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptx
MOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptxMOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptx
MOLECULAR DOCKING IN DRUG DESIGN AND DEVELOPMENT BY PRANAVI linkedin.pptx
ย 
Applied Bioinformatics Assignment 5docx
Applied Bioinformatics Assignment  5docxApplied Bioinformatics Assignment  5docx
Applied Bioinformatics Assignment 5docx
ย 
Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...
Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...
Review on Computational Bioinformatics and Molecular Modelling Novel Tool for...
ย 
Basics Of Molecular Docking
Basics Of Molecular DockingBasics Of Molecular Docking
Basics Of Molecular Docking
ย 
Project report: Investigating the effect of cellular objectives on genome-sca...
Project report: Investigating the effect of cellular objectives on genome-sca...Project report: Investigating the effect of cellular objectives on genome-sca...
Project report: Investigating the effect of cellular objectives on genome-sca...
ย 
MOLECULAR DOCKING.pptx
MOLECULAR DOCKING.pptxMOLECULAR DOCKING.pptx
MOLECULAR DOCKING.pptx
ย 
Assignment 105B.pptx
Assignment 105B.pptxAssignment 105B.pptx
Assignment 105B.pptx
ย 
Criterion based Two Dimensional Protein Folding Using Extended GA
Criterion based Two Dimensional Protein Folding Using Extended GA Criterion based Two Dimensional Protein Folding Using Extended GA
Criterion based Two Dimensional Protein Folding Using Extended GA
ย 
Limitations & lessons in the use of x ray structural information in drug design
Limitations & lessons in the use of x ray structural information in drug designLimitations & lessons in the use of x ray structural information in drug design
Limitations & lessons in the use of x ray structural information in drug design
ย 
Java tutorial: Programmatic Access to Molecular Interactions
Java tutorial: Programmatic Access to Molecular InteractionsJava tutorial: Programmatic Access to Molecular Interactions
Java tutorial: Programmatic Access to Molecular Interactions
ย 
Molecular docking.pptx
Molecular docking.pptxMolecular docking.pptx
Molecular docking.pptx
ย 
Protdock - Aatu Kaapro
Protdock - Aatu KaaproProtdock - Aatu Kaapro
Protdock - Aatu Kaapro
ย 
Molecular docking.pptx
Molecular docking.pptxMolecular docking.pptx
Molecular docking.pptx
ย 
Structure based drug design
Structure based drug designStructure based drug design
Structure based drug design
ย 
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
ย 
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
A Multiset Rule Based Petri net Algorithm for the Synthesis and Secretary Pat...
ย 

Recently uploaded

Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptxVS Mahajan Coaching Centre
ย 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxthorishapillay1
ย 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxNirmalaLoungPoorunde1
ย 
Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Celine George
ย 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxmanuelaromero2013
ย 
Hierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of managementHierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of managementmkooblal
ย 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon AUnboundStockton
ย 
18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdf18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdfssuser54595a
ย 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxSayali Powar
ย 
Pharmacognosy Flower 3. Compositae 2023.pdf
Pharmacognosy Flower 3. Compositae 2023.pdfPharmacognosy Flower 3. Compositae 2023.pdf
Pharmacognosy Flower 3. Compositae 2023.pdfMahmoud M. Sallam
ย 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxOH TEIK BIN
ย 
Meghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media ComponentMeghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media ComponentInMediaRes1
ย 
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupMARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupJonathanParaisoCruz
ย 
Blooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docxBlooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docxUnboundStockton
ย 
Gas measurement O2,Co2,& ph) 04/2024.pptx
Gas measurement O2,Co2,& ph) 04/2024.pptxGas measurement O2,Co2,& ph) 04/2024.pptx
Gas measurement O2,Co2,& ph) 04/2024.pptxDr.Ibrahim Hassaan
ย 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfSumit Tiwari
ย 
Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Celine George
ย 
OS-operating systems- ch04 (Threads) ...
OS-operating systems- ch04 (Threads) ...OS-operating systems- ch04 (Threads) ...
OS-operating systems- ch04 (Threads) ...Dr. Mazin Mohamed alkathiri
ย 

Recently uploaded (20)

Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
ย 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptx
ย 
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini  Delhi NCR9953330565 Low Rate Call Girls In Rohini  Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
ย 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
ย 
Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17
ย 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
ย 
Hierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of managementHierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of management
ย 
Model Call Girl in Tilak Nagar Delhi reach out to us at ๐Ÿ”9953056974๐Ÿ”
Model Call Girl in Tilak Nagar Delhi reach out to us at ๐Ÿ”9953056974๐Ÿ”Model Call Girl in Tilak Nagar Delhi reach out to us at ๐Ÿ”9953056974๐Ÿ”
Model Call Girl in Tilak Nagar Delhi reach out to us at ๐Ÿ”9953056974๐Ÿ”
ย 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon A
ย 
18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdf18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAะกY_INDEX-DM_23-1-final-eng.pdf
ย 
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptxPOINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
ย 
Pharmacognosy Flower 3. Compositae 2023.pdf
Pharmacognosy Flower 3. Compositae 2023.pdfPharmacognosy Flower 3. Compositae 2023.pdf
Pharmacognosy Flower 3. Compositae 2023.pdf
ย 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptx
ย 
Meghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media ComponentMeghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media Component
ย 
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized GroupMARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized Group
ย 
Blooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docxBlooming Together_ Growing a Community Garden Worksheet.docx
Blooming Together_ Growing a Community Garden Worksheet.docx
ย 
Gas measurement O2,Co2,& ph) 04/2024.pptx
Gas measurement O2,Co2,& ph) 04/2024.pptxGas measurement O2,Co2,& ph) 04/2024.pptx
Gas measurement O2,Co2,& ph) 04/2024.pptx
ย 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
ย 
Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17
ย 
OS-operating systems- ch04 (Threads) ...
OS-operating systems- ch04 (Threads) ...OS-operating systems- ch04 (Threads) ...
OS-operating systems- ch04 (Threads) ...
ย 

Structural Bioinformatics.pdf

  • 2. 2 Molecular Recognition, Molecular Docking ๎€Œ Molecular recognition is the ability of biomolecules to recognize other biomolecules and selectively interact with them in order to promote fundamental biological events such as transcription, translation, signal transduction, transport, regulation, enzymatic catalysis, viral and bacterial infection and immune response. ๎€Œ Molecular docking is the process that involves placing molecules in appropriate configurations to interact with a receptor. Molecular docking is a natural process which occurs within seconds in a cell. ๎€Œ In molecular modeling the term โ€œmolecular dockingโ€ refers to the study of how two or more molecular structures fit together
  • 3. 3 Understanding Molecular Recognition ๎€Œ Understanding the principles of molecular recognition at the molecular level is essential to a good understanding of molecular function and biological process ๎€Œ Knowledge of the mechanical features of a biological signal can be used to design novel therapeutic agents
  • 4. 4 Molecular Docking Models ๎€Œ Over the years biochemists have developed numerous models to capture the key elements of the molecular recognition process. Although very simplified, these models have proven highly useful to the scientific community.
  • 5. 5 The Lock and Key Theory ๎€Œ As far back as 1890 Emil Fischer proposed a model called the "lock-and-key model" that explained how biological systems function. A substrate fits into the active site of a macromolecule, just like a key fits into a lock. Biological 'locks' have unique stereochemical features that are necessary to their function.
  • 6. 6 The Induced-Fit Theory ๎€Œ In 1958 Daniel Koshland introduced the "induced-fit theory". The basic idea is that in the recognition process, both ligand and target mutually adapt to each other through small conformational changes, until an optimal fit is achieved.
  • 7. 7 The Conformation Ensemble Model ๎€Œ In addition to small induced-fit adaptation, it has been observed that proteins can undergo much larger conformational changes. A recent model describes proteins as a pre-existing ensemble of conformational states. The plasticity of the protein allows it to switch from one state to another.
  • 8. 8 From the Lock and Key to the Ensemble Model ๎€Œ Lock-and-key, induced-fit and the conformation ensemble model are not contradictory. Each one focuses on a particular aspect of the recognition process. The lock-and-key model introduces the principle of 3D complementarity, the induced-fit model explains how complementarity is achieved, and the ensemble model depicts the conformational complexity of proteins.
  • 9. 9 Experimental Methods to Study Molecular Docking ๎€Œ Experimental techniques for study molecular recognition include X-ray crystallography, NMR, electron microscopy, site directed mutagenesis, co-immuno-precipitation etc... ๎€Œ They allow us to experimentally solve the detailed 3โ€‘dimensional structures of biomolecules in their association form which is a necessary step in identifying crucial residues, study the strength of interaction forces, their energetics, understand how molecular structures fit together, and investigate mechanisms of action
  • 10. 10 A Bottleneck in Drug Discovery ๎€Œ Due to the limitations of current experimental methods, 3D structures of complexes are rarely available. But knowledge of the separated molecules in 3D is only weakly informative if we do not know how to assemble them.
  • 11. 11 Triggering the Computational Docking Discipline ๎€Œ The difficulties in obtaining experimentally structural data of macromolecular complexes have triggered the development of computational predictive methods ๎€Œ Computational docking (also called in silico molecular docking or just docking) is a computational science aiming at predicting the optimal binding orientation and conformation of interacting molecules in space, and to estimate the stability of their complex ๎€Œ Molecular docking predicts whether or not the two molecules interact, the binding affinity and the 3D structure of the complex ๎€Œ Computational docking is an essential component in modern drug discovery. Over the last few decades, it has been routinely and successfully applied in most pharmaceutical and biotech companies for a large number of applications.
  • 12. 12 Docking Classification ๎€Œ Molecular docking classifies biomolecules into three categories: small molecules (also called 'ligands'), proteins, and nucleic acids ๎€Œ The most important types of docking systems are: protein- ligand, protein-protein and nucleic acid-protein ๎€Œ The interactions between a small molecule and a protein are by far much better understood than those between a protein and a nucleic acid
  • 13. 13 Definition of the "Pose" ๎€Œ A "pose" is a term widely adopted for describing the geometry of a particular complex (also called "binding mode") ๎€Œ It refers to a precise configuration which is characterized not only by the relative orientation of the docked molecules but also their respective conformations
  • 14. 14 Molecular Complementarity in Computational Docking ๎€Œ Computational docking exploit the concept of molecular complementarity. The structures interact like a hand in a glove, where both the shape and the physico-chemical properties of the structures contribute to the fit. ๎€Œ Shape complementarity is the primary criterion for evaluating the fit in the computational docking of two candidate structures ๎€Œ In addition to shape compatibility, chemical and physico- chemical complementarity are also important criteria in the docking between candidate structures
  • 15. 15 Energy Dictates Molecular Associations ๎€Œ The process of "self-assembly" is dictated by forces that are energy based: the complex has a lower potential energy than its constituent parts, and this keeps the parts together ๎€Œ The goal of computational docking is to find the 3D configuration of the complex that minimizes the energy
  • 16. 16 Molecular Flexibility in Protein-Ligand Docking ๎€Œ The mutual adaptation of a ligand with its receptor is crucial to understanding ligand binding and protein function ๎€Œ One of the major challenges in molecular docking is how to account for this adaptation in docking calculations ๎€Œ The docking problem can be classified according to the way flexibility is modeled. In ascending order of complexity: 1. Rigid body docking ignores the flexibility of the molecules and treats them like rigid objects 2. Rigid receptor โ€“ flexible ligand docking: only the ligand is treated as flexible, receptor is rigid 3. Flexible receptor โ€“ flexible ligand docking: both protein and ligand are treated as flexible.
  • 17. 17 Molecular Flexibility in Protein-Ligand Docking
  • 18. 18 Three Components of Docking Software ๎€Œ Docking software can be categorised based on the following criteria: 1. Molecular representation - a way to represent structures and properties (atomic, surface, grid representation) 2. Scoring method - a method to assess the quality of docked complexes (force field, knowledge-based approach, ...) 3. Searching algorithm - an efficient search algorithm that decides which poses to generate (exhaustive search, Monte Carlo, genetic algorithms, simulated annealing, tabu search)
  • 20. 20 Molecular Representation ๎€Œ There are three representations commonly used in docking programs: ๎€Œ the atomic representation (the most common) ๎€Œ the surface representation ๎€Œ the grid representation ๎€Œ The choice of representation dictates the way the docking problem will be tackled
  • 21. 21 Atomic Representation ๎€Œ In atomic representation, each atom is characterized by its coordinates and atom-type
  • 22. 22 Protein Preparation ๎€Œ The preparation of the protein calls for great care. Important decisions include the choice of the tautomeric forms of histidine residues, the protonation states of amino-acids and conformations of some residues; their incorrect assignments may lead to docking errors.
  • 23. 23 Small Molecule Preparation ๎€Œ Before generating and docking the 3D structures of a library of ligands, it is important to "clean up" the 2D structures being used by removing any counter ions, salts, or water molecules that might be part of the registered structure ๎€Œ All reactive or otherwise undesirable compounds must also be removed ๎€Œ Possibly generate all optical isomers (enantiomers), cis/trans isomers, tautomers, and protonation states of the structures ๎€Œ For most docking programs the tautomeric and protonation state of the ligands to be docked is defined by the user; in general the structure considered to be dominant at a neutral pH is generated; here also, incorrect assignments may lead to docking errors
  • 24. 24 Small Molecule Preparation Tautomers generation Salt removing Optical isomers (enantiomers) generation Double bond cis/trans isomers generation
  • 26. 26 Scoring Methods ๎€Œ Scoring methods aim at assessing the quality of docked complexes and guiding the docking algorithm ๎€Œ The binding process that leads to the formation of a complex between a ligand and its receptor is controlled by several factors including: 1. the interaction energies between the two molecules 2. the desolvation and solvation energies associated with the interacting molecules 3. the entropic factors that occur upon binding ๎€Œ The final free energy of binding will depend on the overall balance of these factors
  • 27. 27 Interaction Energies ๎€Œ The interaction forces between two molecules can be divided into: โ— Electrostatic interactions โ— Hydrogen bond interactions โ— Van der Waals interactions โ— Hydrophobic forces
  • 28. 28 Desolvation Energies ๎€Œ The binding of a ligand to a protein is a complex process influenced by desolvation and solvation phenomena where the interacting entities become partially desolvated ๎€Œ This thermodynamically driven chain of events leads to the formation of favorable interactions between the ligand and the protein where hydrophobic contacts are the driving forces: hydrophobic moieties associate together to reduce the interactions with the surrounding water ๎€Œ Another important energy term is electrostatic interaction between charged atoms and water molecules
  • 29. 29 Entropic Effects ๎€Œ The flexibility of the molecules and the consequences in terms of entropy can have a significant impact on the binding energy of a ligand
  • 30. 30 Calculation of the Binding Energies ๎€Œ The binding energy ฮ”Gbinding is the energy required to separate a complex into separate parts (protein and ligand). It is defined as the difference between the energy of the associated (bound) form (Ecomplex) and that of the separated (unbound) molecules (Eprotein and Eligand). ๎€Œ A complex has a lower potential energy than its constituent parts. This is what keeps them together.
  • 31. 31 Force-Field Calculations ๎€Œ Molecular mechanics can be used to estimate the internal energy of the system, which makes it useful for calculating ฮ”G ๎€Œ The total energy of a system is described as the sum of the independent terms of the force field ๎€Œ The energies obtained by force field methods can be used directly to approximate free energies of binding
  • 33. 33 Rigid Docking Methods ๎€Œ If we assume that the molecules are rigid, we are then looking for a transformation in 3D space of one of the molecules which brings it into optimal fit with the other molecule in terms of a scoring function ๎€Œ In rigid-body docking, the search space is restricted to three rotational and three translational degrees of freedom
  • 34. 34 Two Docking Philosophies ๎€Œ A large number of docking approaches have been developed to predict the formation of molecular complexes. They can be divided into two broad classes that correspond to two different philosophies: ๎€Œ Feature-based matching matches local complementarity features among molecules involved in the recognition ๎€Œ Stepwise search explores the 'search space' guided by a scoring function
  • 35. 35 Components of Feature-Based Matching Methods ๎€Œ The way feature-based matching applies to the docking problem is similar to solving a jigsaw puzzle. You pick a piece and look for a complementary one from among the rest of the pieces (feature extraction). Once a piece is found (feature matching), the elements are assembled (transformation), the solution is then assessed globally for final approval of the compatibility (filtering and scoring).
  • 36. 36 The Stepwise Search Approach ๎€Œ The stepwise search approach tries to explore the search space (defined as the set of all possible solutions), with the hope of finding an optimal solution ๎€Œ The approach is driven by a scoring function which guides the search algorithm ๎€Œ In computational docking the stepwise search involves two components: 1. A positioning module which generates new complex arrangements 2. A scoring module that assesses the quality of each individual arrangement ๎€Œ The positioning module is directly connected to the search module, which dictates the configuration of the next pose to be generated (by appropriate search algorithm) ๎€Œ In rigid-body docking the variables to optimize are the three rotation angles and the three translation parameters
  • 37. 37 Search Algorithms ๎€Œ The following approaches are used in computational docking: ๎€Œ Exhaustive search (for small systems only) ๎€Œ Monte Carlo ๎€Œ Genetic Algorithms ๎€Œ Simulated Annealing ๎€Œ Tabu searches ๎€Œ Tabu search (TS) is a stochastic searching algorithm that maintains a list of previously visited poses. These poses are forbidden and cannot be revisited (they are "taboo"). TS effectively guides the search process into unvisited areas of the space.
  • 39. 39 Degrees of Freedom in Flexible Docking ๎€Œ The rigid-body docking approaches are often not sufficient to predict the structure of a protein complex from the separate unbound structures ๎€Œ The incorporation of molecular flexibility into docking algorithms requires to add conformational degrees of freedom to translations and rotations ๎€Œ Approximation algorithms need to be introduced to reduce the dimensionality of the problem and produce acceptable results within a reasonable computing time
  • 40. 40 Methods for Handling Ligand Flexibility ๎€Œ Many methods have been developed for incorporating flexible small molecules into docking software; they include: 1. Ligand-ensemble docking method 2. Fragmentation method 3. Stochastic conformational search method
  • 41. 41 Ligand-Ensemble Docking Method ๎€Œ The simplest method to account for small molecule flexibility is to consider it as an "ensemble" of rigid and independent ligand conformations ๎€Œ In the first step low energy conformers of ligand are generated by conformational analysis ๎€Œ In the second step, rigid docking is applied for each conformer independently in order to find the most favorable small molecule-protein complex
  • 42. 42 The Fragmentation Docking Method ๎€Œ Fragmentation methods break down the molecule into small rigid fragments, the fragments are then reassembled in the binding pocket ๎€Œ Two different approaches are used for reassembling the disconnected moieties: the place-and-join and the incremental approach
  • 43. 43 Place-and-Join Algorithm ๎€Œ The place-and-join method splits the molecule into rigid subparts ๎€Œ Each subpart is docked independently ๎€Œ Assembly of the fragments is then done by looking at their relative location and assessing the possibility of re-connecting them with the connectivity of the initial molecule, in geometrically correct conformations
  • 44. 44 Incremental-Based Methods ๎€Œ The incremental based approach starts with an initial core docked in the active site, and new fragments are progressively added and minimized; the treatment is terminated when the entire molecule is formed
  • 45. 45 Incremental Algorithm ๎€Œ The main problem of incremental construction algorithms is their dependence on the choice of the first fragment to be docked, which requires an exploration of several possibilities ๎€Œ In the example below the initial rigid fragment has been docked three times (A, B, C). For each one, we have a set of potential solutions that can be generated. Each intermediate level is extended to the next one by adding a new next fragment in all possible configurations. Solutions with a bad score are eliminated.
  • 46. 46 Stochastic Search Methods ๎€Œ Stochastic search methods modify the conformation of the small molecule in the receptor site and assess it on the fly ๎€Œ In the case of genetic algorithms, the torsion angles are added on the chromosomes; in Monte Carlo based methods they are set as parameters for optimization
  • 48. 48 Incorporating Protein Flexibility ๎€Œ Incorporating protein flexibility into molecular docking software is a difficult optimization problem involving a huge number of degrees of freedom that represent the receptor flexibility ๎€Œ For practical reasons, four types of protein flexibility are recognized: โ— small atom fluctuations (solved by soft docking methods) โ— side-chain flexibility โ— backbone flexibility โ— domain movements
  • 49. 49 Flexibility Through Soft Docking Methods ๎€Œ The simple approach to tackle the protein flexibility problem is the 'soft docking' method ๎€Œ It allows for slight penetrations between the receptor and the ligand molecules; this is a mathematical trick where the receptor and the ligand are held rigid and a 'soft' scoring function is used, allowing some overlap between them. ๎€Œ In the example below, the fit between the substrate and the protein is acceptable, except however for a bump with the phenyl group. The idea behind a soft scoring function is that instead of resolving bumps by conformational changes, it is possible to reduce their importance by using softer interaction energy functions. A soft scoring function increases the chances of not overlooking good solutions.
  • 50. 50 Soft Van der Waals Repulsion Functions ๎€Œ When calculated with force fields from molecular mechanics, steric clashes correspond to high energies ๎€Œ Modifying the normal Van der Waals repulsion function (in blue) into a softer curve (such as the yellow one) enables them to be less dominant and to simulate the plasticity of the receptor without changing its geometry Fig. 2: Another approach implemented in AutoDock software
  • 51. 51 Problems with Soft Scoring ๎€Œ The major disadvantage of the soft scoring approach is the large number of false-positive hits it produces which therefore makes it harder to discriminate the near native solution from the other candidates ๎€Œ It has been suggested that the soft scoring function approach should be used as a first filtering algorithm to be complemented by more refined quantitative methods
  • 52. 52 Protein Side-Chains Flexibility ๎€Œ Side chains are critical for the binding of the ligand to proteins ๎€Œ Altering the side chain conformations in docking calculations enables the maximization of favourable interactions with the protein ๎€Œ Studies comparing the X-ray structures of complexes with that of the corresponding unbound proteins (in protein-protein and protein-ligand associations) reveal that about 60% of side chains modify their conformations upon binding
  • 53. 53 Side Chain Rotamer Libraries ๎€Œ Exploring the conformational space of protein side chains is a complex optimization problem that leads to a combinatorial explosion of conformers ๎€Œ Protein side chains can be represented adequately by a small set of discrete rotamers ๎€Œ Analysis of side-chain Ramachadran plots of pdb structures show that 17 of the 20 amino acids can be represented adequately by 67 side-chain rotamers ๎€Œ This approach greatly simplified the problem and enabled side- chain flexiblity to be tackled
  • 54. 54 Backbone Flexibility ๎€Œ One of the greatest challenges in molecular docking is the incorporation of backbone flexibility in docking algorithms ๎€Œ Due to the complexity level introduced by the huge number degrees of freedom, traditional methods such as the systematic approach or stochastic algorithms cannot be used as a general method
  • 55. 55 The Multiple Protein Structure (MPS) Approach ๎€Œ The most efficient method for considering the full flexibility of the protein is the "Multiple Protein Structure" (MPS) approach (also called "multiple receptor structure" or "ensemble approach" or "multiple copy approach") ๎€Œ The MPS approach is based on the use of multiple structures of the target protein as obtained either from experimental (X-ray, NMR) determinations or generated by theoretical simulations (molecular dynamics) ๎€Œ The example illustrates the CDK2 protein as determined by seven independent X-ray studies
  • 56. 56 How the MPS are Exploited? ๎€Œ Diverse approaches have been developed to exploit multiple protein structure (MPS): ๎€Œ Successive and Independent Docking Treatments ๎€Œ The United Protein Approach ๎€Œ The Average Grid Approach
  • 57. 57 Successive and Independent Docking Treatments ๎€Œ The most trivial method of exploiting the MPS is to treat each member of the MPS independently, by applying a rigid docking for each protein of the ensemble ๎€Œ The advantage of this approach is its ease of implementation since the rigid docking software does not need to be modified
  • 58. 58 The United Protein Approach ๎€Œ The united protein approach consists of combining the multiple receptor conformations into a united protein description obtained from the superimposition of all the structures of the ensemble ๎€Œ Induced-fit is considered locally, each residue (backbone included) in the united protein structure is independent of the others. When a new candidate molecule is docked, the best scoring combination for each residue is selected.
  • 59. 59 The Average Grid Approach ๎€Œ A grid is used to characterize the shape and 3D specificity of each protein of the ensemble. The space is systematically explored by calculating the interaction energy (generally Van der Waals and electrostatic energies) between a chemical probe and each protein structure, at each grid point ๎€Œ The multiple structures are aligned in 3D, the information from aligned multiple protein structures is combined into "energy- weighted" averages of the interaction energies and "geometry- weighted" averages.
  • 60. 60 Average Grid Approach vs. Soft Scoring ๎€Œ The average grid approach can be considered as an improvement on soft-scoring function calculations. Both methods alter the scoring function to allow for slight penetrations between the interacting molecules. In the average grid approach, information from the MPS results from many local scoring functions, depending on the flexibility regions of the protein; whereas in the soft-docking approach a mathematical trick is used to modify the scoring function globally.
  • 61. 61 Domain Movements ๎€Œ Domains motions are often key determinants in the mechanism and the functions of a protein ๎€Œ Three mechanisms were identified in the movement of domains: ๎€Œ intrinsic flexibility can lead some proteins to encounter large motions of domains ๎€Œ hinged domain movements are similar to rotations around an articulated joint, in that they involve a small number of residues ๎€Œ ball-and-socket motions - involve the rotation of a variable domain with respect to a constant one by a combination of hinge and shear motions ๎€Œ It is still a challenge to simulate this type of flexibility in computational docking
  • 62. 62 Computational Docking in Drug Discovery
  • 63. 63 Computational Docking in Drug Discovery ๎€Œ Docking methods are used by scientists dealing with 3D mechanisms occurring in cellular events: molecular modelers and computational chemists use docking for drug discovery, biochemists to elucidate mechanisms of action, crystallographers for structure refinement, combinatorial chemists for designing new libraries etc... ๎€Œ Docking has become a key tool in the pharmaceutical and biotech industry ๎€Œ Typical applications of molecular docking in drug discovery: ๎€Œ Virtual Screening ๎€Œ Lead Hopping ๎€Œ Increasing HTS hit rates
  • 64. 64 Virtual Screening ๎€Œ When the goal of docking is to dock all the compounds of a library (the molecules being available or not yet synthesized), the process is called virtual screening or high throughput docking ๎€Œ Virtual screening identifies active compounds in a large database and ranks them by their affinity to the receptor
  • 65. 65 Lead Hopping ๎€Œ Based on the structure of an active compound, "lead hopping" consists of the identification of novel structures with different topologies that still show the same activity ๎€Œ Molecular docking can be used for that purpose ๎€Œ The resulting molecule has a novel structure and may show increased activities, as compared to that of the initial lead
  • 66. 66 Increasing HTS Hit Rates ๎€Œ The most widely used type of docking today involves the selection of molecules to be processed for subsequent high through-put screening (HTS) ๎€Œ The method is not used to recognize active molecules but to eliminate those that are likely to be inactive
  • 67. 67 Limitations in Computational Docking ๎€Œ Computational docking has emerged recently as a new discipline. Despite the important achievements that have been obtained, substantial progress remains to be made to exploit the full potential of this approach ๎€Œ Current challenges of docking methods are: โ€ข Trade off between efficiency and accuracy โ€ข More effective scoring functions โ€ข Better model of flexibility