Skip to main content
Journal of Biological Physics logoLink to Journal of Biological Physics
. 2022 Jan 6;48(1):93–110. doi: 10.1007/s10867-021-09595-4

The identifiability of gene regulatory networks: the role of observation data

Xiao-Na Huang 1,, Wen-Jia Shi 2, Zuo Zhou 1, Xue-Jun Zhang 1
PMCID: PMC8866611  PMID: 34988715

Abstract

Identifying gene regulatory networks (GRN) from observation data is significant to understand biological systems. Conventional studies focus on improving the performance of identification algorithms. However, besides algorithm performance, the GRN identification is strongly depended on the observation data. In this work, for three GRN S-system models, three observation data collection schemes are used to perform the identifiability test procedure. A modified genetic algorithm-particle swarm optimization algorithm is proposed to implement this task, including the multi-level mutation operation and velocity limitation strategy. The results show that, in scheme 1 (starting from a special initial condition), the GRN systems are of identifiability using the sufficient transient observation data. In scheme 2, the observation data are short of sufficient system dynamic. The GRN systems are not of identifiability even though the state trajectories can be reproduced. As a special case of scheme 2, i.e., the steady-state observation data, the equilibrium point analysis is given to explain why it is infeasible for GRN identification. In schemes 1 and 2, the observation data are obtained from zero-input GRN systems, which will evolve to the steady state at last. The sufficient transient observation data in scheme 1 can be obtained by changing the experimental conditions. Additionally, the valid observation data can be also obtained by means of adding impulse excitation signal into GRN systems (scheme 3). Consequently, the GRN systems are identifiable using scheme 3. Owing to its universality and simplicity, these results provide a guide for biologists to collect valid observation data for identifying GRNs and to further understand GRN dynamics.

Keywords: Identifiability, Observation data, Gene regulatory networks, GA-PSO algorithm

Introduction

Gene regulatory network (GRN) plays a key role to control most cellular processes. They are considered to be an abstract function of complicated biochemical networks [13]. With the increasing development of microarray technology, the cellular dynamics for thousands of genes can be obtained simultaneously. Despite these advances, it is still a challenging task to identify GRN parameters from observation data (time series) [4, 5]. One way to address this problem is mathematical modeling, which provides an effective way to understand and investigate complex GRNs [610]. The S-system model consists of a set of nonlinear and strongly coupled ordinary differential equations (ODEs), which is considered to be realistic for characterizing GRN dynamics [1114].

For inferring GRNs, a number of optimization methods are used to address this issue, such as genetic algorithm (GA) [15, 16], particle swarm optimization (PSO) [17, 18] and genetic algorithm-particle swarm optimization (GA-PSO) algorithm [19]. Conventional studies focus mainly on improving optimization algorithms performance to infer GRNs accurately. While applying these optimization methods, a strong underlying assumption is that the GRN parameters are thought to be inferred accurately, if the relative mean square error (RMSE) between the inferred and true GRN states is small enough. However, even though the RMSE is small enough, the GRN parameters cannot be inferred accurately owing to the observation data lacking sufficient transient process. Therefore, besides optimization methods, the observation data play a key role in inferring GRN parameters. Missing any of them, the GRN systems cannot be identified accurately.

In this work, three GRN S-system models are used in the identifiability test procedure. We focus on how the observation data influences the GRN identifiability, i.e., concerning the uniqueness of GRN parameters determined by input–output observation data. Additionally, the modified GA-PSO algorithm is used to illustrate that the GRN identifiability is also affected by the optimization method.

Three observation data collection schemes are compared to discuss this question. In schemes 1 and 2, the observation data are full and short of GRN transient process, respectively. Using scheme 1, the results show that three GRN models are of identifiability based on the modified GA-PSO algorithm, but incapable to do that based on the basic GA-PSO algorithm. The modified GA-PSO algorithm is of better performance. Therefore, in the schemes 2 and 3, we use the modified GA-PSO algorithm to perform the identifiability test procedure. In scheme 2, three GRN models are not of identifiability even the RMSE is small enough. In schemes 1 and 2, the observation data are obtained from zero-input GRN systems, which will evolve to the steady state at last. By means of changing the experimental conditions, these sufficient transient observation data in scheme 1 can be obtained. In addition, the valid observation data can be also obtained by means of adding excitation signal into GRN systems. In scheme 3, we give a workable observation data collecting method by means of adding the impulse excitation signals into the GRN systems. In this way, three GRN models are of identifiability. These results indicate that, besides optimization methods, the GRN identifiability is also highly dependent on the observation data. Therefore, though it is meaningful to improve the optimization algorithm performance, the validity of observation data must also be guaranteed for accurate identification. This paper is organized as follows: Section 2 gives a brief description of GRN identification, i.e., the GRN identification framework, the data collection schemes and the indices of GRN identifiability. Section 3 gives the modified GA-PSO algorithm for identifying GRN parameters. Section 4 gives the simulation results and some interesting findings. Section 5 gives the discussions. Section 6 gives the conclusion.

Problem description

Formulation of the identification problem

Generally speaking, gene regulation is a dynamical process. It describes the increasing or decreasing rate of one ingredient concentration, depending on the other ingredients concentrations. The S-system model is commonly used to describe GRN system [1114], which is given by

dXi(t)dt=αij=1NXjgij(t)-βij=1NXjhij(t),i=1,...,N 1

