Inference of gene networks from gene expression time series using recurrent neural networks and sparse MAP estimation

2018 ◽  
Vol 16 (04) ◽  
pp. 1850009
Author(s):  
Chi-Kan Chen

Background: The inference of genetic regulatory networks (GRNs) provides insight into the cellular responses to signals. A class of recurrent neural networks (RNNs) capturing the dynamics of GRN has been used as a basis for inferring small-scale GRNs from gene expression time series. The Bayesian framework facilitates incorporating the hypothesis of GRN into the model estimation to improve the accuracy of GRN inference. Results: We present new methods for inferring small-scale GRNs based on RNNs. The weights of wires of RNN represent the strengths of gene-to-gene regulatory interactions. We use a class of automatic relevance determination (ARD) priors to enforce the sparsity in the maximum a posteriori (MAP) estimates of wire weights of RNN. A particle swarm optimization (PSO) is integrated as an optimization engine into the MAP estimation process. Likely networks of genes generated based on estimated wire weights are combined using the majority rule to determine a final estimated GRN. As an alternative, a class of [Formula: see text]-norm ([Formula: see text]) priors is used for attaining the sparse MAP estimates of wire weights of RNN. We also infer the GRN using the maximum likelihood (ML) estimates of wire weights of RNN. The RNN-based GRN inference algorithms, ARD-RNN, [Formula: see text]-RNN, and ML-RNN are tested on simulated and experimental E. coli and yeast time series containing 6–11 genes and 7–19 data points. Published GRN inference algorithms based on regressions and mutual information networks are performed on the benchmark datasets to compare performances. Conclusion: ARD and [Formula: see text]-norm priors are used for the estimation of wire weights of RNN. Results of GRN inference experiments show that ARD-RNN, [Formula: see text]-RNN have similar best accuracies on the simulated time series. The ARD-RNN is more accurate than [Formula: see text]-RNN, ML-RNN, and mostly more accurate than the reference algorithms on the experimental time series. The effectiveness of ARD-RNN for inferring small-scale GRNs using gene expression time series of limited length is empirically verified.

Author(s):  
Chi-Kan Chen

Abstract The inference of genetic regulatory networks (GRNs) reveals how genes interact with each other. A few genes can regulate many genes as targets to control cell functions. We present new methods based on the order-1 vector autoregression (VAR1) for inferring GRNs from gene expression time series. The methods use the automatic relevance determination (ARD) to incorporate the regulatory hub structure into the estimation of VAR1 in a Bayesian framework. Several sparse approximation schemes are applied to the estimated regression weights or VAR1 model to generate the sparse weighted adjacency matrices representing the inferred GRNs. We apply the proposed and several widespread reference methods to infer GRNs with up to 100 genes using simulated, DREAM4 in silico and experimental E. coli gene expression time series. We show that the proposed methods are efficient on simulated hub GRNs and scale-free GRNs using short time series simulated by VAR1s and outperform reference methods on small-scale DREAM4 in silico GRNs and E. coli GRNs. They can utilize the known major regulatory hubs to improve the performance on larger DREAM4 in silico GRNs and E. coli GRNs. The impact of nonlinear time series data on the performance of proposed methods is discussed.


2003 ◽  
Vol 83 (4) ◽  
pp. 835-858 ◽  
Author(s):  
Harri Lähdesmäki ◽  
Heikki Huttunen ◽  
Tommi Aho ◽  
Marja-Leena Linne ◽  
Jari Niemi ◽  
...  

2008 ◽  
Vol 7 (1) ◽  
pp. 44-55 ◽  
Author(s):  
Zidong Wang* ◽  
Fuwen Yang ◽  
Daniel W. C. Ho ◽  
Stephen Swift ◽  
Allan Tucker ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document