 Research
 Open Access
 Published:
Reverse engineering gene regulatory network based on complexvalued ordinary differential equation model
BMC Bioinformatics volume 22, Article number: 448 (2021)
Abstract
Background
The growing researches of molecular biology reveal that complex life phenomena have the ability to demonstrating various types of interactions in the level of genomics. To establish the interactions between genes or proteins and understand the intrinsic mechanisms of biological systems have become an urgent need and study hotspot.
Results
In order to forecast gene expression data and identify more accurate gene regulatory network, complexvalued version of ordinary differential equation (CVODE) is proposed in this paper. In order to optimize CVODE model, a complexvalued hybrid evolutionary method based on Grammarguided genetic programming and complexvalued firefly algorithm is presented.
Conclusions
When tested on three real gene expression datasets from E. coli and Human Cell, the experiment results suggest that CVODE model could improve 20–50% prediction accuracy of gene expression data, which could also infer more truepositive regulatory relationships and less falsepositive regulations than ordinary differential equation.
Background
The aim of gene regulatory network (GRN) research is to explain comprehensively the generation process and complex regulatory relationships of genes and their products in biological tissues from the perspective of system scale [1,2,3]. GRN is an important way to cope with various internal and external stimuli by synergizing the functions of genes. GRN is a complex continuous and dynamic system, in which gene regulation is a dynamic event that changes with time and environment [4,5,6]. Gene expression data could reflect the regulatory orders of genes and the important information of regulatory objects [7]. With the development of DNA microarray or chip technology, a large amount of gene expression profiles have been generated, which provide a condition for identifying gene regulatory networks using computational models [8,9,10].
Some computational approaches have been developed to describe biology networks [11,12,13,14,15,16,17], especially the regulatory relationships between genes with gene expression time series, such as directed graph [18], Boolean network [3, 19], Bayesian network [20, 21], differential equation [22], neural network [23,24,25], stochastic equation [26, 27], etc. Differential equation model is more conducive to describing the concentration evolution of biological macromolecules such as RNA and protein over time. Therefore, this model has been widely utilized in pharmacokinetics, enzymology and gene regulatory network construction [28,29,30,31,32,33]. For each target gene, its corresponding differential equation is identified, in which the dependent variables (genes) indicate the corresponding regulatory factors of target gene. Hohm and Zitzler resolved the issue of how to optimize the parameters of ordinary differential equation (ODE) for GRN inference [34]. Tian et al. proposed stochastic delay differential equations to describe the timedelayed regulatory relationships in GRN [35]. Gebert and Jong proposed piecewise linear differential equation to identify the most relevant regulating interactions in GRN [36, 37]. Zhang et al. proposed singleindex ODE model and clipped absolute deviation penalty penalized function to infer network structure [38]. Matsumoto et al. proposed ODE models to identify GRN with singlecell RNASeq data [39]. Some special nonlinear ODE models also have been proposed to infer GRN, such as Ssystem model [40,41,42].
Recently the complex versions of many models have been proposed due to their potential to optimize more easily, better generalization characteristics, faster learning and higher noiserobust memory mechanisms [43,44,45]. You and Hong presented multilayer feedforward neural network (MFNN) with complexvalued activation function to model QAM signals of different constellation sizes [46]. Deng et al. also proposed complexvalued radial basis function neural network (CVRBFNN) to deal with QAM signals and the results showed that CVRBFNN performed better than functional link artificial neural network [47]. Hu et al. discussed the global stability of the complexvalued and delayed version of recurrent neural network [48]. Trabelsi et al. proposed complexvalued convolutional feedforward networks [49]. Yang et al. proposed a novel complexvalued method based on mathematical expression to resolve realvalued prediction and classification problems [50].
In order to forecast gene expression data and identify GRN accurately, complexvalued ordinary differential equation (CVODE) is presented in this paper. Grammarguided genetic programming (GGGP) is utilized to evolve the structure of CVODE and complexvalued firefly algorithm (CFA) is proposed to search the optimal complexvalued parameters of model. Three real gene expression datasets are applied to test the inference performances of our proposed methods.
Results and discussion
Three real gene expression data sets are utilized to test the performance of our proposed method. All the real gene expression data need to be normalized, which is defined as follows.
where \(g_{\min }\) and \(g_{\max }\) are the minimum and maximum of dataset, respectively.
In our experiment, ODE and CVODE models are both applied to predict gene expression data and infer gene regulatory networks with three real gene expression datasets. Our proposed hybrid evolutionary algorithm is utilized to infer ODE and CVODE models and the parameters are the same. In GGGP, population size is set to 50, crossover rate is set to 0.9 and mutation rate is set to 0.1. In CFA, population size is set as 100, and step size is set as 0.02. The parameters are selected according to previous research results [51,52,53]. Sensitive (\(S_{n}\)) and Specificity (\(S_{p}\)) are utilized to evaluate the inferred gene regulatory networks. \(S_{n}\) represents the proportion of the positive samples to be identified correctly in all positive ones. \(S_{p}\) denotes the proportion of the negative samples to be identified correctly in all negative ones.
SOS DNA repair network
SOS DNA damage repair network is selected as the first real gene regulatory network, which contains six main genes (uvrD, lexA, umuD, recA, uvrA and polB). The real structure of SOS DNA damage repair network is depicted in Fig. 1. The gene expression data used in this experiment are from Uri Alon [54, 55]. The DNA repair process of E. coli is observed by ultraviolet irradiation. The expression levels of six genes at different time points are measured.
The datasets from the first three experiments are utilized to optimize the CVODE models. The last dataset is utilized to test. With hybrid evolutionary algorithm the corresponding CVODE models of six genes are described as follows. Variables \(x_{1} ,x_{2} , \ldots ,x_{6}\) represent six genes: uvrD, lexA, umuD, recA, uvrA and polB, respectively.
ODE models are also utilized to infer SOS network. The predicted results of ODE and CVODE for six genes are depicted in Fig. 2. From Fig. 2, it could be seen that the results of CVODE predicted are closer to real ones than ODE. In order to compare clearly, the prediction RMSE values of ODE and CVODE for six genes are listed in Table 1, which reveals that CVODE model has smaller prediction RMSE values than ODE for six genes. On average CVODE could decrease 34.4% RMSE value.
In order to test the modeling performance of CVODE further, the fitness values of ODE and CVODE against generations are plotted in Fig. 3. From Fig. 3, we can see that the hybrid evolutionary algorithm could search the optimal CVODE model with about 20 generations, while the optimal ODE model is found with about 50 generations. Thus CVODE model has smaller fitness value and gains the optimal solution with fewer generations than ODE model.
The inferred SOS networks by ODE and CVODE are depicted in Fig. 4. Compared Fig. 1 with Fig. 4, it could be seen that CVODE model could identify 7 truepositive (real) regulations and 17 falsepositive regulatory relationships, while ODE model could identify 5 truepositive relationships and 18 falsepositive relationships. The performances of \(S_{n}\) and \(S_{p}\) of SOS networks inferred by ODE and CVODE are listed in Table 2. In terms of \(S_{n}\), CVODE is 39.99% higher than ODE. In terms of \(S_{p}\), our method is 9.1% higher than ODE. The results reveal that our method could identify all truepositive regulatory relationships and less falsepositive regulations than ODE model.
Human cell timeseries data
Cell cycle refers to the whole the process from the beginning of one cell division to the end of the next division. The second real gene expression time series data are from the genes periodically expressed, which were supplied by Whitfield [56]. The experiment includes five periods and 1134 genes. The sub dataset extracted in this part includes five genes and 46 time points, in which the first 40 time points are utilized to search the optimal CVODE models and the rest time points are utilized to test the performance. By applying our method, we have obtained the following CVODE models. Variables \(x_{1} ,x_{2} , \ldots ,x_{5}\) represent five genes, respectively.
The prediction errors of ODE and CVODE are depicted in Fig. 5, which reveals that the prediction errors of CVODE are closer to zero than ones of ODE. The predicted RMSE values of ODE and CVODE are listed in Table 3. For the predicted results of five genes, CVODE has smaller prediction RMSE values than ODE, which show that CVODE could more accurately predict gene expression data. On average CVODE could decrease 49.07% RMSE value.
E. coli database
The third real gene expression dataset is extracted from polymicrobial probe database (version 4 build 6), which contains 4297 genes and 907 biology experiments [57]. The used dataset contains the first 35 experiments, in which the first 30 time points are utilized to search the optimal CVODE models and the rest time points are utilized as testing data. Eight genes (Crp, araC, nagC, chbC, araE, araA, chbA and chbF) are chosen and the real network structure is from RegulonDB [58] containing 15 regulations, which is described in Fig. 6.
Through our proposed hybrid evolutionary method, we could obtain the CVODE models as Eqs. (4). Variables \(x_{1} ,x_{2} , \ldots ,x_{8}\) represent genes Crp, araC, nagC, chbC, araE, araA, chbA and chbF, respectively.
The predicted errors of ODE and CVODE are depicted in Fig. 7, which reveal that the predicted errors of CVODE are closer to zero than ones of ODE. The predicted RMSE values of ODE and CVODE are listed in Table 4. For Gene1, Gene2, Gene4, Gene7 and Gene8, CVODE has smaller predicted RMSE values than ODE. For Gene3, Gene5 and Gene6, ODE performs better than CVODE. On average CVODE could improve 20.69% prediction accuracy and more accurately forecast gene expression data than ODE.
According to the optimal CVODE models, the inferred E. coli subnetwork is described in Fig. 8b. ODE models are also utilized to infer E. coli and the result is also depicted in Fig. 8a. Compared with real network structure, we can see that CVODE model could identify 14 truepositive regulations and ODE model could identify 12 truepositive relationships. The performances of \(S_{n}\) and \(S_{p}\) of E. coli networks inferred by ODE and CVODE are listed in Table 5. From the inferred results, it could be seen that CVODE could identify more accurately gene regulatory network than ODE model.
Conclusions
In this paper, we have presented complexvalued ODE model to identify the regulations among genes for gene regulatory network inference. Grammarguided genetic programming and complexvalued firefly algorithm are proposed to search the optimal structure and parameters of CVODE. Three real gene expression datasets are utilized and the results reveal that CVODE model could not only improve 20%50% prediction accuracy of gene expression data, but also identify more truepositive regulatory relationships than ODE.
Our proposed method has some advantages including (1) compared with ODE, CVODE has the complexvalued structures, constants and coefficients, which could improve the modeling ability; (2) GGGP overcomes the shortcomings of GP and CFA has more population diversity and faster convergence than the traditional firefly algorithm, so our proposed hybrid optimization method based on GGGP and CFA could search the optimal model faster; (3) because of the equipment and sample tissues, the expression data may contain noise during the data collection process. Complexvalued methods have higher noiserobust memory mechanisms, so CVODE model has better performance than ODE.
In the further, CVODE will be applied for real largescale GRN inference. The optimization of complexvalued model needs many computing resources, so the parallel technologies will improve the learning speed of model in the following work.
Methods
Complexvalued ordinary differential equation model
Complexvalued ordinary differential equation (CVODE) model is a variant of ODE model, whose coefficients and functions are complexvalued. Its expression is given as followed [59].
where \(Z\) is complexvalued independent variable, \(\beta\) is complexvalued coefficient vector, \(t\) is the time point and \(F( \cdot )\) is complexvalued unknown function.
Structure optimization
Grammarguided genetic programming (GGGP) is an improved version of genetic programming (GP), which overcomes the shortcomings of GP, such as the generation and preservation of valid programs, small search space, and complex genetic operators [51,52,53,54,55,56,57,58,59,60]. GGGP is presented to evolve the structure of CVODE model. In GGGP, contextfree grammar (CFG) model is utilized to guide the evolutionary process of GP in order to obtain the optimal solution faster.
CFG model contains a quadruple, which is represented as \(G = \{ N,\;T,\;P,\;\sum \}\), where \(N\) is nonterminal symbol set, \(T\) is terminal symbol set, \(P\) is production rule set and \(\sum\) is beginning symbol set. Four sets satisfy the conditions: \(N \cap T = \phi\) and \(\sum \in N\). An element in production rule set is represented as \(x \to y\), where \(x \in N\), and \(y \in N \cup T\). In order to represent an example of CVODE model \(\sin z + \cos z  z\), four sets of CFG model are defined in advance. \(N = \{ s,\;exp,\;op,\;pre,\;var\}\), \(T = \{ \sin ,\;\cos ,\; + ,\;  ,\;z\}\), \(\sum = \{ s\}\), and \(P\) is given as
The derived tree of CVODE model \(\sin z + \cos z  z\) is obtained by generating sentence through contextfree grammar, which is depicted in Fig. 9.
In GGGP, the individuals come from the derived trees of the grammar models. As the same as GP, GGGP also has genetic operators to evolve the derived trees, which contain selection, replication, crossover and mutation. Selection and replication mechanisms are consistent with GP. For crossover mechanism, two derived trees are randomly selected, and two subtrees with the same source characteristics are selected to be crossed, whose root nodes have the same nonterminal symbols. For mutation mechanism, an internal node is selected randomly. If the node is a nonterminal node, the node is retained and the subtree with this node as the root node is deleted and replaced by a subtree created by syntax rules. If this node is the terminal node, it is replaced by a new terminal node created randomly.
Parameter optimization
Complexvalued firefly algorithm (CFA) is an efficient complexvalued evolutionary algorithm, which is based on the mutual attraction and movement processes of complexvalued fireflies [52]. Compared with many traditional evolutionary algorithms, CFA has some advantages, such as simple design, few parameters, strong robustness, high population diversity and fast convergence.
In CFA, the positions of firefly populations are complex, so the real parts and imaginary parts of the positions of firefly populations need to be optimized in parallel. In CVODE model, complexvalued constants and coefficients need to be optimized. In this paper, CFA is presented to evolve the parameters of CVODE. The detail optimization process of parameters of CVODE with CFA is given in Algorithm 1.
The flowchart of GRN inference with CVODE
In this paper, CVODE is utilized to infer gene regulatory network, in which GGGP and CFA are proposed to optimize CVODE model. Suppose that gene expression data \([D_{1} ,D_{2} , \ldots ,D_{m} ]\) contains \(m\) genes and each gene contains \(n\) time points (\(D_{i} = [D_{{_{i} }}^{1} ,D_{i}^{2} , \ldots ,D_{i}^{n} ]\)). The inference flowchart of GRN with \(m\) genes by our proposed algorithm is described in Fig. 10 The detailed process is given as follows.