where t is the time, Xi is the concentration of gene i; N is the number of genes in the GRN; αi and βi are positive constants; the real numbers gij and hij are kinetic orders reflecting the interactive intensities from gene j to gene i. Equation (1) is an N-dimensional nonlinear dynamical system. There exist two terms in the right-hand side of Eq. (1). The first term and the second term describe the factor that makes the gene i increase and decrease, respectively.

Assuming that GRN has the model form given by Eq. (1), the states can be observed and recorded (as observation data), i.e., Xi(t), t=t1,t2,...,tL, L being the observation data length. GRN identification uses the observation data to identify the parameters, including αi, βi, gij and hij. One intuitive criterion of accurate identification is that the inferred GRN states should be the same as the actual ones. Practically, we observe and record the observation data (time series) from GRN system as given by

X=X1(t1),X1(t2),...,...,X1(tL)XN(t1),XN(t2),...,...,XN(tL) 2

where t1,t2,...,tL are the observation time instants. If the GRN has the form as that of Eq. (1), we infer (identify) the parameters as a^i, β^i, g^ij and h^ij; then the inferred GRN is given by

dX^i(t)dt=α^ij=1NX^jg^ij(t)-β^ij=1NX^jh^ij(t),i=1,...,N. 3

From a given initial condition, the Runge–Kutta method can be used to solve ordinary differential equations as in Eq. (3). The solution is recorded as a time series, which is given by

X^=X^1(t1),X^1(t2),...,...,X^1(tL)X^N(t1),X^N(t2),...,...,X^N(tL) 4

The relative mean-square error (RMSE) between the actual and inferred observation data is defined as

RMSE=i=1Nt=t1tLXi(t)-X^i(t)Xi(t)2, 5

where N is the number of genes, L is the observation data length, and Xi(t) and X^i(t) are the actual and inferred GRN concentration of gene i, respectively.

To show the GRN identification procedure, the identification framework is given in Fig. 1, where the GRN model and RMSE are defined in Eqs. (3), (4) and (5). Using an optimization method, the GRN identification is performed to infer the parameters in the parameter searching space, which requires the RMSE to be minimum. Intuitively, if the RMSE is zero, that is, the inferred observation data (GRN states) are the same as the actual ones, then the common sense is that the inferred and actual GRN parameters are equal, i.e., a^i=ai, β^i=βi, g^ij=gij and h^ij=hij. In this work, we show that this conclusion depends strongly on the observation data, which we refer to as observation data validity.

Fig. 1.

Fig. 1

GRN identification framework

Simplified GRN models

For the N-node S-system GRN model in Eq. (1), conventionally, there should be 2N(N+1) parameters needed to be inferred. To argue the major points of this work, three artificial GRNs are used in the identifiability test procedure. The GRN models 1 and 2 are both five-node systems, and the GRN model 3 is a four-node system. Their structures are assumed to be known. Correspondingly, there are remaining 23, 23 and 17 parameters in GRN models 1, 2 and 3, respectively [1820]. Their actual and inferred models are given in Eqs. (6) and (7) (GRN model 1), Eqs. (8) and (9) (GRN model 2) and Eqs. (10) and (11) (GRN model 3), respectively. In Eqs. (7), (9) and (11), the a^i, ..., β^i, etc., are the parameters that need to be inferred.

X˙1=15X31X5-0.1-10X12X˙2=10X12-10X22X˙3=10X2-0.1-10X2-0.1X32X˙4=8X12X5-0.1-10X42X˙5=10X42-10X52 6
X^˙1=α^1X^3g^13X5g^15-β^1X^1h^11X^˙2=α^2X^1g^21-β^2X^2h^22X^˙3=α^3X^2g^32-β^3X^2h^32X3h^33X^˙4=α^4X^1g^41X5g^45-β^4X^4h^44X^˙5=α^5X^4g^54-β^5X^5h^55 7
X˙1=5X31X5-1-10X12X˙2=10X12-10X22X˙3=10X2-1-10X2-1X32X˙4=8X32X5-1-10X42X˙5=10X42-10X52 8
X^˙1=α^1X^3g^13X5g^15-β^1X^1h^11X^˙2=α^2X^1g^21-β^2X^2h^22X^˙3=α^3X^2g^32-β^3X^2h^32X3h^33X^˙4=α^4X^3g^43X5g^45-β^4X^4h^44X^˙5=α^5X^4g^54-β^5X^5h^55 9
X˙1=12X3-0.8-10X10.5X˙2=8X10.5-3X20.75X˙3=3X20.75-5X30.5X40.2X˙4=2X10.5-6X40.8 10
X^˙1=α^1X^3g^13-β^1X^1h^11X^˙2=α^2X^1g^21-β^2X^2h^22X^˙3=α^3X^2g^32-β^3X^3h^33X4h^34X^˙4=α^4X^1g^41-β^4X^4h^44 11

Observation data collection schemes

In this work, three schemes are used to illustrate how the observation data effects the identifiability of GRN system. In scheme 1, for GRN models 1, 2 and 3, the special initial conditions in Eqs. (6), (8) and (10) are given as [0.04, 0.06, 0.03, 0.07, 0.05], [2.00, 2.10, 0.05, 2.50, 0.02] and [0.39, 0.85, 0.98, 1.90], respectively. It guarantees that the observation data contain sufficient transient process of GRN system, shown in Subsection 4.2 (Fig. 2 for GRN model 1).

Fig. 2.

Fig. 2

