Evidence map›Paper›PMID 31609980›Full record

ArticlePloS one2019

CavBench: A benchmark for protein cavity detection methods.

Sérgio Dias, Tiago Simões, Francisco Fernandes, Ana Mafalda Martins, Alfredo Ferreira, Joaquim Jorge, Abel J P Gomes

Abstract read
In one paragraph

Article in PloS one, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

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

5 citing papers in PubMed.

  1. pyCAST, a Python package for the detection of cavities on surface proteins.Computational and structural biotechnology journal · 2025
    Article
  2. Article
  3. In Silico Analysis of Peptide Macrocycle -Protein Interactions.Methods in molecular biology (Clifton, N.J.) · 2022
    Article
  4. Article
  5. 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

7 authors.

Sérgio DiasInstituto de Telecomunicações, Delegação da Covilhã, Covilhã, Portugal.
Tiago SimõesInstituto de Telecomunicações, Delegação da Covilhã, Covilhã, Portugal.
Francisco FernandesINESC-ID, Lisboa, Portugal.
Ana Mafalda MartinsUniversidade Europeia, Lisboa, Portugal.
Alfredo FerreiraINESC-ID, Lisboa, Portugal.
Joaquim JorgeINESC-ID, Lisboa, Portugal.ORCID 0000-0001-5441-4637
Abel J P GomesInstituto de Telecomunicações, Delegação da Covilhã, Covilhã, Portugal.ORCID 0000-0002-5804-5717

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Extensive research has been applied to discover new techniques and methods to model protein-ligand interactions. In particular, considerable efforts focused on identifying candidate binding sites, which quite often are active sites that correspond to protein pockets or cavities. Thus, these cavities play an important role in molecular docking. However, there is no established benchmark to assess the accuracy of new cavity detection methods. In practice, each new technique is evaluated using a small set of proteins with known binding sites as ground-truth. However, studies supported by large datasets of known cavities and/or binding sites and statistical classification (i.e., false positives, false negatives, true positives, and true negatives) would yield much stronger and reliable assessments. To this end, we propose CavBench, a generic and extensible benchmark to compare different cavity detection methods relative to diverse ground truth datasets (e.g., PDBsum) using statistical classification methods.

Indexed as

Models, MolecularSoftwareAlgorithmsProtein ConformationProteinsReproducibility of ResultsSensitivity and SpecificityProteins

Identifiers

PMID31609980
PMCPMC6791542

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.