scholarly journals Towards inferring causal gene regulatory networks from single cell expression Measurements

2018 ◽  
Author(s):  
Xiaojie Qiu ◽  
Arman Rahimzamani ◽  
Li Wang ◽  
Qi Mao ◽  
Timothy Durham ◽  
...  

AbstractSingle-cell transcriptome sequencing now routinely samples thousands of cells, potentially providing enough data to reconstruct causal gene regulatory networks from observational data. Here, we present Scribe, a toolkit for detecting and visualizing causal regulatory interactions between genes and explore the potential for single-cell experiments to power network reconstruction. Scribe employs Restricted Directed Information to determine causality by estimating the strength of information transferred from a potential regulator to its downstream target. We apply Scribe and other leading approaches for causal network reconstruction to several types of single-cell measurements and show that there is a dramatic drop in performance for "pseudotime” ordered single-cell data compared to true time series data. We demonstrate that performing causal inference requires temporal coupling between measurements. We show that methods such as “RNA velocity” restore some degree of coupling through an analysis of chromaffin cell fate commitment. These analyses therefore highlight an important shortcoming in experimental and computational methods for analyzing gene regulation at single-cell resolution and point the way towards overcoming it.


2020 ◽  
Vol 36 (19) ◽  
pp. 4885-4893 ◽  
Author(s):  
Baoshan Ma ◽  
Mingkun Fang ◽  
Xiangtian Jiao

Abstract Motivation Gene regulatory networks (GRNs) capture the regulatory interactions between genes, resulting from the fundamental biological process of transcription and translation. In some cases, the topology of GRNs is not known, and has to be inferred from gene expression data. Most of the existing GRNs reconstruction algorithms are either applied to time-series data or steady-state data. Although time-series data include more information about the system dynamics, steady-state data imply stability of the underlying regulatory networks. Results In this article, we propose a method for inferring GRNs from time-series and steady-state data jointly. We make use of a non-linear ordinary differential equations framework to model dynamic gene regulation and an importance measurement strategy to infer all putative regulatory links efficiently. The proposed method is evaluated extensively on the artificial DREAM4 dataset and two real gene expression datasets of yeast and Escherichia coli. Based on public benchmark datasets, the proposed method outperforms other popular inference algorithms in terms of overall score. By comparing the performance on the datasets with different scales, the results show that our method still keeps good robustness and accuracy at a low computational complexity. Availability and implementation The proposed method is written in the Python language, and is available at: https://github.com/lab319/GRNs_nonlinear_ODEs Supplementary information Supplementary data are available at Bioinformatics online.



Cell ◽  
2019 ◽  
Vol 176 (1-2) ◽  
pp. 361-376.e17 ◽  
Author(s):  
Adam J. Rubin ◽  
Kevin R. Parker ◽  
Ansuman T. Satpathy ◽  
Yanyan Qi ◽  
Beijing Wu ◽  
...  


2021 ◽  
Author(s):  
Marzieh Emadi ◽  
Farsad Zamani Boroujeni ◽  
jamshid Pirgazi

Abstract Recently with the advancement of high-throughput sequencing, gene regulatory network inference has turned into an interesting subject in bioinformatics and system biology. But there are many challenges in the field such as noisy data, uncertainty, time-series data with numerous gene numbers and low data, time complexity and so on. In recent years, many research works have been conducted to tackle these challenges, resulting in different methods in gene regulatory networks inference. A number of models have been used in modeling of the gene regulatory networks including Boolean networks, Bayesian networks, Markov model, relational networks, state space model, differential equations model, artificial neural networks and so on. In this paper, the fuzzy cognitive maps are used to model gene regulatory networks because of their dynamic nature and learning capabilities for handling non-linearity and inherent uncertainty. Fuzzy cognitive maps belong to the family of recurrent networks and are well-suited for gene regulatory networks. In this research study, the Kalman filtered compressed sensing is used to infer the fuzzy cognitive map for the gene regulatory networks. This approach, using the advantages of compressed sensing and Kalman filters, allows robustness to noise and learning of sparse gene regulatory networks from data with high gene number and low samples. In the proposed method, stream data and previous knowledge can be used in the inference process. Furthermore, compressed sensing finds likely edges and Kalman filter estimates their weights. The proposed approach uses a novel method to decrease the noise of data. The proposed method is compared to CSFCM, LASSOFCM, KFRegular, ABC, RCGA, ICLA, and CMI2NI. The results show that the proposed approach is superior to the other approaches in fuzzy cognitive maps learning. This behavior is related to the stability against noise and offers a proper balance between data error and network structure.



2014 ◽  
Vol 138 ◽  
pp. 57-63 ◽  
Author(s):  
Yongqing Zhang ◽  
Yifei Pu ◽  
Haisen Zhang ◽  
Yong Cong ◽  
Jiliu Zhou


Sign in / Sign up

Export Citation Format

Share Document