Based on the modified GA-PSO algorithm, using the observation data obtained by scheme 1 (GRN model 1), the actual and inferred states waveforms by one time running (with RMSE=1.410-2). A: The actual states waveforms. B: The inferred states waveforms

In scheme 2, for GRN models 1, 2 and 3, the initial conditions in Eqs. (6), (8) and (10) are given as [0.86, 0.63, 0.94, 0.65, 0.35], [0.45, 0.58, 0.83, 1.21, 0.65] and [0.41, 2.25, 2.19, 0.19], respectively. It makes the observation data be short of sufficient GRN transient process, shown in subsection 4.3 (Fig. 3 for GRN model 1). These two types of observation data (schemes 1 and 2) are both from zero-input response, and the GRN systems will evolve to a steady state at last.

Fig. 3.

Fig. 3

Based on the modified GA-PSO algorithm, using the observation data obtained by scheme 2 (GRN model 1), the actual and inferred states waveforms by one time running (with RMSE=6.310-4). A: The actual states waveforms. B: The inferred states waveforms

In scheme 3, the impulse signals are added into the GRN models 1, 2 and 3, as given in Eqs. (12)–(15), respectively.

X˙1=15X31X5-0.1-10X12+impulse1X˙2=10X12-10X22+impulse2X˙3=10X2-0.1-10X2-0.1X32+impulse3X˙4=8X12X5-0.1-10X42+impulse4X˙5=10X42-10X52+impulse5, 12
X˙1=5X31X5-1-10X12+impulse1X˙2=10X12-10X22+impulse2X˙3=10X2-1-10X2-1X32+impulse3X˙4=8X32X5-1-10X42+impulse4X˙5=10X42-10X52+impulse5, 13
X˙1=12X3-0.8-10X10.5+impulse1X˙2=8X10.5-3X20.75+impulse2X˙3=3X20.75-5X30.5X40.2+impulse3X˙4=2X10.5-6X40.8+impulse4 14

in which

impulsei(t)=0t<timλitimt<tim+tw0tim+twt 15

where i is the gene number, impulsei is the excitation signal added into the ith gene state equation, tim is the starting time to add the impulse excitation signal and the observation data are collected from time tim+tw, λi and tw are the intensity and time duration of impulse signal, respectively. The GRN system will go through a transient process; then, the steady-state is established.

Identifiability of GRN

In order to quantitatively analyze the accuracy of GRN identification, five indices are defined as follows:

  1. θ^n, the average value of the nth inferred parameter (30 independent runs), is defined as
    θ^n=m=130θ^nm30, 16
    where n is the index of GRN parameters (for GRN models 1 and 2, = 1, 2,..., 23; for GRN model 3, = 1, 2,..., 17); m is the simulation runs. 
  2. ξn, the relative identification error of the nth parameter is defined as
    ξn=θ^n-θnθn100%, 17
    where θn is the actual value of the nth parameter. If the ξn is less than 5% (ξn < 5%), the nth parameter is thought to be inferred accurately.
  3. ξ¯, the average relative identification error of all parameters, is defined as
    ξ¯=n=1NumξnNum, 18
    where Num is the number of parameters in GRN model. There are Num1 = 23, Num2 = 23 and Num3 = 17 parameters in GRN models 1, 2 and 3, respectively.
  4. RMSE¯, the average of RMSE (30 independent runs) is defined as
    RMSE¯=m=130RMSEm30 19
    where RMSEm is the relative mean squared error for the mth simulation.
  5. P, the identification accuracy of GRN system, is defined as
    P=QNum100%, 20
    where Q is the number of parameters that can be inferred accurately.

In this work, the identifiability of GRN system is defined as follows:

  1. more than 90% of the parameters are inferred accurately, i.e., P> 90%. If ξn < 5%, the nth parameter is considered to be inferred accurately.

  2. the average relative error of all parameters is less than 5%, i.e., ξ¯<5%.

  3. the RMSE¯ (30 independent runs) is less than (210-2)2NL, where N is the number of genes and = 50 is the observation data length. That is, for GRN models 1 and 2, the RMSE¯<(210-2)2550=1.010-1; for GRN model 3, the RMSE¯<(210-2)2450=8.010-2.

The condition (1) is defined to guarantee that most parameters (more than 90%) can be inferred accurately. The condition (2) is defined to guarantee that even though some parameters have an estimation error, this error is not too large. The condition (3) is defined to guarantee the fitting degree of the data, which means that the average relative error between the inferred and actual GRN states is less than 210-2=2% for each gene. In other words, if the above three conditions are satisfied, the GRN system is considered to be of identifiability

Methods

In this work, a modified GA-PSO algorithm is used as the optimization method in our identification framework. It employs a multi-level mutation operation to promote the diversity of population [21]. At the same time, the velocity limitation strategy is used to guarantee the global exploration ability [22].

The individual representation and fitness function

In the optimization algorithm procedure, how to encode an individual and choose the fitness function are important issues. In this work, an individual is encoded by real number. Taking GRN model 1 as an example, each individual x is a 23-dimensional real-value vector, representing a parameter set with 23 parameters. An individual x in GRN model 1 is given as:

x=[x1,x2,x3,,x22,x23]=[a^1,g^13,g^15,,β^5,h^55] 21

In the proposed GA-PSO algorithm, the fitness function is defined as:

fitness=1RMSE+η 22

where RMSE is defined in Eq. (5); η is a very small positive number to avoid the fitness being infinite (if RMSE = 0), η=10-10 in this paper.

