Evidence map›Paper›PMID 25932051›Full record

ArticleJournal of cheminformatics2015

Improving protein-ligand binding site prediction accuracy by classification of inner pocket points using local features.

Radoslav Krivák, David Hoksza

Open access · goldAbstract read
In one paragraph

Article in Journal of cheminformatics, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 24 papers.

0numbers the graph read from it
0cells of the map it votes in
24citing papers in PubMed
4.4field-weighted citation impact, top 5% of its field
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

24 citing papers in PubMed, 75 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Open-Source Machine Learning in Computational Chemistry.Journal of chemical information and modeling · 2023
    Review
  11. Article
  12. Article
  13. Article
  14. Estimating the Similarity between Protein Pockets.International journal of molecular sciences · 2022
    Review
  15. Article
  16. Review
  17. Probabilistic Pocket Druggability PredictionFrontiers in pharmacology · 2022
    Article
  18. Finding Druggable Sites in Proteins Using TACTICS.Journal of chemical information and modeling · 2021
    Article
  19. Article
  20. 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 at 1 institution in 1 country.

Radoslav KrivákDepartment of Software Engineering, Charles University in Prague, Prague, Czech Republic.
David HokszaDepartment of Software Engineering, Charles University in Prague, Prague, Czech Republic.
Charles University · CZ

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundProtein-ligand binding site prediction from a 3D protein structure plays a pivotal role in rational drug design and can be helpful in drug side-effects prediction or elucidation of protein function. Embedded within the binding site detection problem is the problem of pocket ranking - how to score and sort candidate pockets so that the best scored predictions correspond to true ligand binding sites. Although there exist multiple pocket detection algorithms, they mostly employ a fairly simple ranking function leading to sub-optimal prediction results.

resultsWe have developed a new pocket scoring approach (named PRANK) that prioritizes putative pockets according to their probability to bind a ligand. The method first carefully selects pocket points and labels them by physico-chemical characteristics of their local neighborhood. Random Forests classifier is subsequently applied to assign a ligandability score to each of the selected pocket point. The ligandability scores are finally merged into the resulting pocket score to be used for prioritization of the putative pockets. With the used of multiple datasets the experimental results demonstrate that the application of our method as a post-processing step greatly increases the quality of the prediction of Fpocket and ConCavity, two state of the art protein-ligand binding site prediction algorithms.

conclusionsThe positive experimental results show that our method can be used to improve the success rate, validity and applicability of existing protein-ligand binding site prediction tools. The method was implemented as a stand-alone program that currently contains support for Fpocket and Concavity out of the box, but is easily extendible to support other tools. PRANK is made freely available at http://siret.ms.mff.cuni.cz/prank.

Indexed as

Binding site predictionLigand binding siteMachine learningMolecular recognitionPocket scoreProtein pocketRandom forests

Identifiers

PMID25932051
PMCPMC4414931
OpenAlexW2160544139

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.