Evidence map›Paper›PMID 42296336›Full record

ReviewBioinformatics (Oxford, England)2026

A survey of models composed of graph neural networks and large language models for molecular science.

Natàlia Segura-Alabart, Francesc Serratosa

Abstract readReview
In one paragraph

Review in Bioinformatics (Oxford, England), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

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

1 citing paper in PubMed.

  1. Review
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.

Natàlia Segura-AlabartDepartament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Catalonia 43007, Spain.ORCID 0000-0002-6276-2049
Francesc SerratosaDepartament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Catalonia 43007, Spain.ORCID 0000-0001-6112-5913

Funding

AGAUR research 2021SGR-00111ASCLEPIUS: Smart Technology for Smart Healthcare PID2022-138327OB-I00Ministerio de Ciencia e Innovación (MCIN)/Agencia Estatal de Investigación (AEI)/10.13039/501100011033/FEDER
6 · The paper itself

Abstract

motivationGraphs have been demonstrated to have an impressive ability to keep the structural and semantic properties of chemical compounds and are therefore widely used in molecular modeling. Moreover, Graph Neural Networks (GNNs) and Large Language Models (LLMs) have achieved outstanding results in predicting molecular properties and generating textual descriptions given graphs or texts, respectively. Recently, some mathematical models have been presented for molecular science applications, which combine the GNNs ability to capture the structural and semantic information and the generative ability of LLMs. However, these models are dispersed across the literature and vary in architecture, input-output design, and application scope, making it difficult to systematically compare them or to identify suitable approaches for specific research objectives.

resultsThis paper classifies recent GNN-LLM models and summarizes them with the aim of providing guidance for research involving their use or the development of new models. We present tables that depict the properties and parameters of the models, as well as their associated chemical computational applications. In addition, a new model classification is presented to help researchers define the models they use or future ones. Finally, we quantitatively compare these models based on their reported experimental results.

Indexed as

Graph Neural NetworksLarge Language ModelsModels, Molecular

Identifiers

PMID42296336
PMCPMC13326746

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.