scholarly journals scSGL: Signed Graph Learning for Single-Cell Gene Regulatory Network Inference

2021 ◽  
Author(s):  
Abdullah Karaaslanli ◽  
Satabdi Saha ◽  
Selin Aviyente ◽  
Tapabrata Maiti

Elucidating the topology of gene regulatory networks (GRN) from large single-cell RNA sequencing (scRNAseq) datasets, while effectively capturing its inherent cell-cycle heterogeneity, is currently one of the most pressing problems in computational systems biology. Recently, graph learning (GL) approaches based on graph signal processing (GSP) have been developed to infer graph topology from signals defined on graphs. However, existing GL methods are not suitable for learning signed graphs, which represent a characteristic feature of GRNs, as they account for both activating and inhibitory relationships between genes. To this end, we propose a novel signed GL approach, scSGL, that incorporates the similarity and dissimilarity between observed gene expression data to construct gene networks. The proposed approach is formulated as a non-convex optimization problem and solved using an efficient ADMM framework. In our experiments on simulated and real single cell datasets, scSGL compares favorably with other single cell gene regulatory network reconstruction algorithms.

2015 ◽  
Author(s):  
Aurélie Pirayre ◽  
Camille Couprie ◽  
Frédérique Bidard ◽  
Laurent Duval ◽  
Jean-Christophe Pesquet

Background: Inferring gene networks from high-throughput data constitutes an important step in the discovery of relevant regulatory relationships in organism cells. Despite the large number of available Gene Regulatory Network inference methods, the problem remains challenging: the underdetermination in the space of possible solutions requires additional constraints that incorporate a priori information on gene interactions. Methods: Weighting all possible pairwise gene relationships by a probability of edge presence, we formulate the regulatory network inference as a discrete variational problem on graphs. We enforce biologically plausible coupling between groups and types of genes by minimizing an edge labeling functional coding for a priori structures. The optimization is carried out with Graph cuts, an approach popular in image processing and computer vision. We compare the inferred regulatory networks to results achieved by the mutual-information-based Context Likelihood of Relatedness (CLR) method and by the state-of-the-art GENIE3, winner of the DREAM4 multifactorial challenge. Results: Our BRANE Cut approach infers more accurately the five DREAM4 in silico networks (with improvements from 6% to 11%). On a real Escherichia coli compendium, an improvement of 11.8% compared to CLR and 3% compared to GENIE3 is obtained in terms of Area Under Precision-Recall curve. Up to 48 additional verified interactions are obtained over GENIE3 for a given precision. On this dataset involving 4345 genes, our method achieves a performance similar to that of GENIE3, while being more than seven times faster. The BRANE Cut code is available at: http://www-syscom.univ-mlv.fr/~pirayre/Codes-GRN-BRANE-cut.html Conclusions: BRANE Cut is a weighted graph thresholding method. Using biologically sound penalties and data-driven parameters, it improves three state-of-the-art GRN inference methods. It is applicable as a generic network inference post-processing, due its computational efficiency.


2020 ◽  
Vol 17 (2) ◽  
pp. 147-154 ◽  
Author(s):  
Aditya Pratapa ◽  
Amogh P. Jalihal ◽  
Jeffrey N. Law ◽  
Aditya Bharadwaj ◽  
T. M. Murali

2018 ◽  
Author(s):  
Arnaud Bonnaffoux ◽  
Ulysse Herbach ◽  
Angélique Richard ◽  
Anissa Guillemin ◽  
Sandrine Giraud ◽  
...  

AbstractInference of gene regulatory networks from gene expression data has been a long-standing and notoriously difficult task in systems biology. Recently, single-cell transcriptomic data have been massively used for gene regulatory network inference, with both successes and limitations. In the present work we propose an iterative algorithm called WASABI, dedicated to inferring a causal dynamical network from time-stamped single-cell data, which tackles some of the limitations associated with current approaches. We first introduce the concept of waves, which posits that the information provided by an external stimulus will affect genes one-by-one through a cascade, like waves spreading through a network. This concept allows us to infer the network one gene at a time, after genes have been ordered regarding their time of regulation. We then demonstrate the ability of WASABI to correctly infer small networks, which have been simulated in silico using a mechanistic model consisting of coupled piecewise-deterministic Markov processes for the proper description of gene expression at the single-cell level. We finally apply WASABI on in vitro generated data on an avian model of erythroid differentiation. The structure of the resulting gene regulatory network sheds a fascinating new light on the molecular mechanisms controlling this process. In particular, we find no evidence for hub genes and a much more distributed network structure than expected. Interestingly, we find that a majority of genes are under the direct control of the differentiation-inducing stimulus. In conclusion, WASABI is a versatile algorithm which should help biologists to fully exploit the power of time-stamped single-cell data.


2021 ◽  
Author(s):  
Claudia Skok Gibbs ◽  
Christopher A Jackson ◽  
Giuseppe-Antonio Saldi ◽  
Aashna Shah ◽  
Andreas Tj&aumlrnberg ◽  
...  

Gene regulatory networks define regulatory relationships between transcription factors and target genes within a biological system, and reconstructing them is essential for understanding cellular growth and function. In this work, we present the Inferelator 3.0, which has been significantly updated to integrate data from distinct cell types to learn context-specific regulatory networks and aggregate them into a shared regulatory network, while retaining the functionality of the previous versions. The Inferelator 3.0 reliably learns informative networks from the model organisms Bacillus subtilis and Saccharomyces cerevisiae. We demonstrate its capabilities by learning networks for multiple distinct neuronal and glial cell types in the developing Mus musculus brain at E18 from a large (1.3 million) single-cell gene expression data set with paired single-cell chromatin accessibility data.


2020 ◽  
Vol 15 (7) ◽  
pp. 2247-2276 ◽  
Author(s):  
Bram Van de Sande ◽  
Christopher Flerin ◽  
Kristofer Davie ◽  
Maxime De Waegeneer ◽  
Gert Hulselmans ◽  
...  

2021 ◽  
Author(s):  
Matthew Stone ◽  
Sunnie Grace McCalla ◽  
Alireza Fotuhi Siahpirani ◽  
Viswesh Periyasamy ◽  
Junha Shin ◽  
...  

Single-cell RNA-sequencing (scRNA-seq) offers unparalleled insight into the transcriptional pro- grams of different cellular states by measuring the transcriptome of thousands individual cells. An emerging problem in the analysis of scRNA-seq is the inference of transcriptional gene regulatory net- works and a number of methods with different learning frameworks have been developed. Here we present a expanded benchmarking study of eleven recent network inference methods on six published single-cell RNA-sequencing datasets in human, mouse, and yeast considering different types of gold standard networks and evaluation metrics. We evaluate methods based on their computing requirements as well as on their ability to recover the network structure. We find that while no method is a universal winner and most methods have a modest recovery of experimentally derived interactions based on global metrics such as AUPR, methods are able to capture targets of regulators that are relevant to the system under study. Based on overall performance we grouped the methods into three main categories and found a combination of information-theoretic and regression-based methods to have a generally high perfor- mance. We also evaluate the utility of imputation for gene regulatory network inference and find that a small number of methods benefit from imputation, which further depends upon the dataset. Finally, comparisons to inferred networks for comparable bulk conditions showed that networks inferred from scRNA-seq datasets are often better or at par to those from bulk suggesting that scRNA-seq datasets can be a cost-effective way for gene regulatory network inference. Our analysis should be beneficial in selecting algorithms for performing network inference but also argues for improved methods and better gold standards for accurate assessment of regulatory network inference methods for mammalian systems.


Sign in / Sign up

Export Citation Format

Share Document