(1)
Due to that the input data of CVODE model are complexvalued, gene expression data need to convert into complex data using Algorithm 2 before GRN inference.

(2)
The regulatory relationships of each target gene are inferred by CVODE model independently. For gene i, with gene expression data, the process of searching the optimal CVODE model is introduced as followed.

1.
Initialize \(N\) CVODE individuls.

2.
Calculate the fitness values of \(N\) CVODE individuals. The complex outputs need to be converted into real values by Algorithm 3.

3.
GGGP is applied to search the optimal structure of CVODE, which is introduced in Sect. 2.2. At some iterations, CFA is utilized to search the optimal complexvalued parameters of CVODE, whose structure is fixed.

4.
If the satisfied condition is achieved, the optimal process stops; otherwise, go to step 2).

1.

(3)
If the optimal CVODE contains independent variables, the corresponding genes of independent variables could regulate the target gene. For example gene \(j\) is included in the optimal CVODE \(\frac{{dZ_{i} }}{dt} = f(Z_{j} )\), which means that gene \(i\) is regulated by gene \(j\).

(4)
\(i + + .\) If the regulatory relationships of all genes have been identified, create overall gene regulatory network; otherwise go to step (2).
Availability of data and materials
Data used in this study are openly available. SOS DNA repair network data is available from http://www.weizmann.ac.il/mcb/UriAlon/download/downloadabledata. Human cell timeseries data is available from http://genomewww.stanford.edu/HumanCellCycle/HeLa/. The E. coli data is available from http://m3d.mssm.edu/.
Abbreviations
 GRN:

