Reconstructing Genetic Regulatory Networks Using Two-Step Algorithms with the Differential Equation Models of Neural Networks
- 192 Downloads
The identification of genetic regulatory networks (GRNs) provides insights into complex cellular processes. A class of recurrent neural networks (RNNs) captures the dynamics of GRN. Algorithms combining the RNN and machine learning schemes were proposed to reconstruct small-scale GRNs using gene expression time series.
We present new GRN reconstruction methods with neural networks. The RNN is extended to a class of recurrent multilayer perceptrons (RMLPs) with latent nodes. Our methods contain two steps: the edge rank assignment step and the network construction step. The former assigns ranks to all possible edges by a recursive procedure based on the estimated weights of wires of RNN/RMLP (RERNN/RERMLP), and the latter constructs a network consisting of top-ranked edges under which the optimized RNN simulates the gene expression time series. The particle swarm optimization (PSO) is applied to optimize the parameters of RNNs and RMLPs in a two-step algorithm. The proposed RERNN-RNN and RERMLP-RNN algorithms are tested on synthetic and experimental gene expression time series of small GRNs of about 10 genes. The experimental time series are from the studies of yeast cell cycle regulated genes and E. coli DNA repair genes.
The unstable estimation of RNN using experimental time series having limited data points can lead to fairly arbitrary predicted GRNs. Our methods incorporate RNN and RMLP into a two-step structure learning procedure. Results show that the RERMLP using the RMLP with a suitable number of latent nodes to reduce the parameter dimension often result in more accurate edge ranks than the RERNN using the regularized RNN on short simulated time series. Combining by a weighted majority voting rule the networks derived by the RERMLP-RNN using different numbers of latent nodes in step one to infer the GRN, the method performs consistently and outperforms published algorithms for GRN reconstruction on most benchmark time series. The framework of two-step algorithms can potentially incorporate with different nonlinear differential equation models to reconstruct the GRN.
KeywordsGRN Reconstruction Gene expression time series RNN RMLP Two-step algorithm
- 2.Liang S, Fuhrman S, Somogyi R (1998) REVEAL, a general reverse engineering algorithm for inference of genetic network architectures. Pac Symp Biocomput 3:18–29Google Scholar
- 4.Werhli AV and Husmeier, D (2007) Reconstructing gene regulatory networks with bayesian networks by combining expression data with multiple sources of prior knowledge. Stat Appl Genet Mol Biol 6 (Article 15)Google Scholar
- 12.Meyer PE et al (2007) Information-theoretic inference of large transcriptional regulatory networks. EURASIP J Bioinform Syst Biol 27:79879Google Scholar
- 23.Noman N, Palafox L, Iba H (2013) Reconstruction of gene regulatory networks from gene expression data using decoupled recurrent neural network model. In: Suzuki Y, Nakagaki T (eds) Natural computing and beyond, Winter school Hakodate 2011, Hakodate, Japan, March 2011 and 6th international workshop on natural computing, Tokyo, Japan, March 2012, proceedings. Springer Japan, Tokyo, pp 93–103Google Scholar
- 24.Khan A et al (2016) Construction of gene regulatory networks using recurrent neural networks and swarm intelligence. Scientifica 2016:1060843Google Scholar
- 25.Maraziotis I, Dragomirn A, and Bezerianos A (2005) Recurrent neural-fuzzy network models for reverse engineering gene regulatory interactions. In: First international symposium, CompLife 2005. 2005, Konstanz, Germany, SpringerGoogle Scholar
- 26.Eberhart RC and Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micromachine and human science, 1995, pp 39–43Google Scholar
- 28.Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Springer-Verlag, New YorkGoogle Scholar
- 29.R Core Team (2017) R: A language and environment for statistical computing R. Foundation for Statistical Computing, Vienna, AustriaGoogle Scholar
- 30.Clerc M (2012) Standard Particle Swarm Optimisation. Particle Swarm Central, Tech. Rep. http://clerc.maurice.free.fr/pso/SPSO_descriptions.pdf. Accessed 24 Sept 2012
- 35.GNW DREAM Challenges. http://gnw.sourceforge.net/dreamchallenge.html. Accessed 7 Jan 2017
- 39.Yeast cell cycle analysis project. http://genome-www.stanford.edu/cellcycle/data/rawdata. Accessed 7 Jan 2017
- 41.Uri Alon Lab. http://www.weizmann.ac.il/mcb/UriAlon/download/downloadable-data. Accessed 7 Jan 2017
- 42.Marsaglia G, Tsang WW, Wang J (2003) Evaluating Kolmogorov’s distribution. J Stat Softw 18(8):1–4Google Scholar
- 45.Charbonnier C, Chiquet J and Ambroise C (2010) Weighted-LASSO for structured network inference from time course data. Stat Appl Genet Mol 9 (Article 15)Google Scholar