Skip to content
DraconiticResearch
Search Sources API
194,220 studies31 sourcesUpdated 19 min ago
PreprintCC BYbioRxiv

TomatoPGFM: A graph-conditioned foundation model for tomato pangenomes

  1. 1Key Laboratory of Genome Research and Genetic Improvement of Xinjiang Characteristic Fruits and Vegetables, Institute of Fruits and Vegetables, Xinjiang Academy

Abstract

Most genomic foundation models are pretrained on independent linear assemblies and therefore do not explicitly represent population-level segment sharing or local graph connectivity. We developed TomatoPGFM, a graph-conditioned model pretrained on 54.65 Gb of sequence from 66 tomato (Solanum spp.) accessions. Sequence tokens were conditioned on pangenome node attributes and local adjacency, and the model was optimised using masked language modelling and graph-feature reconstruction. To evaluate model responses to graph-conditioned input, we compared aligned, shuffled and disabled graph inputs in 25,000 windows from the training panel. Sequence-aligned graph input produced lower masked language modelling loss than graph-off at all five curriculum stages in both training-panel strata, while the shuffled perturbation generally yielded intermediate losses. We then assessed sequence-only transfer in Solanum sitiens LA1974 and S. lycopersicum MicroTom, neither of which was used for graph construction or pretraining. Frozen-probe AUROC values for gene-versus-intergenic and coding-sequence-versus-intergenic classification ranged from 0.8489 to 0.9593. TomatoPGFM produced higher AUROC point estimates than DNABERT-2 in all four comparisons. Enabling the zero-feature GraphAdapter pathway with adjacency messaging disabled changed throughput by less than 1% at 512-2,048 positions under the tested configuration. Together, these results show that TomatoPGFM responds consistently to sequence-aligned pangenome context in training-panel sequences and provides informative sequence representations for genic-region classification in accessions excluded from graph construction and pretraining.

Related

  1. Visualizing and integrating linear and graph pangenomes at the Maize Genetics and Genomics Database
    J. L. Portwood, E. K. Cannon, O. C. Haley +3
    bioRxivPreprintCC0Full textGenetics & genomicsbioRxiv
  2. Protein Language Model-Conditioned Graph Neural Networks for Multitask GPCR Ligand Activity Prediction
    M. De, E. Lodh, S. Majumder +1
    bioRxivPreprintAll rights reservedFull textBioinformatics & computational biologybioRxiv
  3. DNA-LLM2Vec: Architecture-Aware Task-Conditioned Adaptation of Decoder DNA Foundation Models
    Y. Liang, K. Zhai, Y. Gan +4
    bioRxivPreprintCC BYFull textBioinformatics & computational biologybioRxiv
  4. The rise and fall of genes: origins and functions of plant pathogen pangenomes
    Thomas Badet, Daniel Croll
    Current Opinion in Plant BiologyPeer-reviewedCC BY-NC-NDFull text98 citedPlant biologyHAL
  5. PanGBank: a large-scale resource of precomputed microbial pangenomes built with PPanGGOLiN
    Jean Mainguy, Téo Lemane, Adelme Bazin +5
    Nucleic Acids ResearchPeer-reviewedCC BY 4.0Full text1 citedProteomics & metabolomicsBioinformatics & computational biologyHAL
BibTeX
@misc{han2026tomatopgfm,
  title = {{TomatoPGFM: A graph-conditioned foundation model for tomato pangenomes}},
  author = {J. Han and t. yushan and J. Wang and H. Yang and J. Zhao and F. Jiang and C. Jia and T. Yang and B. Wang and C. Zhang and Q. Yu},
  howpublished = {bioRxiv},
  year = {2026},
  month = aug,
  doi = {10.64898/2026.08.31.748176},
  url = {https://www.biorxiv.org/content/10.64898/2026.08.31.748176v1},
  note = {CC BY},
}
RIS
TY  - UNPB
TI  - TomatoPGFM: A graph-conditioned foundation model for tomato pangenomes
AU  - J. Han
AU  - t. yushan
AU  - J. Wang
AU  - H. Yang
AU  - J. Zhao
AU  - F. Jiang
AU  - C. Jia
AU  - T. Yang
AU  - B. Wang
AU  - C. Zhang
AU  - Q. Yu
PY  - 2026
DA  - 2026/08/31
PB  - bioRxiv
DO  - 10.64898/2026.08.31.748176
UR  - https://www.biorxiv.org/content/10.64898/2026.08.31.748176v1
AB  - Most genomic foundation models are pretrained on independent linear assemblies and therefore do not explicitly represent population-level segment sharing or local graph connectivity. We developed TomatoPGFM, a graph-conditioned model pretrained on 54.65 Gb of sequence from 66 tomato (Solanum spp.) accessions. Sequence tokens were conditioned on pangenome node attributes and local adjacency, and the model was optimised using masked language modelling and graph-feature reconstruction. To evaluate model responses to graph-conditioned input, we compared aligned, shuffled and disabled graph inputs in 25,000 windows from the training panel. Sequence-aligned graph input produced lower masked language modelling loss than graph-off at all five curriculum stages in both training-panel strata, while the shuffled perturbation generally yielded intermediate losses. We then assessed sequence-only transfer in Solanum sitiens LA1974 and S. lycopersicum MicroTom, neither of which was used for graph construction or pretraining. Frozen-probe AUROC values for gene-versus-intergenic and coding-sequence-versus-intergenic classification ranged from 0.8489 to 0.9593. TomatoPGFM produced higher AUROC point estimates than DNABERT-2 in all four comparisons. Enabling the zero-feature GraphAdapter pathway with adjacency messaging disabled changed throughput by less than 1% at 512-2,048 positions under the tested configuration. Together, these results show that TomatoPGFM responds consistently to sequence-aligned pangenome context in training-panel sequences and provides informative sequence representations for genic-region classification in accessions excluded from graph construction and pretraining.
ER  -