Gene regulatory network
 CVODE:

Complexvalued version of ordinary differential equation
 GGGP:

Grammarguided genetic programming
 ODE:

Ordinary differential equation
 CVRBFNN:

Complexvalued radial basis function neural network
 CFA:

Complexvalued firefly algorithm
 GP:

Genetic programming
 CFG:

Contextfree grammar
References
 1.
Marcel S, Ramon MMJ, Panagiota M, Wittbrodt B, Wittbrodt J. A global survey identifies novel upstream components of the Ath5 neurogenic network. Genome Biol. 2009;10(9):R92.
 2.
Israel JW, Martik ML, Byrne M, Raff EC, Raff RA, McClay DR, Wray GA. Comparative developmental transcriptomics reveals rewiring of a highly conserved gene regulatory network during a major life history switch in the sea urchin genus heliocidaris. PLoS Biol. 2016;14(3):e1002391.
 3.
Taou NS, Corne DW, Lones MA. Investigating the use of boolean networks for the control of gene regulatory networks. J Comput Sci. 2018;26:147–56.
 4.
Jin ZC, Cheng WU, Gao QB, Jiang Y. Gene regulatory network models based on time series gene expression data: recent progress. Acad J Second Mil Univ. 2008;28(9):1106–9.
 5.
Wu H, Lu T, Xue H, Liang H. Sparse additive ordinary differential equations for dynamic gene regulatory network modeling. J Am Stat Assoc. 2014;109(506):700–16.
 6.