Multi-level mutation operation

After selection and crossover operations in GA-PSO algorithm, individual x is selected for the mutation operation with mutation probability pm to get x. We proposed the multi-level mutation strategy to perform mutation operation [21], given as:

x=x-0.1(Δ)σifrandom(0,1)=0x+0.1(Δ)σifrandom(0,1)=1Δ=θup-θlowσ=w=0δaw2-w 23

where x is the new individual created by mutation operation; θlow(θup) is the lower (upper) bound for the parameter searching range; initially aw = 0, and = 0, 1,..., δ, then each aw is mutated to 1 with probability pδ=1/δ+1; so that there is one and only one w such that aw = 1, and the rest aw = 0, δ decides the mutation precision.

Velocity limitation strategy

In the part of PSO operations, the maximum velocity Vmax determines the searching resolution (the velocity step) and acts as a constraint to control the global exploration ability of the population. Too large or too small Vmax makes it more likely to miss good solutions or be trapped at local optima for individuals [22]. In this work, the maximum searching velocity Vmax is set as 5%(θup-θlow), where the coefficient 5% is decided by a trial and error procedure, given by Eq. (24).

v=-Vmaxifv<-VmaxVmaxifv>VmaxVmax=5%(θup-θlow) 24

The above-mentioned two strategies are important points different from the basic GA-PSO algorithm [19]. We show the effect of this modification in the subsection 4.2.

Results

In this paper, we analyzed the GRN identifiability using different observation data (schemes 1, 2 and 3). To explore the generality of our work, three S-system GRN models are used in this paper. Based on the Runge–Kutta method, the numerically solved time series in Fig. 1 is obtained by solving Eqs. (7), (9) and (11), respectively. All results reported in this section are obtained based on 30 independent runs to avoid issues associated with randomness and to evaluate the algorithms statistically [23].

Simulation parameters

In this work, the population size is Pop = 500, the largest iteration is iter = 500; for PSO operation, the learning factors are c1 = c2 = 2.05; for GA operation, the crossover probability is pc = 0.85 and the mutation probability is pm = 0.1; the elite probability is pelite = 0.7; the probability q is linearly increasing from 0.1 to 0.5 with the increase of iteration, the observation data length is = 50. We use the same parameter searching ranges as that in [19]. The searching ranges for a^i(β^i) are [0,2θn]; the searching ranges for g^ij(h^ij) are [θn-1,θn+1]; θn is the actual value of the nth parameter, as given in Eqs. (6), (8) and (10), respectively.

Identification results using the observation data of scheme 1

Identification results of GRN model 1 using scheme 1

In scheme 1, a special initial condition in Eq. (6) is given as [0.04, 0.06, 0.03, 0.07, 0.05] for GRN model 1. We use the modified GA-PSO algorithm to perform identifiability test procedure, including the multi-level mutation operation and velocity limitation strategy. The identification results are shown in Table 1 (30 independent runs). The actual and inferred states of one time running are shown in Fig. 2; subplots (A) and (B) are the actual and inferred states, respectively. From Fig. 2, we learn that the inferred GRN states are close to the actual GRN states, RMSE=1.410-2 being small.

Table 1.

The identification results of scheme 1 based on the modified GA-PSO algorithm (GRN model 1)

n parameter θn θ^n ξn
1 a^1  15 14.997 0.02%
2 g^13 1 1.007 0.73%
3 g^15 −0.1 −0.104 4.12%
4 β^1 10 10.010 0.09%
5 h^11 2 2.006 0.27%
6 a^2 10 10.011 0.11%
7 g^21 2 1.986 0.72%
8 β^2 10 9.979 0.21%
9 h^22 2 2.006 0.30%
10 a^3 10 10.234 2.34%
11 g^32 −0.1 −0.088 12.22%
12 β^3 10 10.223 2.23%
13 h^32 −0.1 −0.098 2.41%
14 h^33 2 2.069 3.44%
15 a^4 8 7.800 2.54%
16 g^41 2 2.000 0.02%
17 g^45 −0.1 −0.112 11.89%
18 β^4 10 9.758 2.42%
19 h^44 2 2.002 0.07%
20 a^5 10 9.853 1.47%
21 g^54 2 1.990 0.51%
22 β^5 10 9.801 1.99%
23 h^55 2 2.032 1.59%
ξ¯=2.25%RMSE¯=1.2510-2P=21/23=91.30%

As shown in Table 1 (GRN model 1), 21 out of 23 (21/23=91.30%) parameters have the relative error ξ being less than 5%, which are considered to be inferred accurately. Only ξ11 and ξ17 are larger than 5%, corresponding to parameters g32 and g45. The largest relative error is ξ11 = 12.22%, the average relative error is ξ¯ = 2.25%. In addition, the average of RMSE (30 independent runs) satisfies RMSE¯=1.2510-2<(210-2)2NL=1.010-1. Using the observation data of scheme 1, the GRN model 1 is of identifiability based on the modified GA-PSO algorithm.

Identification results of GRN models 2 and 3 using scheme 1

