Gene regulatory networks (GRNs) are the maps that plant biologists most want to draw, with arrows pointing from transcription factors to the genes they control, explaining how plants develop and respond to the environment. Since experimental validation of even one arrow can take years, and a single plant genome harbours tens of millions of candidate TF–target pairs, this gap has driven the development of numerous computational methods for GRN inference. Here I review three generations of computational approaches to plant GRN inference and measure them against a five-level ladder of evidence, including statistical association, conditional dependence, physical binding, functional regulation and causal circuits. Classical statistics and machine learning have simplified complex gene expression data into clear, prioritised predictions. Techniques like single-cell and multi-omics methods help uncover cell type-specific networks based on chromatin accessibility and binding motifs. Now, deep learning can interpret cis-regulatory grammar directly from genome sequences, and foundation models trained on plant genomes and millions of cells hold exciting potential to share regulatory insights across different species. The most promising route forward is a lab-in-the-loop division of labour in which foundation models serve not as oracles but as hypothesis engines, collapsing fifty million candidate TF–target pairs into the few hundred edges most worth the bench’s time, with each round of validation sharpening the next round of prediction.
No takes yet. Share an insight, caveat, or question.
Haopeng Yu (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: