Evidence map›Paper›PMID 42003104›Full record

ArticleThe plant genome2026

ConvCGP: A convolutional neural network to predict genetic values of agronomic traits from compressed genome-wide polymorphisms.

Tanzila Raihan, Chyon Hae Kim, Hiroyuki Shimono, Akio Kimura, Hiroyoshi Iwata

Abstract read
In one paragraph

Article in The plant genome, 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. 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

5 authors.

Tanzila RaihanGraduate School of Agricultural and Life Sciences, The University of Tokyo, Tokyo, Japan.ORCID https://orcid.org/0000-0002-3203-4083
Chyon Hae KimDepartment of Science and Engineering, Faculty of Science and Engineering, Iwate University, Morioka, Iwate, Japan.ORCID https://orcid.org/0000-0002-7360-4986
Hiroyuki ShimonoCrop Science Laboratory, Faculty of Agriculture, Iwate University, Morioka, Japan.ORCID https://orcid.org/0000-0002-7328-0483
Akio KimuraDepartment of Science and Engineering, Faculty of Science and Engineering, Iwate University, Morioka, Iwate, Japan.ORCID https://orcid.org/0000-0002-0742-0783
Hiroyoshi IwataGraduate School of Agricultural and Life Sciences, The University of Tokyo, Tokyo, Japan.ORCID https://orcid.org/0000-0002-6747-7036

Funding

JSPS KAKENHI JP19H00938JSPS KAKENHI JP22H02306JST AI-ENGENE Program JPMJMS25E3
6 · The paper itself

Abstract

The growing size of genome-wide polymorphism data in animal and plant breeding has raised concerns regarding computational load and time, particularly when predicting genetic values for target traits using genomic prediction. Several deep learning and conventional methods, including dimensionality reduction techniques such as principal component analysis (PCA) and autoencoders, have been proposed to address these challenges by selecting subsets of polymorphisms or compressing high-dimensional data for predictive analysis. However, these methods are often computationally intensive and time-consuming. A major challenge in applying deep-learning models directly to high-dimensional genomic data is the substantial computational cost and time required for hyperparameter tuning and model training. To address these limitations, we propose a novel deep learning framework, Compression-based Genomic Prediction using Convolutional Neural Networks (ConvCGP), that integrates autoencoder-based nonlinear compression with convolutional neural network-based prediction in an end-to-end trainable pipeline. This method reduces data to a compact latent representation that retains meaningful information for prediction, thereby significantly reducing storage needs and computational load. We applied ConvCGP to high-dimensional rice datasets for agronomic trait prediction and further tested it on maize, which is large in scale. The results show that ConvCGP maintained prediction accuracy comparable to models trained on uncompressed data, even under extreme compression where only 2% of the original features were retained. This demonstrates that ConvCGP not only scales effectively to massive datasets but also preserves predictive information under drastic dimensionality reduction. Moreover, ConvCGP consistently outperformed PCA-based models, genomic best linear unbiased prediction, LASSO (least absolute shrinkage and selection operator), support vector machine, and other methods, establishing it as a powerful, efficient, and scalable solution for modern genomic prediction.

Indexed as

Genome, PlantOryzaPolymorphism, GeneticAutoencoderConvolutional Neural NetworksDeep LearningGenomicsNeural Networks, ComputerPrediction Algorithms

Identifiers

PMID42003104
PMCPMC13092881

What Socratic 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 Socratic graph.