Evidence map›Paper›PMID 28921375›Full record

ArticleJournal of computer-aided molecular design2017

Convex-PL: a novel knowledge-based potential for protein-ligand interactions deduced from structural databases using convex optimization.

Maria Kadukova, Sergei Grudinin

Abstract read
PubMed Publisher
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
14citing 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

14 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. 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

2 authors.

Maria KadukovaLJK, University of Grenoble Alpes, 38000, Grenoble, France.
Sergei GrudininLJK, University of Grenoble Alpes, 38000, Grenoble, France. Sergei.Grudinin@inria.fr.ORCID http://orcid.org/0000-0002-1903-7220

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

We present a novel optimization approach to train a free-shape distance-dependent protein-ligand scoring function called Convex-PL. We do not impose any functional form of the scoring function. Instead, we decompose it into a polynomial basis and deduce the expansion coefficients from the structural knowledge base using a convex formulation of the optimization problem. Also, for the training set we do not generate false poses with molecular docking packages, but use constant RMSD rigid-body deformations of the ligands inside the binding pockets. This allows the obtained scoring function to be generally applicable to scoring of structural ensembles generated with different docking methods. We assess the Convex-PL scoring function using data from D3R Grand Challenge 2 submissions and the docking test of the CASF 2013 study. We demonstrate that our results outperform the other 20 methods previously assessed in CASF 2013. The method is available at http://team.inria.fr/nano-d/software/Convex-PL/ .

Indexed as

Knowledge BasesMachine LearningMolecular Docking SimulationAlgorithmsBinding SitesDatabases, ProteinDrug DesignHumansLigandsMolecular StructureProtein BindingProtein ConformationProteinsStructure-Activity RelationshipLigandsProteinsKnowledge-based potentialMachine learningMolecular dockingProtein-ligand interactionsScoring function

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.