ArticleslgStudy

chemistry

Scoring functions for docking

Scoring functions for docking is a chemistry topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Scoring functions for docking rather than just read about it. In short: In the fields of computational chemistry and molecular modelling, scoring functions are mathematical functions used to approximately predict the binding affinity between two molecules after they have been docked. Most commonly one of the molecules is a small organic compound such as a drug and the second is the drug's biological target such as a protein receptor.

Key takeaways

  • Scoring functions for docking belongs to chemistry; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Scoring functions for docking to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Scoring functions for docking from memory before moving on to harder problems.

Reference excerpt

In the fields of computational chemistry and molecular modelling, scoring functions are mathematical functions used to approximately predict the binding affinity between two molecules after they have been docked. Most commonly one of the molecules is a small organic compound such as a drug and the second is the drug's biological target such as a protein receptor. Scoring functions have also been developed to predict the strength of intermolecular interactions between two proteins or between protein and DNA. Most scoring functions estimate some quantity related to change in Gibbs free energy in kcal/mol, so more negative scores indicate better docking, but not all scoring functions have their zero at Δ G = 0 {\displaystyle \Delta G=0} , so the sign of the score is not necessarily meaningful.

Utility Scoring functions are widely used in drug discovery and other molecular modelling applications. These include:

Virtual screening of small molecule databases of candidate ligands to identify novel small molecules that bind to a protein target of interest and therefore are useful starting points for drug discovery De novo design (design "from scratch") of novel small molecules that bind to a protein target Lead optimization of screening hits to optimize their affinity and selectivity A potentially more reliable but much more computationally demanding alternative to scoring functions are free energy perturbation calculations.

Prerequisites Scoring functions are normally parameterized (or trained) against a data set consisting of experimentally determined binding affinities between molecular species similar to the species that one wishes to predict. For currently used methods aiming to predict affinities of ligands for proteins the following must first be known or predicted:

Protein tertiary structure – arrangement of the protein atoms in three-dimensional space. Protein structures may be determined by experimental techniques such as X-ray crystallography or solution phase NMR methods or predicted by homology modelling. Ligand active conformation – three-dimensional shape of the ligand when bound to the protein Binding-mode – orientation of the two binding partners relative to each other in the complex The above information yields the three-dimensional structure of the complex. Based on this structure, the scoring function can then estimate the strength of the association between the two molecules in the complex using one of the methods outlined below. Finally the scoring function itself may be used to help predict both the binding mode and the active conformation of the small molecule in the complex, or alternatively a simpler and computationally faster function may be utilized within the docking run.

Classes There are four general classes of scoring functions:

Force field – affinities are estimated by summing the strength of intermolecular van der Waals and electrostatic interactions between all atoms of the two molecules in the complex using a force field. The intramolecular energies (also referred to as strain energy) of the two binding partners are also frequently included. Finally since the binding normally takes place in the presence of water, the desolvation energies of the ligand and of the protein are sometimes taken into account using implicit solvation methods such as GBSA or PBSA. Empirical – based on counting the number of various types of interactions between the two binding partners. Counting may be based on the number of ligand and receptor atoms in contact with each other or by calculating the change in solvent accessible surface area (ΔSASA) in the complex compared to the uncomplexed ligand and protein. The coefficients of the scoring function are usually fit using multiple linear regression methods. These interactions terms of the function may include for example: hydrophobic — hydrophobic contacts (favorable), hydrophobic — hydrophilic contacts (unfavorable) (Accounts for unmet hydrogen bonds, which are an important enthalpic contribution to binding. One lost hydrogen bond can account for 1–2 orders of magnitude in binding affinity.), number of hydrogen bonds (favorable contribution to affinity, especially if shielded from solvent, if solvent exposed no contribution), number of rotatable bonds immobilized in complex formation (unfavorable conformational entropy contribution). Knowledge-based – based on statistical observations of intermolecular close contacts in large 3D databases (such as the Cambridge Structural Database or Protein Data Bank) which are used to derive statistical "potentials of mean force". This method is founded on the assumption that close intermolecular interactions between certain types of atoms or functional groups that occur more frequently than one would expect by a random distribution are likely to be energetically favorable and therefore contribute favorably to binding affinity. Machine-learning – Unlike these classical scoring functions, machine-learning scoring functions are characterized by not assuming a predetermined functional form for the relationship between binding affinity and the structural features describing the protein-ligand complex. In this way, the functional form is inferred directly from the data. Machine-learning scoring functions have consistently been found to outperform classical scoring functions at binding affinity prediction of diverse protein-ligand complexes. This has also been the case for target-specific complexes, although the advantage is target-dependent and mainly depends on the volume of relevant data available. When appropriate care is taken, machine-learning scoring functions tend to strongly outperform classical scoring functions at the related problem of structure-based virtual screening. Furthermore, if data specific for the target is available, this performance gap widens These reviews provide a broader overview on machine-learning scoring functions for structure-based drug design. The choice of decoys for a given target is one of the most important factors for training and testing any scoring function. The first three types, force-field, empirical and knowledge-based, are commonly referred to as classical scoring functions and are characterized by assuming their contributions to binding are linearly combined. Due to this constraint, classical scoring functions are unable to take advantage of large amounts of training data.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Scoring functions for docking

Start with the simplest possible case. Write down what Scoring functions for docking claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In chemistry, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Scoring functions for docking before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Scoring functions for docking ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Scoring functions for docking

In research
Scoring functions for docking appears in chemistry research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Scoring functions for docking in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Scoring functions for docking is common in secondary-school and first-year university syllabi. It links to neighbouring topics Bioinformatics, Cheminformatics, Computational chemistry, so understanding it makes those chapters shorter.
In everyday life
Look for Scoring functions for docking outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Scoring functions for docking” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Scoring functions for docking in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Scoring functions for docking means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Scoring functions for docking out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Scoring functions for docking in simple terms?

In the fields of computational chemistry and molecular modelling, scoring functions are mathematical functions used to approximately predict the binding affinity between two molecules after they have been docked. Most commonly one of the molecules is a small organic compound such as a drug and the…

Why does Scoring functions for docking matter?

Because it connects several chemistry ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Scoring functions for docking?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Scoring functions for docking.

Tags

  • Bioinformatics
  • Cheminformatics
  • Computational chemistry
  • Molecular modelling
  • Protein structure

Keep exploring