Evidence map›Paper›PMID 40196750›Full record

ArticleBioinformatics advances2025

Fast protein structure searching using structure graph embeddings.

Joe G Greener, Kiarash Jamali

Abstract read
In one paragraph

Article in Bioinformatics advances, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

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

11 citing papers in PubMed.

  1. Article
  2. Review
  3. Systematic discovery of circular permutations across the protein universe using CIRPIN.Proceedings of the National Academy of Sciences of the United States of America · 2026
    Article
  4. Article
  5. Exploring the protein universe with distant similarity detection methods.Protein science : a publication of the Protein Society · 2026
    Review
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. 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.

Joe G GreenerMedical Research Council Laboratory of Molecular Biology, Cambridge, CB2 0QH, United Kingdom.ORCID https://orcid.org/0000-0002-5154-1929
Kiarash JamaliMedical Research Council Laboratory of Molecular Biology, Cambridge, CB2 0QH, United Kingdom.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Comparing and searching protein structures independent of primary sequence has proved useful for remote homology detection, function annotation, and protein classification. Fast and accurate methods to search with structures will be essential to make use of the vast databases that have recently become available, in the same way that fast protein sequence searching underpins much of bioinformatics. We train a simple graph neural network using supervised contrastive learning to learn a low-dimensional embedding of protein domains. Availability and implementation: The method, called Progres, is available as software at https://github.com/greener-group/progres and as a web server at https://progres.mrc-lmb.cam.ac.uk. It has accuracy comparable to the best current methods and can search the AlphaFold database TED domains in a 10th of a second per query on CPU.

Identifiers

PMID40196750
PMCPMC11974391

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.