bioRxivBioinformaticsPreprint
TomatoPGFM: A graph-conditioned foundation model for tomato pangenomes
Jinlei Han, Tuerhong YushaniD, Juan WangiD, Haitao YangiD, Jiantao ZhaoiD, Fangling JiangiD, Chunping JiaiD, Tao YangiD, Baike Wang, Changwei ZhangiD, Qinghui YuiD
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.
- organism: plant (other)
- assay: whole-genome sequencing
- research focus: gene regulatory network inference
- approach: graph neural network
- approach: deep learning
- Citations
- 0
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Tokenization to Transfer: Do Genomic Foundation Models Learn Good Representations?
Kirill Vishniakov, Karthik Viswanathan, … Shadab Khan·bioRxiv·Dec 18, 2024
- BOTANIC-0: a series of foundation models for plant genomic data
Jean Ogier du Terrail, Tanguy Marchand, … Léonard Strouk·bioRxiv·Mar 4, 2026
- GIN-TONIC: Non-hierarchical full-text indexing for graph-genomes
Ünsal Öztürk, Marco Mattavelli, Paolo Ribeca·NAR Genomics and BioinformaticsPeer-reviewed·Sep 28, 2024
- Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs
Nicola Rizzo, Manuel Cáceres, Veli Mäkinen·BioinformaticsPeer-reviewed·Jul 1, 2025
- Building pangenome graphs
Erik P. Garrison, Andrea Guarracino, … Pjotr Prins·Nature MethodsPeer-reviewed·Oct 21, 2024
- Evaluating the Effectiveness of Parameter-Efficient Fine-Tuning in Genomic Classification Tasks
Daniel Berman, Daniel Jimenez, … Vijay Narayan·bioRxiv·Aug 21, 2025