Gene Regulatory Networks Inference Algorithms Research Articles

GRouNdGAN: GRN-guided simulation of single-cell RNA-seq data using causal generative adversarial networks

We introduce GRouNdGAN, a gene regulatory network (GRN)-guided reference-based causal implicit generative model for simulating single-cell RNA-seq data, in silico perturbation experiments, and benchmarking GRN inference methods. Through the imposition of a user-defined GRN in its architecture, GRouNdGAN simulates steady-state and transient-state single-cell datasets where genes are causally expressed under the control of their regulating transcription factors (TFs). Training on six experimental reference datasets, we show that our model captures non-linear TF-gene dependencies and preserves gene identities, cell trajectories, pseudo-time ordering, and technical and biological noise, with no user manipulation and only implicit parameterization. GRouNdGAN can synthesize cells under new conditions to perform in silico TF knockout experiments. Benchmarking various GRN inference algorithms reveals that GRouNdGAN effectively bridges the existing gap between simulated and biological data benchmarks of GRN inference algorithms, providing gold standard ground truth GRNs and realistic cells corresponding to the biological system of interest.

Prediction of protein-RNA interactions from single-cell transcriptomic data.

Proteins are crucial in regulating every aspect of RNA life, yet understanding their interactions with coding and noncoding RNAs remains limited. Experimental studies are typically restricted to a small number of cell lines and a limited set of RNA-binding proteins (RBPs). Although computational methods based on physico-chemical principles can predict protein-RNA interactions accurately, they often lack the ability to consider cell-type-specific gene expression and the broader context of gene regulatory networks (GRNs). Here, we assess the performance of several GRN inference algorithms in predicting protein-RNA interactions from single-cell transcriptomic data, and propose a pipeline, called scRAPID (single-cell transcriptomic-based RnA Protein Interaction Detection), that integrates these methods with the catRAPID algorithm, which can identify direct physical interactions between RBPs and RNA molecules. Our approach demonstrates that RBP-RNA interactions can be predicted from single-cell transcriptomic data, with performances comparable or superior to those achieved for the well-established task of inferring transcription factor-target interactions. The incorporation of catRAPID significantly enhances the accuracy of identifying interactions, particularly with long noncoding RNAs, and enables the identification of hub RBPs and RNAs. Additionally, we show that interactions between RBPs can be detected based on their inferred RNA targets. The software is freely available at https://github.com/tartaglialabIIT/scRAPID.

Nervous system-related gene regulatory networks and functional evolution of ETS proteins across species

The ETS domain transcription factor family is one of the major transcription factor superfamilies that play regulatory roles in development, cell growth, and cancer progression. Although different functions of ETS member proteins in the nervous system have been demonstrated in various studies, their role in neuronal cell differentiation and the evolutionary conservation of its target genes have not yet been extensively studied. In this study, we focused on the regulatory role of ETS transcription factors in neuronal differentiation and their functional evolution by comparative transcriptomics. In order to investigate the regulatory role of ETS transcription factors in neuronal differentiation across species, transcriptional profiles of ETS members and their target genes were investigated by comparing differentially expressed genes and gene regulatory networks, which were analyzed using human, gorilla, mouse, fruit fly and worm transcriptomics datasets. Bioinformatics approaches to examine the evolutionary conservation of ETS transcription factors during neuronal differentiation have shown that ETS member proteins regulate genes associated with neuronal differentiation, nervous system development, axon, and synaptic regulation in different organisms. This study is a comparative transcriptomic study of ETS transcription factors in terms of neuronal differentiation using a gene regulatory network inference algorithm. Overall, a comparison of gene regulation networks revealed that ETS members are indeed evolutionarily conserved in the regulation of neuronal differentiation. Nonetheless, ETS, PEA3, and ELF subfamilies were found to be relatively more active transcription factors in the transcriptional regulation of neuronal differentiation.

Gene Regulatory Network Inference Using Convolutional Neural Networks from scRNA-seq Data.

In recent years, with the rapid development of single-cell sequencing technology, this brings new opportunities and challenges to reconstruct gene regulatory networks. On the one hand, scRNA-seq data reveal statistical information of gene expression at single-cell resolution, which is beneficial to construct gene expression regulatory networks. On the other hand, the noise and dropout of single-cell data bring great difficulties to the analysis of scRNA-seq data, resulting in lower accuracy of gene regulatory networks reconstructed by traditional methods. In this article, we propose a novel supervised convolutional neural network (CNNSE), which can extract gene expression information from 2D co-expression matrices of gene doublets and identify interactions between genes. Our method can avoid the loss of extreme point interference by constructing a 2D co-expression matrix of gene pairs and significantly improve the regulation precision between gene pairs. And the CNNSE model is able to obtain detailed and high-level semantic information from the 2D co-expression matrix. Our method achieves satisfactory results on simulated data [accuracy (ACC): 0.712, F1: 0.724]. On two real scRNA-seq datasets, our method exhibits higher stability and accuracy in inference tasks compared with other existing gene regulatory network inference algorithms.

