More Like this

1. AGRN: accurate gene regulatory network inference using ensemble machine learning methods

   https://doi.org/10.1093/bioadv/vbad032  

   Alawad, Duaa Mohammad; Katebi, Ataur; Kabir, Md Wasi; Hoque, Md Tamjidul (January 2023, Bioinformatics Advances)

   Kuijjer, Marieke (Ed.)

   Abstract Motivation Biological processes are regulated by underlying genes and their interactions that form gene regulatory networks (GRNs). Dysregulation of these GRNs can cause complex diseases such as cancer, Alzheimer’s and diabetes. Hence, accurate GRN inference is critical for elucidating gene function, allowing for the faster identification and prioritization of candidate genes for functional investigation. Several statistical and machine learning-based methods have been developed to infer GRNs based on biological and synthetic datasets. Here, we developed a method named AGRN that infers GRNs by employing an ensemble of machine learning algorithms. Results From the idea that a single method may not perform well on all datasets, we calculate the gene importance scores using three machine learning methods—random forest, extra tree and support vector regressors. We calculate the importance scores from Shapley Additive Explanations, a recently published method to explain machine learning models. We have found that the importance scores from Shapley values perform better than the traditional importance scoring methods based on almost all the benchmark datasets. We have analyzed the performance of AGRN using the datasets from the DREAM4 and DREAM5 challenges for GRN inference. The proposed method, AGRN—an ensemble machine learning method with Shapley values, outperforms the existing methods both in the DREAM4 and DREAM5 datasets. With improved accuracy, we believe that AGRN inferred GRNs would enhance our mechanistic understanding of biological processes in health and disease. Availabilityand implementation https://github.com/DuaaAlawad/AGRN. Supplementary information Supplementary data are available at Bioinformatics online. 

   more » « less
2. COFFEE: consensus single cell-type specific inference for gene regulatory networks

   https://doi.org/10.1093/bib/bbae457  

   Lodi, Musaddiq K; Chernikov, Anna; Ghosh, Preetam (September 2024, Briefings in Bioinformatics)

   Abstract The inference of gene regulatory networks (GRNs) is crucial to understanding the regulatory mechanisms that govern biological processes. GRNs may be represented as edges in a graph, and hence, it have been inferred computationally for scRNA-seq data. A wisdom of crowds approach to integrate edges from several GRNs to create one composite GRN has demonstrated improved performance when compared with individual algorithm implementations on bulk RNA-seq and microarray data. In an effort to extend this approach to scRNA-seq data, we present COFFEE (COnsensus single cell-type speciFic inFerence for gEnE regulatory networks), a Borda voting-based consensus algorithm that integrates information from 10 established GRN inference methods. We conclude that COFFEE has improved performance across synthetic, curated, and experimental datasets when compared with baseline methods. Additionally, we show that a modified version of COFFEE can be leveraged to improve performance on newer cell-type specific GRN inference methods. Overall, our results demonstrate that consensus-based methods with pertinent modifications continue to be valuable for GRN inference at the single cell level. While COFFEE is benchmarked on 10 algorithms, it is a flexible strategy that can incorporate any set of GRN inference algorithms according to user preference. A Python implementation of COFFEE may be found on GitHub: https://github.com/lodimk2/coffee 

   more » « less