Ortizgutiérrez E, Garcíacruz K, Azpeitia E, Castillo A, de la Paz Sánchez M, ÁlvarezBuylla ER. A dynamic gene regulatory network model that recovers the cyclic behavior of arabidopsis thaliana cell cycle. PLoS Comput Biol. 2015;11(9):e1004486.
 7.
Zheng CH, Huang DS, Zhang L, Kong XZ. Tumor clustering using nonnegative matrix factorization with gene selection. IEEE Trans Inf Technol Biomed. 2009;13(4):599–607.
 8.
Modrák M, Vohradský J. Genexpi: a toolset for identifying regulons and validating gene regulatory networks using timecourse expression data. BMC Bioinform. 2018;19(1):137.
 9.
Thomas T. Approximate inference of gene regulatory network models from RNASeq time series data. BMC Bioinform. 2018;19:127.
 10.
Thomas R, Mehrotra S, Papoutsakis ET, Hatzimanikatis V. A modelbased optimization framework for the inference on gene regulatory networks from DNA array data. Bioinformatics. 2004;20(17):3221–35.
 11.
Huang DS, Yu HJ. Normalized feature vectors: a novel alignmentfree sequence comparison method based on the numbers of adjacent amino acids. IEEE/ACM Trans Comput Biol Bioinform. 2013;10(2):457–67.
 12.