In scheme 1, for GRN models 2 and 3, a special initial condition is given as [2.00, 2.10, 0.05, 2.50, 0.02] and [0.39, 0.85, 0.98, 1.90], respectively. Based on the modified GA-PSO algorithm, for GRN models 2 and 3, there are 21 (= 21/23 = 91.30%) and 16 (= 16/17 = 94.12%) parameters can be inferred accurately, respectively. For GRN model 2, Only ξ12 = 6.22% and ξ13 = 7.06% are larger than 5%, corresponding to parameters β3 and h32. For GRN model 3, Only ξ12 = 17.82% is larger than 5%, corresponding to parameter h33. The average relative error is ξ¯ = 2.38% and ξ¯ = 2.60%, respectively. In addition, the average of RMSE is RMSE¯=1.510-3 (less than 1.010-1), and RMSE¯=2.210-3 (less than 8.010-2), respectively. Therefore, using the observation data of scheme 1, the GRN models 2 and 3 are of identifiability based on the modified GA-PSO algorithm.

Identification results based on the basic GA-PSO algorithm using scheme 1

Additionally, to show the influence of the multi-level mutation operation and velocity limitation strategy in the proposed GA-PSO algorithm, we use scheme 1 to identify three GRN models based on the basic GA-PSO algorithm. For GRN models 1, 2 and 3, 17 (= 17/23 = 73.91%), 16 (= 16/23 = 69.57%) and 10 (= 10/17 = 58.82%) parameters can be inferred accurately, respectively. The average relative error is ξ¯ = 4.57%, ξ¯ = 4.13% and ξ¯=7.25%, respectively. The average of RMSE is RMSE¯=7.5210-2(less than 1.010-1), RMSE¯=1.3910-2 (less than 1.010-1) and RMSE¯=1.6610-2 (less than 8.010-2), respectively. In this condition, the GRN models 1, 2 and 3 are all not of identifiability.

Our results indicate that the multi-level mutation operation and velocity limitation strategy in the proposed GA-PSO algorithm are important to perform accurate identification. The performance of the optimization algorithm is important for GRN identification. Therefore, in the following scheme 2 (Sects. 4.3) and scheme 3 (Sects. 4.4), we use the modified GA-PSO algorithm to perform identifiability test procedure.

Identification results using the observation data of scheme 2

Identification results of scheme 2

In scheme 2, the initial condition in Eq. (6) is given as [0.86, 0.63, 0.94, 0.65, 0.35] for GRN model 1. Based on the modified GA-PSO algorithm, the identification results are shown in Table 2 (30 independent runs). The actual and inferred states of one time running are shown in Fig. 3; subplots (A) and (B) are the actual and inferred states, respectively. From Fig. 3, we learn that these observation data (50 data points) is short of sufficient GRN transient process. The inferred GRN states are very close to the actual GRN states, RMSE=6.310-4 being very small.

Table 2.

The identification results of scheme 2 based on the modified GA-PSO algorithm (GRN model 1)

n parameter θn θ^n ξn
1 a^1 15 16.086 7.24%
2 g^13 1 1.072 7.20%
3 g^15 −0.1 −0.071 29.52%
4 β^1 10 10.612 6.12%
5 h^11 2 2.052 2.58%
6 a^2 10 10.353 3.53%
7 g^21 2 1.971 1.46%
8 β^2 10 10.389 3.89%
9 h^22 2 1.961 1.95%
10 a^3 10 10.705 7.05%
11 g^32 −0.1 −0.109 8.52%
12 β^3 10 10.733 7.33%
13 h^32 −0.1 −0.115 15.29%
14 h^33 2 2.076 3.82%
15 a^4 8 8.248 3.10%
16 g^41 2 2.013 0.62%
17 g^45 −0.1 −0.088 11.75%
18 β^4 10 10.335 3.35%
19 h^44 2 2.017 0.87%
20 a^5 10 10.092 0.92%
21 g^54 2 2.005 0.24%
22 β^5 10 10.114 1.14%
23 h^55 2 1.989 0.53%
ξ¯=5.57%RMSE¯=6.810-4P=14/23=60.87%

As shown in Table 2 (GRN model 1), based on the modified GA-PSO algorithm, 14 out of 23 (= 14/23 = 60.87%) parameters can be inferred accurately, whose parameter indices are = 59, 1416, 1823. The largest relative error is ξ3 = 29.52% (corresponding to parameter g15), the average relative error is ξ¯ = 5.57%, and the average of RMSE is RMSE¯= 6.810-4. Although the RMSE¯ is small enough, about 40% parameters cannot be inferred accurately. Specially, when the system is in the steady state (GRN model 1), the observation data does not contain transient process, the identification results are less than satisfactory. Based on the modified GA-PSO algorithm, 12 out of 23 (= 12/23 = 52.17%) parameters can be inferred accurately, the largest relative error is ξ17 = 97.28% (corresponding to parameter g45), the average relative error is ξ¯ = 13.30%, and the average of RMSE is RMSE¯ = 3.210-7.

Using scheme 2, the identifiability test procedure is performed based on the modified GA-PSO algorithm for GRN models 2 and 3. For GRN model 2, the initial condition in Eq. (8) is given as [0.45, 0.58, 0.83, 1.21, 0.65]. The identification results show that 15 out of 23 (15/23=65.22%) parameters have the relative error ξ being less than 5%, which are considered to be inferred accurately. The rest eight parameters cannot be inferred accurately, corresponding to parameters g13, α3, β3, h33, g43, α5, g54 and β5. The ξ2 = 24.58%, ξ10 = 5.25%, ξ12 = 5.87%, ξ14 = 6.73%, ξ16 = 10.58%, ξ20 = 5.16%, ξ21 = 5.56% and ξ22 = 5.89%, are larger than 5%. The average relative error is ξ¯ = 4.46%. The average of RMSE (30 independent runs) is RMSE¯=1.010-3 (less than 1.010-1).

