Evidence map›Paper›PMID 30173397›Full record

ArticleJournal of computer-aided molecular design2018

Rescoring of docking poses under Occam's Razor: are there simpler solutions?

Michael Zhenin, Malkeet Singh Bahia, Gilles Marcou, Alexandre Varnek, Hanoch Senderowitz, Dragos Horvath

Abstract read
PubMed Publisher
In one paragraph

Article in Journal of computer-aided molecular design, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Michael ZheninBar Ilan University, 5290002, Ramat-Gan, Israel.
Malkeet Singh BahiaBar Ilan University, 5290002, Ramat-Gan, Israel.
Gilles MarcouUniversité de Strasbourg, 1 rue B. Pascal, 67000, Strasbourg, France.
Alexandre VarnekUniversité de Strasbourg, 1 rue B. Pascal, 67000, Strasbourg, France.
Hanoch SenderowitzBar Ilan University, 5290002, Ramat-Gan, Israel.
Dragos HorvathUniversité de Strasbourg, 1 rue B. Pascal, 67000, Strasbourg, France. dhorvath@unistra.fr.ORCID 0000-0003-0173-5714

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Ligand affinity prediction from docking simulations is usually performed by means of highly empirical and diverse protocols. These protocols often involve the re-scoring of poses generated by a force field (FF) based Hamiltonian to provide either estimated binding affinities-or alternatively, some empirical goodness score. Re-scoring is performed by so-called scoring functions-typically, a reweighted sum of FF terms augmented by additional terms (e.g., desolvation/entropic penalty, hydrophobicity, aromatic interactions etc.). Sometimes, the scoring function actually drives ligand positioning, but often it only operates on the best scoring poses ranked top by the initial ligand positioning tool. In either of these rather intricate scenarios, scoring functions are docking-specific models, and most require machine-learning-based calibration. Therefore, docking simulations are less straightforward when compared to "standard" molecular simulations in which the FF Hamiltonian defines the energy, and affinity emerges as an ensemble average property over pools of representative conformers (i.e., the trajectory). Paraphrasing on Occam's Razor principle, additional model complexity is only acceptable if demonstrated to bring a significant improvement of prediction quality. In this work we therefore examined whether the complexity inherent to scoring functions is indeed justified. For this purpose we compared sampler for multiple protein-ligand entities, a general purpose conformation sampler based on the AMBER/GAFF FF, complemented with continuum solvation terms, with several state of the art docking tools that rely on calibrated scoring functions (Glide, Gold, Autodock-Vina) in terms of its ability to top-rank the actives from large and diverse ligand series associated with various proteins. There is no clear winner of this study, where each program performed well on most of the targets, but also failed with respect to at least one of them. Therefore, a well-parameterized force field with a simple, energy-based ligand ranking protocol appears to be an as effective docking protocol as intricate rescoring strategies based on scoring functions. A tool that can sample the conformational space of the free ligand, the bound ligand and the protein binding site using the same force field may avoid many of the approximations common to contemporary docking protocols and allow e.g., for docking into highly flexible active sites, when current scoring functions are not well suited to estimate receptor strain energies.

Indexed as

Molecular Docking SimulationBinding SitesDatabases, ProteinLigandsMachine LearningProtein BindingProtein ConformationProteinsSoftwareThermodynamicsLigandsProteinsDockingForce field calculationsScoring

Identifiers

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.