3. ConnecTF: A platform to integrate transcription factor–gene interactions and validate regulatory networks

   https://doi.org/10.1093/plphys/kiaa012  

   Brooks, Matthew D; Juang, Che-Lun; Katari, Manpreet Singh; Alvarez, José M; Pasquino, Angelo; Shih, Hung-Jui; Huang, Ji; Shanks, Carly; Cirrone, Jacopo; Coruzzi, Gloria M (November 2020, Plant Physiology)

   null (Ed.)

   Abstract Deciphering gene regulatory networks (GRNs) is both a promise and challenge of systems biology. The promise lies in identifying key transcription factors (TFs) that enable an organism to react to changes in its environment. The challenge lies in validating GRNs that involve hundreds of TFs with hundreds of thousands of interactions with their genome-wide targets experimentally determined by high-throughput sequencing. To address this challenge, we developed ConnecTF, a species-independent, web-based platform that integrates genome-wide studies of TF–target binding, TF–target regulation, and other TF-centric omic datasets and uses these to build and refine validated or inferred GRNs. We demonstrate the functionality of ConnecTF by showing how integration within and across TF–target datasets uncovers biological insights. Case study 1 uses integration of TF–target gene regulation and binding datasets to uncover TF mode-of-action and identify potential TF partners for 14 TFs in abscisic acid signaling. Case study 2 demonstrates how genome-wide TF–target data and automated functions in ConnecTF are used in precision/recall analysis and pruning of an inferred GRN for nitrogen signaling. Case study 3 uses ConnecTF to chart a network path from NLP7, a master TF in nitrogen signaling, to direct secondary TF2s and to its indirect targets in a Network Walking approach. The public version of ConnecTF (https://ConnecTF.org) contains 3,738,278 TF–target interactions for 423 TFs in Arabidopsis, 839,210 TF–target interactions for 139 TFs in maize (Zea mays), and 293,094 TF–target interactions for 26 TFs in rice (Oryza sativa). The database and tools in ConnecTF will advance the exploration of GRNs in plant systems biology applications for model and crop species. 

   more » « less
4. Bayesian Inference of Gene Regulatory Networks at Stochastic Steady State

   Gupta, A; Yoon, A; Josić, K (January 2026, Journal of the Royal Society interface)

   Gene Regulatory Networks (GRNs) form the regulatory back- bone that coordinates gene expression. The architecture of GRNs shapes their function and constraints the biochemi- cal pathways through which information flows. Inferring the structure of regulatory interactions is thus essential for un- derstanding biological systems, and designing targeted ther- apies. Despite substantial progress in GRN inference, most approaches – from statistical methods to deep learning – do not take into account fundamental biochemical processes that drive regulatory dynamics. To address this shortcoming, here we present a novel Bayesian inference approach based on us- ing the Chemical Langevin Equation (CLE) as a model of gene expression dynamics at stochastic equilibrium. Inter- actions in GRNs are sparse, and we thus use a regularized horseshoe prior enabling selective shrinkage of unsupported interactions while identifying strong regulatory edges. We evaluate our method using synthetic gene expression data, allowing for benchmarking against a known ground truth. Our approach allows us to infer kinetic parameters, identify net- work structure, and infer regulatory cycles without the need to observe transient dynamics. This Bayesian alternative to current methods thus provides both biological interpretability and structural identifiability in GRN inference. 

   more » « less
5. Inference of regulatory networks through temporally sparse data

   https://doi.org/10.3389/fcteg.2022.1017256  

   Alali, Mohammad; Imani, Mahdi (December 2022, Frontiers in Control Engineering)

   A major goal in genomics is to properly capture the complex dynamical behaviors of gene regulatory networks (GRNs). This includes inferring the complex interactions between genes, which can be used for a wide range of genomics analyses, including diagnosis or prognosis of diseases and finding effective treatments for chronic diseases such as cancer. Boolean networks have emerged as a successful class of models for capturing the behavior of GRNs. In most practical settings, inference of GRNs should be achieved through limited and temporally sparse genomics data. A large number of genes in GRNs leads to a large possible topology candidate space, which often cannot be exhaustively searched due to the limitation in computational resources. This paper develops a scalable and efficient topology inference for GRNs using Bayesian optimization and kernel-based methods. Rather than an exhaustive search over possible topologies, the proposed method constructs a Gaussian Process (GP) with a topology-inspired kernel function to account for correlation in the likelihood function. Then, using the posterior distribution of the GP model, the Bayesian optimization efficiently searches for the topology with the highest likelihood value by optimally balancing between exploration and exploitation. The performance of the proposed method is demonstrated through comprehensive numerical experiments using a well-known mammalian cell-cycle network. 

   more » « less