TRV-2026-1675Version 1 · Certified
Reason for this version
Certified into the record
Canonical text (the exact bytes fingerprinted)
TRUVACE RECORD VERSION record: TRV-2026-1675 version: 1 kind: certified reason: Certified into the record timestamp: 2026-10-17T06:55:02.941308Z status: published lens: g_space sector: science headline: Benchmarking ensemble and deep learning models for drought-responsive gene prioritisation in rice using multi-omics data dek: Identifying drought-responsive genes is critical for climate-resilient crop breeding, yet computational gene-trait association often relies on single-omics or generalized genomic datasets. Optimal algorithm selection for high-dimensional, small multi-omics datasets also remains a persistent challenge. We present a machine learning framework that extends the QTG-Finder feature set by integrating transcriptomic and proteomic features to classify drought-responsive genes in rice. Using MBKBase annotations, we evalu… gain_title: Adding transcriptomic and proteomic features to a genomics-based classifier raised recall for identifying drought-responsive rice genes from 0.47 to 0.67 in a small multi-omics dataset. problem_title: (none) trace_subject: (none) gain_reading: Adding transcriptomic and proteomic features to a genomics-based classifier raised recall for identifying drought-responsive rice genes from 0.47 to 0.67 in a small multi-omics dataset. gain_evidence: improved recall from 0.47 to 0.67 compared with genomics alone problem_reading: (none) problem_evidence: (none) quick_read: Researchers extended the QTG-Finder feature set with transcriptomic and proteomic features and trained classifiers to pick out 336 drought-responsive genes from 2,416 abiotic stress-associated rice genes annotated in MBKBase. They compared Random Forest, XGBoost, a one-dimensional convolutional neural network and a multilayer perceptron. The work suggests that combining several types of molecular data can help narrow candidate genes for climate-resilient breeding, and that simpler tree-based models may suit small tabular datasets better than deep learning. The results come from a limited, imbalanced dataset and a very small holdout, so how well the approach would work on new genes or in breeding programmes remains unresolved. limitation: The reported performance is conditional on a feature matrix assembled before gene-level data splitting, and the 10-gene internal holdout is too small to support claims of generalizability. tag: Evidence-backed gain key_points: The dataset contained 336 drought-responsive genes among 2,416 abiotic stress-associated genes, leaving 2,080 as an operational background set with severe class imbalance. | Tree-based ensemble methods outperformed the deep learning models, which showed early overfitting. | The fine-tuned Random Forest reached recall 0.67 and AUC-ROC 0.87 under nested cross-validation. | Ablation and feature importance analyses pointed to transcriptomics-derived features, especially expression distribution, magnitude and direction, as the largest contributors. rundown: The framework builds on QTG-Finder by adding transcriptomic and proteomic layers to the genomic features, aiming to overcome reliance on single-omics or generalized genomic data in computational gene-trait association. The authors also describe algorithm selection for high-dimensional, small multi-omics datasets as a persistent challenge. Four algorithms were tested while the authors dealt with class imbalance and checked model stability. Random Forest and XGBoost outperformed the one-dimensional CNN and multilayer perceptron, the latter pair showing early overfitting in this dataset. On a small internal holdout of 10 genes, repeated evaluations gave mean accuracy of 0.90 and mean recall of 0.63, which the authors report only as a consistency check. Functional enrichment analysis was used to support the biological relevance of the prioritised genes. sources: - peer_reviewed | PLOS One | https://doi.org/10.1371/journal.pone.0360052 | 2026-10-09 prev: 0000000000000000000000000000000000000000000000000000000000000000
- sha256
- c95b741568fbf4aded619c4a0d5e4e5d4b2feae3b27a46908d08a4c009bff503
- previous
- 0000000000000000000000000000000000000000000000000000000000000000
Verify this record
How to verify without trusting this page
Fetch the canonical text of any version from /api/record/TRV-2026-1675 and hash it yourself — for example shasum -a 256 on the saved canonical field. The result must equal content_hash, and each version’s text ends with prev:followed by the prior version’s hash (version 1 chains to 64 zeros). If a single character of any version had been altered since certification, the chain would not reproduce.
ace