Gene Regulatory Identification Based on the Novel Hybrid Time-Delayed Method.

Gene regulatory network (GRN) inference with biology data is a difficult and serious issue in the field of system biology. In order to detect the direct associations of GRN more accurately, a novel two-step GRN inference technique based on the time-delayed correlation coefficient (TDCC) and time-delayed complex-valued S-system model (TDCVSS) is proposed. First, a TDCC algorithm is utilized to construct an initial network. Second, a TDCVSS model is utilized to prune the network topology in order to delete false-positive regulatory relationships for each target gene. The complex-valued restricted additive tree and complex-valued differential evolution are proposed to approximate the optimal TDCVSS model. Finally, the overall network could be inferred by integrating the regulations of all target genes. Two real gene expression datasets from E. coli and S. cerevisiae gene networks are utilized to evaluate the performances of our proposed two-step GRN inference algorithm. The results demonstrated that the proposed algorithm could infer GRN more correct than classical methods and time-delayed methods.

Gene Regulatory Network Inference using 3D Convolutional Neural Network

Gene regulatory networks (GRNs) consist of gene regulations between transcription factors (TFs) and their target genes. Single-cell RNA sequencing (scRNA-seq) brings both opportunities and challenges to the inference of GRNs. On the one hand, scRNA-seq data reveals statistic information of gene expressions at the single-cell resolution, which is conducive to the construction of GRNs; on the other hand, noises and dropouts pose great difficulties on the analysis of scRNA-seq data, causing low prediction accuracy by traditional methods. In this paper, we propose 3D Co-Expression Matrix Analysis (3DCEMA), which predicts regulatory relationships by classifying 3D co-expression matrices of gene triples using a 3D convolutional neural network. We found that by introducing a third gene as a comparison factor, our method can avoid the disturbance of noises and dropouts, and significantly increase the prediction accuracy of regulations between gene pairs. Compared with other existing GRN inference algorithms on both in-silico datasets and scRNA-Seq datasets, our algorithm based on deep learning shows higher stability and accuracy in the task of GRN inference.

Inference of Gene Regulatory Network from Single-Cell Transcriptomic Data Using pySCENIC.

With the advent of recent next-generation sequencing (NGS) technologies in genomics, transcriptomics, and epigenomics, profiling single-cell sequencing became possible. The single-cell RNA sequencing (scRNA-seq) is widely used to characterize diverse cell populations and ascertain cell type-specific regulatory mechanisms. The gene regulatory network (GRN) mainly consists of genes and their regulators-transcription factors (TF). Here, we describe the lightning-fast Python implementation of the SCENIC (Single-Cell reEgulatory Network Inference and Clustering) pipeline called pySCENIC. Using single-cell RNA-seq data, it maps TFs onto gene regulatory networks and integrates various cell types to infer cell-specific GRNs. There are two fast and efficient GRN inference algorithms, GRNBoost2 and GENIE3, optionally available with pySCENIC. The pipeline has three steps: (1) identification of potential TF targets based on co-expression; (2) TF-motif enrichment analysis to identify the direct targets (regulons); and (3) scoring the activity of regulons (or other gene sets) on single cell types.

Differential analysis of gene regulatory networks modeled with structural equation models

A gene regulatory networks (GRN) is composed of a set of genes as well as the regulatory relationships between them. Under different conditions, GRNs with the same gene set usually have similar but not exactly the same structure. The differential analysis of GRNs under different conditions is of great significance to understand gene functions and biological mechanisms. In a naive approach, GRNs under different conditions can be separately inferred via existing GRN inference algorithms, and then the difference between them can be identified by comparing the estimated structures. However, such an approach does not consider the commonality of the pairwise GRNs, which may decrease the predictive accuracy of the differential GRN. In this paper, we model GRNs with the structural equation models (SEMs) to integrate gene expression data and genetic perturbations, and propose a joint differential analysis algorithm named differential sparse SEM (DiffSSEM) to identify the topology structures of GRNs under different conditions as well as the difference between them. The DiffSSEM algorithm simultaneously consider the sparsity of separate GRNs and differential GRN. Simulations were run on synthetic data and the results demonstrated that the DiffSSEM algorithm outperforms the naive approach based on a state-of-the-art sparse SEM inference algorithm. Finally, a real data set of 15 lung genes from 42 tumor tissues and normal tissues was analyzed with the DiffSSEM algorithm to identify the differential GRN.