Zheng CH, Zhang L, Ng VT, Shiu SC, Huang DS. Molecular pattern discovery based on penalized matrix decomposition. IEEE/ACM Trans Comput Biol Bioinform. 2011;8(6):1592–603.
 13.
Huang DS, Zheng CH. Independent component analysis based penalized discriminant method for tumor classification using gene expression data. Bioinformatics. 2006;22(15):1855–62.
 14.
Zhu L, You ZH, Huang DS, Wang B. tLSE: a novel robust geometric approach for modeling proteinprotein interaction networks. PLoS ONE. 2013;8(4):e58368.
 15.
Huang DS, Zhang L, Han K, Deng S, Yang K, Zhang H. Prediction of proteinprotein interactions based on proteinprotein correlation using least squares regression. Curr Protein Pept Sci. 2014;15(6):553–60.
 16.
Bao WZ, Huang ZH, Yuan CA, Huang DS. Pupylation sites prediction with ensemble classification model. Int J Data Mining and Bioinformatics. 2017;18(2):91–104.
 17.
Bao W, Wang D, Chen Y. Classification of protein structure classes on flexible neutral tree. IEEE/ACM Trans Comput Biol Bioinform. 2017;14(5):1122–33.
 18.
Pietro Z, Sandro M, Michele C. TimeDelayARACNE: Reverse engineering of gene networks from timecourse data by an information theoretic approach. BMC Bioinform. 2010;11:154.
 19.
Liu Z, He Q. A novel boolean network for analyzing the p53 gene regulatory network. Curr Bioinform. 2016;11(1):13–21.
 20.
Njah H, Jamoussi S. Weighted ensemble learning of Bayesian network for gene regulatory networks. Neurocomputing. 2015;150:404–16.
 21.
Xing L, Guo M, Liu X, Wang C, Zhang L. Gene regulatory networks reconstruction using the floodingpruning hillclimbing algorithm. Genes. 2018;9(7):342.
 22.
Tao L, Min W. Investigate data dependency for dynamic gene regulatory network identification through highdimensional differential equation approach. Commun Stat Simul Comput. 2014;45(7):2377–91.
 23.
Huang DS. Systematic theory of neural networks for pattern recognition. Beijing: Publishing House of Electronic Industry of China; 1996.
 24.
Huang DS. Radial basis probabilistic neural networks: Model and application. Int J Pattern Recognit Artif Intell. 1999;13(7):1083–101.
 25.
Yang B, Chen Y, Jiang M. Reverse engineering of gene regulatory networks using flexible neural tree models. Neurocomputing. 2013;99(1):458–66.
 26.