For GRN model 3, the initial condition in Eq. (10) is given as [0.41, 2.25, 2.19, 0.19]. The identification results show that 6 out of 17 (P=35.29%) parameters can be inferred accurately, corresponding to parameters α2, g21, β2, h22, g32 and β3, whose relative identification error are ξ5 = 0.32%, ξ6 = 2.92%, ξ7 = 2.19%, ξ8 = 1.25%, ξ10 = 4.38% and ξ11 = 2.70%. The rest 11 parameters cannot be inferred accurately, whose relative identification error are larger than 5%. The average relative error is ξ¯ = 9.70%. The average of RMSE (30 independent runs) is RMSE¯=7.8310-4 (less than 8.010-2).

These results show that the GRN models 1, 2 and 3 are all not of identifiability using scheme 2. The reason is that these observation data (50 data points) is short of sufficient GRN transient process. It is not easy to enhance the accuracy of GRN identification only by means of improving algorithm performance (reducing relative mean-square error). Even though the inferred GRN can reproduce all the actual state trajectories (the optimization algorithm has good performance, RMS E is small enough), the GRN system is not identifiable using the observation data short of sufficient transient process.

Why steady-state data are invalid for identification

Using the observation data of scheme 2, it can be seen that three GRN systems are not of identifiability. To elaborate on the reasons, we use the GRN model 1 to give explanations from the view of equilibrium points analysis. To simplify the description, in GRN model 1, only 8 parameters are considered to be independently unknown variables and the remaining 15 parameters are set as constants, as given in Eq. (25). Let X˙1=X˙2=X˙3=X˙4=X˙5=0, we derive the equilibrium points corresponding to steady-state, as given in Eq. (26), the analytical solutions of equilibrium with 8 unknown variables are given by Eq. (27).

X˙1=α1X3X5-0.1-β1X12.0X˙2=α2X12.0-β2X22.0X˙3=10X2-0.1-10X2-0.1X32.0X˙4=α4X12.0X5-0.1-β4X42.0X˙5=α5X42.0-β5X52.0 25
α1X3X5-0.1-β1X12.0=0α2X12.0-β2X22.0=010X2-0.1-10X2-0.1X32.0=0α4X12.0X5-0.1-β4X42.0=0α5X42.0-β5X52.0=0 26
X1=((β5β4((α1α5α4)/(β1β5β4))2122)/(α5α4))12X2=((α2β5β4((α1α5α4)/(β1β5β4))2122)/(β2α5α4))12X3=1X4=(β5/α5)12((α1α5α4)/(β1β5β4))511X5=((α1α5α4)/(β1β5β4))511 27

As shown in Eq. (27), for the analytical solutions of equilibrium point, there are 4 equations to determine 8 independent variables, including α1, α2, α4, α5, β1, β2, β4 and β5. The steady-state observation corresponds to X1=1.22, X2=1.22, X3=1.00, X4=1.086 and X5=1.086, as given in Figs. 2 and 3. In other words, there are uncountable number of solutions (α1, α2, α4, α5, β1, β2, β4 and β5), which can yield the same steady-state observation data. Using only 4 equations to determine 8 parameters is an indetermined problem. If the unknown variable (parameter) number is 23, it gives more freedom to choose parameters to be the same steady-states but different parameter values. The conclusion is that we fail to infer GRN accurately when using the observation data short of transient process. That is why these observation data of scheme 2 cannot be used for GRN identification.

Identification results using valid observation data of scheme 3

The scheme 1 is a feasible way to obtain the valid observation data, i.e., the observation data with sufficient transient process. This asks for the zero-input GRN systems starting from a special initial condition, which can be achieved by means of changing the experimental conditions. In addition, adding excitation signal into GRN systems is another effective way. In scheme 3, the impulse excitation signals are designed and added into the GRN systems for obtaining the valid observation data.

In GRN model 1, as shown in Figs. 2 and 3, the GRN system will evolve to the steady-state at last. Using scheme 3, the impulsive excitation signals are added into the GRN system after the time t>1.5s. The intensity of impulse signal are λ1 = −122.0, λ3 = −100.0, λ2=λ4=λ5=0, tw=0.01, as given in Eqs. (12) and (15). Based on the modified GA-PSO algorithm, the inferred results of scheme 3 are shown in Table 3. The actual and inferred states of one time running (with RMSE=1.6610-2) are shown in Fig. 4; subplots (A) and (B) are the actual and inferred states, respectively.

Table 3.

The identification results of scheme 3 based on the modified GA-PSO algorithm (GRN model 1)

n parameter θn θ^n ξn
1 a^1 15 15.561 3.74%
2 g^13 1 1.036 3.64%
3 g^15 −0.1 −0.102 1.97%
4 β^1 10 10.349 3.49%
5 h^11 2 2.008 0.40%
6 a^2 10 9.932 0.68%
7 g^21 2 2.004 0.19%
8 β^2 10 9.978 0.22%
9 h^22 2 1.986 0.72%
10 a^3 10 10.169 1.69%
11 g^32 −0.1 −0.096 3.78%
12 β^3 10 10.180 1.80%
13 h^32 −0.1 −0.095 4.60%
14 h^33 2 1.922 3.89%
15 a^4 8 7.884 1.45%
16 g^41 2 2.008 0.42%
17 g^45 −0.1 −0.128 27.86%
18 β^4 10 9.911 0.89%
19 h^44 2 1.973 1.34%
20 a^5 10 9.868 1.32%
21 g^54 2 2.031 1.57%
22 β^5 10 9.848 1.52%
23 h^55 2 2.012 0.58%
ξ¯=2.95%RMSE¯=1.7710-2P=22/23=95.65%