PoLoBag: Polynomial Lasso Bagging for signed gene regulatory network inference from expression data

Inferring gene regulatory networks (GRNs) from expression data is a significant systems biology problem. A useful inference algorithm should not only unveil the global structure of the regulatory mechanisms but also the details of regulatory interactions such as edge direction (from regulator to target) and sign (activation/inhibition). Many popular GRN inference algorithms cannot infer edge signs, and those that can infer signed GRNs cannot simultaneously infer edge directions or network cycles. To address these limitations of existing algorithms, we propose Polynomial Lasso Bagging (PoLoBag) for signed GRN inference with both edge directions and network cycles. PoLoBag is an ensemble regression algorithm in a bagging framework where Lasso weights estimated on bootstrap samples are averaged. These bootstrap samples incorporate polynomial features to capture higher-order interactions. Results demonstrate that PoLoBag is consistently more accurate for signed inference than state-of-the-art algorithms on simulated and real-world expression datasets. Algorithm and data are freely available at https://github.com/gourabghoshroy/PoLoBag. Supplementary data are available at Bioinformatics online.

Benchmarking algorithms for gene regulatory network inference from single-cell transcriptomic data.

We present a systematic evaluation of state-of-the-art algorithms for inferring gene regulatory networks (GRNs) from single-cell transcriptional data. As the ground truth for assessing accuracy, we use synthetic networks with predictable trajectories, literature-curated Boolean models, and diverse transcriptional regulatory networks. We develop a strategy to simulate single-cell transcriptional data from synthetic and Boolean networks that avoids pitfalls of previously-used methods. Furthermore, we collect networks from multiple experimental single-cell RNA-seq datasets. We develop an evaluation framework called BEELINE. We find that the AUPRC and early precision of the algorithms are moderate. The methods are better in recovering interactions in synthetic networks than Boolean models. The algorithms with the best early precision values for Boolean models also perform well on experimental datasets. Techniques that do not require pseudotime-ordered cells are generally more accurate. Based on these results, we present recommendations to end users. BEELINE will aid the development of GRN inference algorithms.

GRNBoost2 and Arboreto: efficient and scalable inference of gene regulatory networks.

Inferring a Gene Regulatory Network (GRN) from gene expression data is a computationally expensive task, exacerbated by increasing data sizes due to advances in high-throughput gene profiling technology, such as single-cell RNA-seq. To equip researchers with a toolset to infer GRNs from large expression datasets, we propose GRNBoost2 and the Arboreto framework. GRNBoost2 is an efficient algorithm for regulatory network inference using gradient boosting, based on the GENIE3 architecture. Arboreto is a computational framework that scales up GRN inference algorithms complying with this architecture. Arboreto includes both GRNBoost2 and an improved implementation of GENIE3, as a user-friendly open source Python package. Arboreto is available under the 3-Clause BSD license at http://arboreto.readthedocs.io. Supplementary data are available at Bioinformatics online.

BTNET : boosted tree based gene regulatory network inference algorithm using time-course measurement data

BackgroundIdentifying gene regulatory networks is an important task for understanding biological systems. Time-course measurement data became a valuable resource for inferring gene regulatory networks. Various methods have been presented for reconstructing the networks from time-course measurement data. However, existing methods have been validated on only a limited number of benchmark datasets, and rarely verified on real biological systems.ResultsWe first integrated benchmark time-course gene expression datasets from previous studies and reassessed the baseline methods. We observed that GENIE3-time, a tree-based ensemble method, achieved the best performance among the baselines. In this study, we introduce BTNET, a boosted tree based gene regulatory network inference algorithm which improves the state-of-the-art. We quantitatively validated BTNET on the integrated benchmark dataset. The AUROC and AUPR scores of BTNET were higher than those of the baselines. We also qualitatively validated the results of BTNET through an experiment on neuroblastoma cells treated with an antidepressant. The inferred regulatory network from BTNET showed that brachyury, a transcription factor, was regulated by fluoxetine, an antidepressant, which was verified by the expression of its downstream genes.ConclusionsWe present BTENT that infers a GRN from time-course measurement data using boosting algorithms. Our model achieved the highest AUROC and AUPR scores on the integrated benchmark dataset. We further validated BTNET qualitatively through a wet-lab experiment and showed that BTNET can produce biologically meaningful results.

SINCERITIES: inferring gene regulatory networks from time-stamped single cell transcriptional expression profiles.