Hegland M, Burden C, Santoso L, MacNamara S, Booth H. A solver for the stochastic master equation applied to gene regulatory networks. J Comput Appl Math. 2007;205(2):708–24.
 27.
Munsky B, Khammash M. The finite state projection approach for the analysis of stochastic noise in gene networks. IEEE Trans Autom Control. 2008;53(Special Issue):201–14.
 28.
Ding H, Luo LF. Kinetic model of the lysogeny/lysis switch of phage λ. Chin Phys Lett. 2009;26(9):098701.
 29.
Ji ZW, Su J, Wu D, Peng HM, Zhao WL, Zhao BN, Zhou XB. Predicting the impact of combined therapies on myeloma cell growth using a hybrid multiscale agentbased model. Oncotarget. 2017;8(5):7647–65.
 30.
Ding H, Luo LF, Lin H. Entropy production rate changes in lysogeny/lysis switch regulation of bacteriophage lambda. Commun Theor Phys. 2011;55(2):371–5.
 31.
Ji ZW, Zhao WL, Lin HK, Zhou XB. Systematically understanding the immunity leading to CRPC progression. PLoS Comput Biol. 2019;15(9):e1007344.
 32.
Feng W, Ding H, Lin H, Luo LF. The lysogeny/lysis switch and entropies of stationary states in λ phage. Acta Phys Sin. 2012;61(16):168701.
 33.
Ji ZW, Yan K, Li WY, Hu HG, Zhu XL. Mathematical and computational modeling in complex biological systems. Biomed Res Int. 2017;2017:5958321.
 34.
Hohm T, Zitzler E. Multicellular pattern formation: parameter estimation for ordinary differential equationbased gene regulatory network models. IEEE Eng Med Biol Mag Q Mag Eng Med Biol Soc. 2009;28(4):52.
 35.
Tian T, Burrage K, Burrage PM, Carletti M. Stochastic delay differential equations for genetic regulatory networks. J Comput Appl Math. 2007;205(2):696–707.
 36.
Gebert J, Radde N, Weber GW. Modeling gene regulatory networks with piecewise linear differential equations. Eur J Oper Res. 2007;181(3):1148–65.
 37.
Jong HD, Page M. Search for steady states of piecewiselinear differential equation models of genetic regulatory networks. IEEE/ACM Trans Comput Biol Bioinform. 2008;5(2):208–22.
 38.
Zhang Q, Yu Y, Zhang J, Liang H. Using singleindex ODEs to study dynamic gene regulatory network. PLoS ONE. 2018;13(2):e0192833.
 39.
Matsumoto H, Kiryu H, Furusawa C, Ko MSH, Ko SBH, Gouda N, Hayashi T, Nikaido I. SCODE: an efficient regulatory network inference algorithm from singlecell RNASeq during differentiation. Bioinformatics. 2017;33(15):2314–21.
 40.
Lee WP, Hsiao YT. An adaptive GAPSO approach with gene clustering to infer ssystem models of gene regulatory networks. Comput J. 2011;54(9):1449–64.
 41.
Chowdhury AR, Chetty M, Evans R. Stochastic Ssystem modeling of gene regulatory network. Cogn Neurodyn. 2015;9(5):535–47.
 42.
Chowdhury AR, Chetty M. Network decomposition based largescale reverse engineering of gene regulatory network. Neurocomputing. 2015;160(21):213–27.
 43.
Nitta T. On the critical points of the complexvalued neural network. In: 9th international conference on neural information processing. 2002; p. 1099–1103.
 44.
Hirose A, Yoshida S. Generalization characteristics of complexvalued feedforward neural networks in relation to signal coherence. IEEE Trans Neural Netw Learn Syst. 2012;23(4):541–51.
 45.
Wisdom S, Powers T, Hershey JR, Roux JL, Atlas L. Fullcapacity unitary recurrent neural networks. Adv Neural Inf Process Syst. 2016;29:4880–8.
 46.
You C, Hong D. Nonlinear blind equalization schemes using complexvalued multilayer feedforward neural networks. IEEE Trans Neural Netw. 1998;9(6):1442–55.
 47.
Deng JP, Sundararajan N, Saratchandran P. Communication channel equalization using complexvalued minimal radial basis function neural networks. IEEE Trans Neural Netw. 2002;13(3):687–96.
 48.
