Evidence map›Paper›PMID 39181863›Full record

ArticleNature communications2024

GTalign: spatial index-driven protein structure alignment, superposition, and search.

Mindaugas Margelevičius

Abstract read
In one paragraph

Article in Nature communications, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.

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

12 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Exploring the protein universe with distant similarity detection methods.Protein science : a publication of the Protein Society · 2026
    Review
  8. In silico evolution of globular protein folds from random sequences.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  9. Article
  10. Article
  11. Article
  12. 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

1 author.

Mindaugas MargelevičiusInstitute of Biotechnology, Life Sciences Center, Vilnius University, Vilnius, Lithuania. mindaugas.margelevicius@bti.vu.lt.ORCID 0000-0003-4981-6708

Funding

Biochemistry of Nicastrin in the Gamma-Secretase ComplexR01AG023104 · NIA · UT SOUTHWESTERN MEDICAL CENTER · PI YU, GANG · 2004 to 2008
$1.5M
Lietuvos Mokslo Taryba (Research Council of Lithuania) S-MIP-23-104
6 · The paper itself

Abstract

With protein databases growing rapidly due to advances in structural and computational biology, the ability to accurately align and rapidly search protein structures has become essential for biological research. In response to the challenge posed by vast protein structure repositories, GTalign offers an innovative solution to protein structure alignment and search-an algorithm that achieves optimal superposition at high speeds. Through the design and implementation of spatial structure indexing, GTalign parallelizes all stages of superposition search across residues and protein structure pairs, yielding rapid identification of optimal superpositions. Rigorous evaluation across diverse datasets reveals GTalign as the most accurate among structure aligners while presenting orders of magnitude in speedup at state-of-the-art accuracy. GTalign's high speed and accuracy make it useful for numerous applications, including functional inference, evolutionary analyses, protein design, and drug discovery, contributing to advancing understanding of protein structure and function.

Indexed as

AlgorithmsComputational BiologyDatabases, ProteinProtein ConformationProteinsModels, MolecularSequence AlignmentSoftwareProteins

Identifiers

PMID39181863
PMCPMC11344802

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.