MotivationSingle cell transcriptional profiling opens up a new avenue in studying the functional role of cell-to-cell variability in physiological processes. The analysis of single cell expression profiles creates new challenges due to the distributive nature of the data and the stochastic dynamics of gene transcription process. The reconstruction of gene regulatory networks (GRNs) using single cell transcriptional profiles is particularly challenging, especially when directed gene-gene relationships are desired.ResultsWe developed SINCERITIES (SINgle CEll Regularized Inference using TIme-stamped Expression profileS) for the inference of GRNs from single cell transcriptional profiles. We focused on time-stamped cross-sectional expression data, commonly generated from transcriptional profiling of single cells collected at multiple time points after cell stimulation. SINCERITIES recovers directed regulatory relationships among genes by employing regularized linear regression (ridge regression), using temporal changes in the distributions of gene expressions. Meanwhile, the modes of the gene regulations (activation and repression) come from partial correlation analyses between pairs of genes. We demonstrated the efficacy of SINCERITIES in inferring GRNs using in silico time-stamped single cell expression data and single cell transcriptional profiles of THP-1 monocytic human leukemia cells. The case studies showed that SINCERITIES could provide accurate GRN predictions, significantly better than other GRN inference algorithms such as TSNI, GENIE3 and JUMP3. Moreover, SINCERITIES has a low computational complexity and is amenable to problems of extremely large dimensionality. Finally, an application of SINCERITIES to single cell expression data of T2EC chicken erythrocytes pointed to BATF as a candidate novel regulator of erythroid development.Availability and implementationMATLAB and R version of SINCERITIES are freely available from the following websites: http://www.cabsel.ethz.ch/tools/sincerities.html and https://github.com/CABSEL/SINCERITIES. The single cell THP-1 and T2EC transcriptional profiles are available from the original publications (Kouno et al., 2013; Richard et al., 2016). The in silico single cell data are available on SINCERITIES websites.Supplementary information Supplementary data are available at Bioinformatics online.

Predicting gene regulatory networks by combining spatial and temporal gene expression data in Arabidopsis root stem cells

Identifying the transcription factors (TFs) and associated networks involved in stem cell regulation is essential for understanding the initiation and growth of plant tissues and organs. Although many TFs have been shown to have a role in the Arabidopsis root stem cells, a comprehensive view of the transcriptional signature of the stem cells is lacking. In this work, we used spatial and temporal transcriptomic data to predict interactions among the genes involved in stem cell regulation. To accomplish this, we transcriptionally profiled several stem cell populations and developed a gene regulatory network inference algorithm that combines clustering with dynamic Bayesian network inference. We leveraged the topology of our networks to infer potential major regulators. Specifically, through mathematical modeling and experimental validation, we identified PERIANTHIA (PAN) as an important molecular regulator of quiescent center function. The results presented in this work show that our combination of molecular biology, computational biology, and mathematical modeling is an efficient approach to identify candidate factors that function in the stem cells.

A hybrid framework for reverse engineering of robust Gene Regulatory Networks

The inference of Gene Regulatory Networks (GRNs) using gene expression data in order to detect the basic cellular processes is a key issue in biological systems. Inferring GRN correctly requires inferring predictor set accurately. In this paper, a fast and accurate predictor set inference framework which linearly combines some inference methods is proposed. The purpose of the combination of various methods is to increase the accuracy of inferred GRN. The proposed framework offers a linear weighted combination of Pearson Correlation Coefficient (PCC) and two different feature selection approaches, namely: Information Gain (IG) and ReliefF. In order to set the appropriate weights, Genetic Algorithm (GA) is used. Similarity measure is considered as fitness function to guide GA. At the end, based on the obtained weights, the best predictor set of GRN using three aforementioned inference methods is selected and the network topology is formed. Due to the huge volume of gene expression data, GRN inference algorithms should infer GRN at a reasonable runtime. Hence, a novel criterion is provided to evaluate GRNs based on runtime and accuracy. The simulation results using biological data indicate that the proposed framework is fast and more reliable compared to other recent methods [1-7].

Identification of key regulators in non-small cell lung cancer based on network topology and modularity analysis

Lung cancer predominantly non-small cell lung cancer is a worldwide leading cause of tumor killer therefore exploring underlying biological networks and modularity analysis will be possibly lead to identifying putative key genes involved in this malignancy and its sub-types. In this study using GENIE3 one of the most prominent gene regulatory network inference algorithms we reconstructed independent gene regulatory networks from normal and lung cancer data following topology analysis. Afterward we attempted to highlight the crucial genes involved adenocarcinoma and squamous sub-types of this cancer by networks modularity analysis. The results lead to detection of 19 critical genes as varied hub and bottleneck genes and further seed and crucial nodes by analysis of extracted sub-networks from first neighborhoods of hubs and bottlenecks. As a result we observed that the detected genes involved in several of biological process toward lung cancer progression. Analysis of non-small cell transcriptional networks showed a potential ability to provide useful information toward gaining more insights in this cancer also its sub-types.