Fig. 4.

Fig. 4

Based on the modified GA-PSO algorithm, using the observation data obtained by scheme 3 (GRN model 1), the actual and inferred states waveforms by one time running (with RMSE=1.6610-2). A: The actual states waveforms. B: The inferred states waveforms

As shown in Table 3 (GRN model 1), 22 out of 23 (= 22/23 = 95.65%) GRN parameters are with relative error ξ<5%, which are considered to be inferred accurately. Only ξ17 (corresponding to parameter g45) is larger than 5%. The average relative error is ξ¯=2.95%. The average of RMSE (30 independent runs) is RMSE¯ = 1.7710-2< 210-22NL = 1.010-1.

In GRN model 2, the intensity of impulse signal are λ1 = −58.5, λ2 = −61.5, λ3 = −78.4, λ4 = −53.6, λ5 = −60.8, tw = 0.01, as given in Eqs. (13) and (15). Based on the modified GA-PSO algorithm, using scheme 3, 22 out of 23 (= 95.65%) GRN parameters are with the relative error ξ<5%, which are considered to be inferred accurately. Only ξ14=9.84% (corresponding to parameter h33) is larger than 5%. The average relative error is ξ¯=2.34%. The average of RMSE (30 independent runs) satisfies RMSE¯ = 5.810-3< 1.010-1.

In GRN model 3, the intensity of impulse signal are λ1 = −23.40, λ2 = −108.00, λ3 = –128.76, λ4 = −7.28, tw = 0.01, as given in Eqs. (14)–(15). Based on the modified GA-PSO algorithm, using scheme 3, 16 out of 17 (= 94.12%) GRN parameters can be inferred accurately. Only ξ15=6.10% (corresponding to parameter g41) is larger than 5%. The average relative error is ξ¯=2.93%. The average of RMSE (30 independent runs) satisfies RMSE¯ = 7.7910-2< 8.010-2.

For GRN models 1, 2 and 3, it can be seen that three GRN systems are of identifiability using the observation data of scheme 3. This strategy is helpful to obtain the valid observation data; then, address the problem associated with scheme 2.

Discussion

Discussion 1:

While comparing schemes 1, 2 and 3, three GRN models are of identifiability when using schemes 1 or 3, but not of identifiability when using scheme 2. The schemes 1 and 3 are feasible ways to obtain the valid observation data, which is helpful for accurate GRN identification. In scheme 1, the zero-input GRN systems start from a special initial condition, which can be achieved by means of changing the experimental conditions. In scheme 3, the impulsive excitation signals can be designed and added into the GRN systems.

Discussion 2:

In scheme 3, how to choose the parameters of impulse excitation signals? It is important for GRN identification. The impulse excitation signal adding into the gene state equation can be different, as given in Eqs. (12)–(15). The impulsei larger or less than zero means that the positive or negative excitation is added into the ith gene state equation, and it equal to zero means that it is absent. The principle of choosing impulse excitation parameters is that the system can be sufficiently excited; then, the valid observation data can be obtained.

Discussion 3:

In the condition of reasonable parameter setting, other types of excitation signals are also possible to excite the GRN system sufficiently and then obtain the valid observation data. The step excitation is an alternative option to achieve the same objective. For the length of the paper, it is not presented here.

Discussion 4:

In this work, three GRN models used to perform identifiability test procedure are monostable systems. Our conclusions are valid for these three GRN models. For bistable, multistable, excitable and oscillatory networks, the relationship between GRN observation data and the identification accuracy is needed to be further studied and systematically investigated.

Conclusion

For identifying GRNs accurately, it is indeed important to enhance the performance of optimization algorithm, where the modified and basic GA-PSO algorithm are used to illustrate the influence. However, besides optimization algorithm performance, the observation data also play a key role in GRN identification. This point is often overlooked, but is very important in practice. In this work, three data collection schemes are used to discuss the identifiability of GRN system. In scheme 1, using the transient observation data, three GRN systems are of identifiability. In scheme 2, using the observation data short of sufficient dynamic process, three GRN systems are not of identifiability even though the inferred GRN can reproduce the actual state trajectories (RMSE¯ is small enough), the reason for which is given by mean of equilibrium point analysis. Additionally, in scheme 3, we propose to add a special designed impulse excitation signal into GRN systems. The observation data with sufficient dynamic can be collected. Consequently, three GRN systems are of identifiability using scheme 3. Owing to its universality and simplicity, the proposed methodology can provide a guide to collect valid observation data, which is help to identify GRN accurately and to further understand GRN system.

Funding

Funding This study was funded by the Natural Science Foundation of Gansu Province (grant number 21JR1RG309), the Higher Education Innovation Foundation of Gansu Province (grant number 2021B-236), the Scientific Research Program Funded by Shaanxi Provincial Education Department (grant number 19JK0574), Natural Science Basic Research Plan in Shaanxi Province of China (grant number 2019JQ-317) and the Scientific Research Foundation of Hexi University.

Declarations

Conflicts of interest

The authors declare that they have no conflict of interest.