Hu J, Wang J. Global stability of complexvalued recurrent neural networks with timedelays. IEEE Trans Neural Netw Learn Syst. 2012;23(6):853–65.
 49.
Trabelsi C, Bilaniuk O, Zhang Y, Serdyuk D, Subramanian S. Deep complex networks. In: ICLR. 2018; p. 1–19.
 50.
Yang B, Chen YH. A new complexvalued polynomial model. Neural Process Lett. 2018;50:1–18.
 51.
Wu P, Chen Y. Grammar guided genetic programming for flexible neural trees optimization. Lect Notes Comput Sci. 2007;4426:964–71.
 52.
Song C. A complexvalued firefly algorithm. Intell Comput Theor Appl. 2019;11644:700–7.
 53.
Yang XS, Hosseini SSS, Gandomi AH. Firefly Algorithm for solving nonconvex economic dispatch problems with valve loading effect. Appl Soft Comput. 2012;12(3):1180–6.
 54.
Raza K, Alam M. Recurrent neural network based hybrid model for reconstructing gene regulatory network. Comput Biol Chem. 2016;64:322–34.
 55.
Ronen M, Rosenberg R, Shraiman BI, Alon U. Assigning numbers to the arrows: parameterizing a gene regulation network by using accurate expression kinetics. Proc Natl Acad Sci. 2002;99(16):10555–60.
 56.
Whitfield ML, Sherlock G, Saldanha AJ, Murray JI, Ball CA, Alexander KE, Matese JC, Perou CM, Hurt MM, Brown PO, Botstein D. Identification of genes periodically expressed in the human cell cycle and their expression in tumors. Mol Biol Cell. 2002;13:1977–2000.
 57.
Faith JJ, Driscoll ME, Fusaro VA, Cosgrove EJ, Hayete B, Juhn FS, Schneider SJ, Gardner TS. Many Microbe Microarrays Database: uniformly normalized Affymetrix compendia with structured experimental metadata. Nucleic Acids Res. 2008;36:D866–70.
 58.
Alberto S, Heladia S, Socorro G, et al. RegulonDB v 10.5: tackling challenges to unify classic and high throughput knowledge of gene regulation in E. coli K12. Nucleic Acids Res. 2019;47(1):212–20.
 59.
Yang B, Bao WZ. Complexvalued ordinary differential equation modeling for time series identification. IEEE Access. 2019;7:41033–42.
 60.
Luna JM, Romero JR, Ventura S. Design and behavior study of a grammarguided genetic programming algorithm for mining association rules. Knowl Inf Syst. 2012;32(1):53–76.
Acknowledgements
Not applicable.
About this supplement
This article has been published as part of BMC Bioinformatics Volume 22 Supplement 3, 2021: Proceedings of the 2019 International Conference on Intelligent Computing (ICIC 2019): bioinformatics. The full contents of the supplement are available online at https://0bmcbioinformaticsbiomedcentralcom.brum.beds.ac.uk/articles/supplements/volume22supplement3.
Funding
Publication costs are funded in part by Youth Innovation Team of Scientific Research Foundation of the Higher Education Institutions of Shandong Province, China (No. 2019KJM006), and the talent project of "Qingtan scholar" of Zaozhuang University. The funding bodies had no role in the design of the study and collection, analysis, and interpretation of data and in writing the manuscript. This work was supported by the Natural Science Foundation of China (No. 61902337), Natural Science Fund for Colleges and Universities in Jiangsu Province (No. 19KJB520016), Jiangsu Provincial Natural Science Foundation (No. SBK2019040953), Young talents of science and technology in Jiangsu.
Author information
Affiliations
Contributions
BY conceived the method. WZB designed the method. WZ and HFW collected the experiment data. CDS extracted the data. YHC and XYJ conducted the experiments. All authors reviewed and approved the final version of the manuscript. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.
About this article
Cite this article
Yang, B., Bao, W., Zhang, W. et al. Reverse engineering gene regulatory network based on complexvalued ordinary differential equation model. BMC Bioinformatics 22, 448 (2021). https://0doiorg.brum.beds.ac.uk/10.1186/s12859021043672
Received:
Accepted:
Published:
DOI: https://0doiorg.brum.beds.ac.uk/10.1186/s12859021043672
Keywords
 Gene regulatory network
 Complexvalued ordinary differential equation
 Grammarguided genetic programming
 Firefly algorithm