Combining tree-based and dynamical systems for the inference of gene regulatory networks.

Motivation: Reconstructing the topology of gene regulatory networks (GRNs) from time series of gene expression data remains an important open problem in computational systems biology. Existing GRN inference algorithms face one of two limitations: model-free methods are scalable but suffer from a lack of interpretability and cannot in general be used for out of sample predictions. On the other hand, model-based methods focus on identifying a dynamical model of the system. These are clearly interpretable and can be used for predictions; however, they rely on strong assumptions and are typically very demanding computationally.Results: Here, we propose a new hybrid approach for GRN inference, called Jump3, exploiting time series of expression data. Jump3 is based on a formal on/off model of gene expression but uses a non-parametric procedure based on decision trees (called ‘jump trees’) to reconstruct the GRN topology, allowing the inference of networks of hundreds of genes. We show the good performance of Jump3 on in silico and synthetic networks and applied the approach to identify regulatory interactions activated in the presence of interferon gamma.Availability and implementation: Our MATLAB implementation of Jump3 is available at http://homepages.inf.ed.ac.uk/vhuynht/software.html.Contact: vhuynht@inf.ed.ac.uk or G.Sanguinetti@ed.ac.ukSupplementary information: Supplementary data are available at Bioinformatics online.

Inferring nonlinear gene regulatory networks from gene expression data based on distance correlation.

Nonlinear dependence is general in regulation mechanism of gene regulatory networks (GRNs). It is vital to properly measure or test nonlinear dependence from real data for reconstructing GRNs and understanding the complex regulatory mechanisms within the cellular system. A recently developed measurement called the distance correlation (DC) has been shown powerful and computationally effective in nonlinear dependence for many situations. In this work, we incorporate the DC into inferring GRNs from the gene expression data without any underling distribution assumptions. We propose three DC-based GRNs inference algorithms: CLR-DC, MRNET-DC and REL-DC, and then compare them with the mutual information (MI)-based algorithms by analyzing two simulated data: benchmark GRNs from the DREAM challenge and GRNs generated by SynTReN network generator, and an experimentally determined SOS DNA repair network in Escherichia coli. According to both the receiver operator characteristic (ROC) curve and the precision-recall (PR) curve, our proposed algorithms significantly outperform the MI-based algorithms in GRNs inference.

Comparison of the Bayesian Networks using Microarray Data

Understanding gene interactions in complex living systems can be seen as the ultimate goal of the systems biology revolution. Hence, to fully understand disease ontology and to reduce the cost of drug development, gene regulatory networks (GRN) have to be constructed. During the last decade, many GRN inference algorithms like ‘Bayesian network’ that are based on genome-wide data have been developed to unravel the complexity of gene regulation. Recently, many of structure learning algorithms were used to learn Bayesian network that have shown promise in gene regulatory network reconstruction. In this paper we apply different structure learning algorithms on actual microarray data to obtain a better understanding of their relative strengths and weaknesses on the system biology community and we evaluate their outputs from different perspectives.

ENNET: inferring large gene regulatory networks from expression data using gradient boosting.

BackgroundThe regulation of gene expression by transcription factors is a key determinant of cellular phenotypes. Deciphering genome-wide networks that capture which transcription factors regulate which genes is one of the major efforts towards understanding and accurate modeling of living systems. However, reverse-engineering the network from gene expression profiles remains a challenge, because the data are noisy, high dimensional and sparse, and the regulation is often obscured by indirect connections.ResultsWe introduce a gene regulatory network inference algorithm ENNET, which reverse-engineers networks of transcriptional regulation from a variety of expression profiles with a superior accuracy compared to the state-of-the-art methods. The proposed method relies on the boosting of regression stumps combined with a relative variable importance measure for the initial scoring of transcription factors with respect to each gene. Then, we propose a technique for using a distribution of the initial scores and information about knockouts to refine the predictions. We evaluated the proposed method on the DREAM3, DREAM4 and DREAM5 data sets and achieved higher accuracy than the winners of those competitions and other established methods.ConclusionsSuperior accuracy achieved on the three different benchmark data sets shows that ENNET is a top contender in the task of network inference. It is a versatile method that uses information about which gene was knocked-out in which experiment if it is available, but remains the top performer even without such information. ENNET is available for download from https://github.com/slawekj/ennet under the GNU GPLv3 license.