Footnotes

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Taylor-Teeples, M., Lin, L., De Lucas, M.: An arabidopsis gene regulatory network for secondary cell wall synthesis. Nature 517, 571–575 (2015) [DOI] [PMC free article] [PubMed]
  • 2.Zanudo, J.G.T., Guinn, M.T., Farquhar, K.: Towards control of cellular decision-making networks in the epithelial-to-mesenchymal transition. Phys. Biol. 16, 031002 (2019) [DOI] [PMC free article] [PubMed]
  • 3.Gardner, T.S., Di Bernardo, D., Lorenz, D., Collins, J.J.: Inferring genetic networks and identifying compound mode of action via expression profiling. Science 301, 102–105 (2003) [DOI] [PubMed]
  • 4.Chang, Y.H., Gray, J.W., Tomlin, C.J.: Exact reconstruction of gene regulatory networks using compressive sensing. BMC Bioinf. 15, 1–22 (2014) [DOI] [PMC free article] [PubMed]
  • 5.Stefan, D., Pinel, C., Pinhal, S.: Inference of quantitative models of bacterial promoters from time-series reporter gene data. PLoS Comput. Biol. 11, e1004028 (2015) [DOI] [PMC free article] [PubMed]
  • 6.Deng, Z., Tian, T.: A continuous optimization approach for inferring parameters in mathematical models of regulatory networks. BMC Bioinf. 15, 1–12 (2014) [DOI] [PMC free article] [PubMed]
  • 7.Uzkudun, M., Marcon, L., Sharpe, J.: Data-driven modelling of a gene regulatory network for cell fate decisions in the growing limb bud. Mol. Syst. Biol. 11, 815 (2015) [DOI] [PMC free article] [PubMed]
  • 8.Wang, W.X., Lai, Y.C., Grebogi, C.: Data based identification and prediction of nonlinear and complex dynamical systems. Phys. Rep. 644, 1–76 (2016)
  • 9.Dnyane, P.A., Puntambekar, S.S., Gadgil, C.J.: Method for identification of sensitive nodes in Boolean models of biological networks. IET Syst. Biol. 12, 1–6 (2018) [DOI] [PMC free article] [PubMed]
  • 10.Dondelinger, F., Lebre, S., Husmeier, D.: Non-homogeneous dynamic Bayesian networks with Bayesian regularization for inferring gene regulatory networks with gradually time-varying structure. Mach. Learn. 90, 191–230 (2013)
  • 11.Kimura, S., Nakayama, S., Hatakeyama, M.: Genetic network inference as a series of discrimination tasks. Bioinformatics 25, 918–925 (2009) [DOI] [PubMed]
  • 12.Wu, S.J., Wu, C.T., Chang, J.Y.: Fuzzy-based self-interactive multi-objective evolution optimization for reverse engineering of biological networks. IEEE Trans. Fuzzy Syst. 20, 865–882 (2012)
  • 13.Liu, L.Z., Wu, F.X., Zhang, W.J.: Reverse engineering of gene regulatory networks from biological data. Data Min. Knowl. Disc. 2, 365–385 (2012)
  • 14.Foo, M., Kim, J., Bates, D. G.: Modelling and control of gene regulatory networks for perturbation mitigation. IEEE/ACM Trans. Comput. Biol. Bioinformat. 16, 583–595 (2018) [DOI] [PubMed]
  • 15.Sarode, K.D., Kumar, V.R., Kulkarni, B.D.: Inverse problem studies of biochemical systems with structure identification of S-systems by embedding training functions in a genetic algorithm. Math. Biosci. 275, 93–106 (2016) [DOI] [PubMed]
  • 16.Liu, L.Z., Wu, F.X., Zhang, W.J.: Inference of biological S-system using the separable estimation method and the genetic algorithm. IEEE/ACM Trans. Comput. Biol. Bioinformat. 9, 955–965 (2012) [DOI] [PubMed]
  • 17.Kentzoglanakis, K., Poole, M.: A swarm intelligence framework for reconstructing gene networks: searching for biologically plausible architectures. IEEE/ACM Trans. Comput. Biol. Bioinformat. 9, 358–371 (2012) [DOI] [PubMed]
  • 18.Palafox, L., Noman, N., Iba, H.: Reverse engineering of gene regulatory networks using dissipative particle swarm optimization. IEEE Trans. Evolut. Comput. 17, 577–587 (2013)
  • 19.Lee, W.P., Hsiao, Y.T.: Inferring gene regulatory networks using a hybrid GA-PSO approach with numerical constraints and network decomposition. Inform. Sciences. 188, 80–99 (2012)
  • 20.Yang, B., Zhang, W., Wang, H., Song, C., Chen, Y.: TDSDMI: Inference of time-delayed gene regulatory network using S-system model with delayed mutual information. Comput Biol Med. 72, 218–225 (2016) [DOI] [PubMed]
  • 21.Lim, S.M., Sultan, A.B.M., Sulaiman, M.N.: Crossover and mutation operators of genetic algorithms. International journal of Machine Learning and Computing 7, 9–12 (2017)
  • 22.Wang, D., Tan, D., Liu, L.: Particle swarm optimization algorithm: an overview. Soft Comput. 22, 387–408 (2018)
  • 23.Gyori, B.M., Paulin, D.: Hypothesis testing for Markov chain Monte Carlo. Stat. Comput. 26, 1281–1292 (2016)

Articles from Journal of Biological Physics are provided here courtesy of Springer Science+Business Media B.V.

RESOURCES