Research Article | Open Access
Yu Chen, Dong Chen, Xiufen Zou, "Inference of Biochemical S-Systems via Mixed-Variable Multiobjective Evolutionary Optimization", Computational and Mathematical Methods in Medicine, vol. 2017, Article ID 3020326, 9 pages, 2017. https://doi.org/10.1155/2017/3020326
Inference of Biochemical S-Systems via Mixed-Variable Multiobjective Evolutionary Optimization
Inference of the biochemical systems (BSs) via experimental data is important for understanding how biochemical components in vivo interact with each other. However, it is not a trivial task because BSs usually function with complex and nonlinear dynamics. As a popular ordinary equation (ODE) model, the S-System describes the dynamical properties of BSs by incorporating the power rule of biochemical reactions but behaves as a challenge because it has a lot of parameters to be confirmed. This work is dedicated to proposing a general method for inference of S-Systems by experimental data, using a biobjective optimization (BOO) model and a specially mixed-variable multiobjective evolutionary algorithm (mv-MOEA). Regarding that BSs are sparse in common sense, we introduce binary variables indicating network connections to eliminate the difficulty of threshold presetting and take data fitting error and the -norm as two objectives to be minimized in the BOO model. Then, a selection procedure that automatically runs tradeoff between two objectives is employed to choose final inference results from the obtained nondominated solutions of the mv-MOEA. Inference results of the investigated networks demonstrate that our method can identify their dynamical properties well, although the automatic selection procedure sometimes ignores some weak connections in BSs.
Biochemical systems (BSs) consist of many components, which interact with each other in a complex way to act as integrated dynamic systems. Inference of biochemical systems is dedicated to identify how these components interact with each other and helpful to investigate the dynamical properties of these complex systems. In the past decades, the (probabilistic) Boolean networks [1, 2], the (dynamic) Bayesian networks [3, 4], and some other probabilistic or statistical methods [5, 6] have been proposed to confirm connections between components in BSs. Although the probability- or statistics-based models can properly address the negative effects of data noise, they cannot precisely incorporate the dynamical properties of BSs. Because ordinary differential equation (ODE) models that produce directed signed graphs are not only suited for steady-state and time-series profiles but also able to work entirely in classical category , they are widely utilized to model various kinds of BSs [8, 9].
In biochemical system theory (BST), the S-System model incorporating the pow-law formalism is considered as an effective and consistent mathematical model to represent and analyze the biological systems . Its mathematical formalism is a nonlinear ODE system:where represents the concentration of reaction component and is the total number of components in the investigated network. In the S-System, there are totally parameters, including the positive rate constants and the kinetic constants . Although the number of parameters to be determined is relatively large for inference of S-System, it is also employed to reconstruct large-scale GRNs [11–13], attributed to its powerful approximation of dynamics of biochemical reactions.
Inference of S-Systems is available when there is a time-course experimental data set of all components, implemented by minimizing the differences between experimental data and numerical results. To address the ill-posedness of this reverse problem, minimization of the differences is usually normalized and penalized as [14, 15]where is the numerical results of at time and is the penalization parameter that is problem-dependent. To make the objective function continuous, is commonly taken as
Nonlinear model (2) of S-Systems has a complicated landscape, which results in the preference to solve it by evolutionary algorithms (EAs) [16, 17]. When evaluating the candidate network parameters in the population of EAs, the ODE system should be solved via some numerical method such as the Runge-Kutta method, which could lead to a computationally-heavy evaluation process. Thus, Tsai and Wang  used an allocation method to decouple the ODE system. However, this method introduces an allocation parameter for evaluation of candidate solutions, which is hard to debug for its dependence on the investigated problems and available data sets. Liu et al.  developed a separable parameter estimation method (SPEM) to decouple the S-System. But, in their method, the rate constants are numerically determined by the least square method, which could be computationally difficult because it has to compute inverse of a matrix that is the product of a matrix and its transpose (the computational difficulty concerns not only the time complexity but also the stability of algorithm for computation of inverse matrices).
Since inference of BSs simultaneously addresses several issues, multiobjective optimization models could be an available alternative for this problem. Liu and Wang  proposed a three-objective optimization model simultaneously minimizing the concentration error, slope error, and interaction error and then transformed it to a single-objective optimization problem by converting two objectives into constraints. However, transformation of the multiobjective model to the single-objective model greatly depends on a prior information on network connections of the investigated network. Koduru et al.  and Cai et al.  simultaneously minimized data error for several different data sets, but they did not try to minimize the network connections/parameter norms to get sparse networks, which makes it more difficult to set a threshold for pruning net connections. To address the defect of model (2) that has to be regulated to ensure that its global optimal solutions do lie around the true network parameters, Spieth et al.  took the data error and connection number as two minimization objectives and solve it using a multiobjective evolutionary algorithm. However, they did not work on how to choose an appropriate Pareto solution as the final inference result.
This work is dedicated to address the aforementioned shortcomings in existing works. To eliminate the difficulties of debugging regularization parameters in regularized methods, we construct a biobjective optimization (BOO) model that tries to simulate the dynamical properties of S-Systems by minimizing the error between computed derivatives and estimated slopes, simultaneously driving the network topology as sparse as possible. Meanwhile, fitting of derivatives also makes it possible for decoupling S-Systems without incorporation of extra parameters. For solution of the proposed BOO model, we propose a mix-variable multiobjective evolutionary algorithm (mv-MOEA) in which a candidate network configuration is represented with combination of binary variables indicating network connections and real variables of parameter values. Then, an automatic selection procedure (ASP) is employed to take the final inference results as one from the obtained nondominated solutions of BOO. Because the ASP runs tradeoff between fitting errors and network connections by locating the knee regions on the curves of normalized objective values, it can obtain a preferred sparse network configuration with the absence of a prior information on network connections.
The rest of this paper is organized as follows. Section 2 introduces the inference method proposed in this work. Then, effectiveness of our method is validated by benchmark S-Systems in Section 3. Finally, Section 4 draws the conclusions and presents the future work.
The inference method based on multiobjective evolutionary optimization (IM-MOEO) consists of three parts: the biobjective optimization (BOO) model, the mixed-variable multiobjective evolutionary algorithm (mv-MOEA), and the automatic selection procedure (ASP), which are, respectively, presented in the following.
2.1. The Biobjective Optimization Model
2.1.1. Decoupling the S-System
To decrease number of parameters to be confirmed, the S-System is firstly decoupled before we try to infer it by experimental data. At the same time, decoupling the S-System also reduces the time complexity of evaluation process. Dynamical properties of the autonomous S-System can be fitted by approximating the derivative values of component concentration at each time point: for the th equation in (1) we try to minimize the difference between two sides of each equation aswhere represents the vector of at all time points, approximated by the five-point numerical formula. , the slope vector corresponding to parameter vector , is computed via the right part of the th equation for all time points .
2.1.2. Representation of an S-System
By decoupling the S-System (1), we can infer equations one by one. The th equation is characterized as network connections and parameter values and represented by , where and are binary and real vectors, respectively. Then, the kinetic constants can be confirmed by . Moreover, we can also get values of rate constants by and .
2.1.3. The Biobjective Optimization Model
Once the S-System is decoupled, we can infer ODEs one by one. The biobjective optimization model for inference of the th ODE iswhere is the parameters to be confirmed, is the norm of . Minimization of is dedicated to obtain a sparse network topology. Thanks to introduction of binary variables, the -norm can be computed as So, no threshold is needed to prune the network connections.
2.2. The Mixed-Variable Multiobjective Evolutionary Algorithm
Because there are at most connections for each component in (1), the BOO model (6) has at most Pareto solutions (for an -order S-System, values of are restricted in ). So, no diversity keeping strategy is necessary to obtain a set of uniformly distributed efficient vectors if the population size is set greater than . Meanwhile, the BOO model includes mixed variables and mixed-objectives, which make it difficult to solve it. Thus, we propose a mixed-variable multiobjective evolutionary algorithm (mv-MOEA) for this model. The mv-MOEA employs a respective evolution strategy for discrete and binary variables, which is beneficial to both the global exploration in the mix-variable search region and the local exploitation in the real variable subregion.
When inferring an equation of an S-System of components, mv-MOEA employs a population Pop with assistance of OldPop to accelerate convergence of binary search . Both Pop and OldPop are of size PopSize and separated into the discrete section and real section as Considering that a solution is evaluated by combining the binary and real variables, we also use an archive to save promising network topologies, as well as a of real vectors for the th solution in to promote the search in feasible regions of real variables. The framework of mv-MOEA is described as follows.
Step 1 (initialization). Randomly generate , , and of PopSize individuals and evaluate them. , initialize to be a set of PopSize randomly generated -dimensional real vectors. By combining with the th binary individual in , evaluate all vectors in via (6). Randomly select an individual in to be .
Step 2 (recombination). Generate PopSize offspring and combine them with to construct the intermediate population .
Step 3 (sorting). Sort via their fitting errors (the fitting error refers to the first objective of model (6)) and denote the worst one as . Compute dominance ranks of individuals in via the Pareto dominance relation. For individuals of the same rank, sort them in ascending order via their -norm (the second objective of (6)).
Step 4 (updating). Set and update by . Replace with PopSize best individuals in and update by the rest of . is randomly selected from or .
Step 5. If the stopping criterion is not satisfied, go to Step 2; otherwise, output the nondominated solutions and the iteration process ceases.
For , is generated by three randomly selected parents , , and :(i)With a probability , and are randomly selected from , and is randomly selected from .(ii)Otherwise, , , and are randomly selected from .Then, the binary and real part are, respectively, generated as follows. (i)The bit-string is generated by the bit-strings of , , and according to the binary recombination strategy proposed in .(ii)The real vector is generated by the DE/rand/1 mutation and the binary crossover strategies . With a probability , three parents are the real parts of , , and ; otherwise, is generated by the real part of and two real vectors randomly selected from .Finally, we combine and to obtain the candidate solutions .
If the fitting error of is smaller than that corresponding to in , replace with . is selected from the population with probability ; otherwise, it is selected from . Since the archive is here adopted to guide the convergence, it is updated with respect to the hamming distances. An offspring is employed to update as follows.(i)If the hamming distance between and is greater than zero for any , update the archive member by if has a better fitting error. Here, is the archive member with the worst fitting error when the hamming distance between any two archive members is greater than zero; otherwise, it is the worst one of archive members that have repeated bit-string;(ii)otherwise, compare with archive members with repeated bit-strings and replace by it one with the worst fitting error.
In this work, , , and are set to be 0.8, 0.7, and 0.8, respectively.
2.3. Evaluation of the Obtained Nondominated Solutions
The mx-MOEA generates a set of nondominated solutions of the BOO model (6) for each equation in the S-System, where each nondominated solution represents a configuration of this equation. Because two objectives of the nondominated solutions conflict with each other, all of them could be a candidate configuration of the investigated equation. Thus, selecting one from nondominated solutions needs to address a tradeoff between network connections and fitting errors. Considering that two objectives could be of different orders of magnitude, we first normalize two objectives by their maximum values. Then, two scores and can be obtained for the th solution of equation . Now, a tradeoff strategy could be employed to select one solution as the final inference result of equation .
Assume that nondominated solutions are obtained for the th equation. A popular aggregation method is to compute the linear aggregation sum (LAS): for a given weight and select one solution with minimum sum as the inference result of equation . However, the LAS method, which is dedicated to compare the difference of sum between all configurations, focuses on the most acute decrease of sum as connection number increases. As a result, a “too sparse” network is obtained.
To address the merit of LAS method, we would like to take the aggregation product (AP)as the criterion of result confirmation. For a given weight , we select the th solution withas the inference result of equation . Combining inference results of all equations, we then get the overall inference result of the investigated S-System and evaluate its quality by numbers of the true positives (TPs), false positives (FPs), true negatives (TNs), and false positives (FPs). With change of parameter , the Receiver Operator Characteristic (ROC) curve is taken as the illustration of quality for the nondominated solutions of (6) obtained by the mv-MOEA.
2.4. The Automatic Procedure for Selecting the Final Inference Results from the Obtained Nondominated Solutions
Although we can get an inference result for a given , we do not know which value of corresponds to the “right” tradeoff between two objectives of (6). In this work, we would like to propose an automatic selection procedure (ASP) for confirmation of the final inference result. When an inference result of the investigated S-System is obtained for a given weight , we can simultaneously get a sum vector as where and are the respective normalized objective values of the inference result for equation . When sampling in , we also get a collection of sum vectors constituting a normalized Pareto front in the objective space.
Since there are only two objectives to be considered, improvement of one objective will lead to deterioration of another. If small improvement of one objective results in a severe deterioration of another, the solutions constitute the so-called knee regions. According to the method proposed in , Li et al. suggest to locate the knee region to select one result from the Pareto front, where the angle-based method  is employed to seek the knee points on the combined Pareto front. In this method, two adjacent points are incorporated to compute the tradeoff angle of a point, and one with maximum tradeoff angle is selected as the preferred sum vector. Recall the value of corresponding to this sum vector; we can get the final inference results of all equations via (10) and (11) and combining them to get the overall inference result of the investigated S-System.
3. Results and Discussions
In this section, performances of the IM-MOEO are validated by two investigated S-Systems. To demonstrate the inference precision and the robustness of our method, we first infer an artificial network via noise-free and noisy simulated data. Then, the Ethanol Production System by Yeast is investigated to show how our method obtains a sparse network by focusing on simulation of its dynamical property. When generating simulated data for two problems, we sample 15 time points uniformly in the same time intervals as those investigated in the literatures for comparison.
3.1. Inference of an Artificial System by Noise-Free and Noisy Data
The investigated artificial network S1 is an artificial S-System illustrated in Table 1. Some previous researches [15, 20, 28–32] have been performed on this network to demonstrate efficiencies of S-System inference methods. Thus, we also reconstruct it to validate competitiveness of our method.
3.1.1. Experimental Settings
To perform a fair comparison with the method proposed in , noise-free data are time-course series generated by sampling at 15 time points for 4 diverse initial conditions. Search regions for the kinetic orders and rate constants are set as and , respectively. Due to the difficulty of multiobjective optimization, we employ a population of 100 individuals and report the obtained nondominated solutions after 2000 iterations. For each equation of this artificial system, the algorithm is independently run for 10 times to obtain a satisfactory inference result. The noise-free, 5%-noise, 15%-noise, and 25%-noise data are generated with the same method proposed in .
3.1.2. Inference Results of S1
Performances of IM-MOEO versus those of some previous researches are first investigated by the true positive rate (TPR) and false positive rate (FPR) which are computed as where TP, FN, TN, and FP represent the true positive (TP), false negative (FN), true negative (TN), and false positive (FP) predictions of the parameters. Then, the ROC curves are illustrated in Figure 1 for noise-free, 5%-noise, 15%-noise, and 25%-noise data. It is noted that the proposed method can generally identify the network via data of noise-free and 5% noise; however, its performance deteriorates quickly when the noise rate rises to 15%. It could be attributed to the inherent mechanism of our method, that is, incorporation of binary variables for identification of network connections. Since the norm of parameter vectors to be minimized is confirmed by binary variables, the proposed MOEA is dedicated to search the sparse network topologies, which makes it less compatible with the data noise.
Meanwhile, this method is significantly insensitive to the parameter . Thanks to incorporation of the norm instead of the norm of the parameter vectors, the inference results are not sensitive to values of . As a result, 101 uniformly sampled values in of only contribute to several different results of the artificial system. This suggests that if we can appropriately dispose of the difficulty introduced by incorporation of norm in the optimization model, it could be much more likely to select a preferred nondominated result of the multiobjective optimization via the aggregation method represented by (10) and (11).
By locating the knee region of the objective curve, we can get the final reconstruction results of the artificial system S1. The results again demonstrate that our method is not sensitive to value of , because the knee points are, respectively, obtained for noise-free, 5% noise, 15% noise, and 25% noise data when varies in , , , and , respectively. For comparison with L1-DPSO , the obtained reconstruction results are included in Table 2 for four different data sets.
It is shown that both our method and L1-DPSO can obtain the correct network of S1 by noise-free data. Generally, our method can obtain more accurate parameter values for noise-free data, except that parameters of (3) are less precise. This is because concentration of the 3rd component quickly reaches its stationary state, and consequently, less information could be extracted by fitting the time-series data of derivatives.
When it comes to the noise data, the competitiveness of our method is highlighted by the inference results. Our method can always obtain sparse network topologies of S1, even if the noise rate (NR) varies from 5% to 25%. By contrast, it is a mission impossible in the method proposed in  to set a uniform threshold value for pruning of network connections, because increase of NR definitely increases fitting errors of the L1-DPSO, which further influences the inference result of the investigated S-System. Although the data noise also lowers the precision of our inference results, incorporation of the biobjective model and the automatic confirmation scheme ensures that a sparse network can always be obtained, and for most cases, sparseness (rate of true connections versus possible connections) of the obtained network is similar to the true network. The superiority is highlighted by the inference result obtained when NR of data is relatively low—our method can correctly identify the correct network topologies via 5%-noise data. Meanwhile, the automatic confirmation of sparse network also meets a problem—sparse network topology is sensitive to data noise. As a result, for 15%- and 25%-noise data, more network connections are wrongly identified by our method.
3.2. Identification of the Yeast Fermentation Pathway Dynamics
As an example of real biochemical networks, the yeast fermentation pathway proposed in  is also investigated in this work. Its S-System model contains five dependent variables: glucose (), glucose-6-phosphate (), fructose-1,6-diphosphate (), phosphoenolpyruvate (), and ATP () and eight independent variables with the following steady-state values: glucose uptake (; 47.5 mM/min), hexokinase (; 24.1 mM/min), phosphofructokinase (; 53.9 mM/min), glyceraldehyde 3-phosphate dehydrogenase (; 91.4 mM/min), pyruvate kinase (; 18.1 mM/min), polysaccharide storage (; 82.9 mM/min), glycerol production (; 92.4 mM/min), and ATPase (; 1.0 mM/min) . So, the S-System S2 is
It is inferred via a time-course data generated by 10 random initial concentrations, with each initial condition, that 15 time points are sampled. The search ranges of the parameters are for and and for and . Employing the mv-MOEA solving model (6), we can obtain a collection of configurations (nondominated solutions) for each equation. Then, the ROC curve could be obtained by sampling in . Finally, the automatic selection strategy is implemented obtaining its final inference result.
Although there are several weak connections in the system S2, the mv-MOEA can get the correct network topologies for all equations (it means that, for each equation, the mv-MOEA can obtain one nondominated solution indicating the correct network topology). To demonstrate a highlighted illustration of the nondominated solutions obtained by mv-MOEA, we only illustrate in Figure 2 the ROC curve obtained by sampling in . The ROC curve demonstrates a satisfactory result for inference of S2, which shows that the biobjective optimization model (6) and mv-MOEA can work well for this network. What should be noted is that the ROC curve does not include the point , despite the fact that the correct topology corresponding to each equation is included in the obtained collections of nondominated solutions. The reason is that for all equations the correct topologies corresponding to various network connections and fitting errors, a uniform setting of possibly does not locate all correct configurations at the same time. Consequently, the overall inference result of S2 does not locate all correct network topologies for all equations.
By employing the ASP on the obtained nondominated solutions, we get the final inference result of system S2 included in Table 3. Just for the same reason, the final result obtained by the ASP has got a false connection and missed several weak connections. To evaluate how these wrongly identified connections influence dynamical properties of the investigated S-System, we compare the dynamical curves of all components in one plot illustrated in Figure 3. It is demonstrated that the dynamical properties of obtained network are almost consistent to that of the true network, even if several connections are wrongly identified. Premised on the result of data fitting, IM-MOEO is dedicated to obtain a sparse network. Because all the wrong identifications are weak connections that do not significantly influence the dynamic properties of this network, these weak connections are not correctly confirmed when the ASP gets a tradeoff between data fitting error and network sparseness. As a result, it comes to a sparse network that has a low FPR and a high TPR.
4. Conclusion and Discussion
To address defects of existing inference methods, we propose a biobjective optimization model for identification of S-Systems, an efficient mix-variable multiobjective evolutionary algorithm to solve the biobjective model, and an automatic selection scheme for confirmation of the final inference result. Although introduction of binary variables and -norm make the biobjective optimization model harder to solve, the proposed mv-MOEA can deal with it with satisfactory performances. The automatic selection scheme demonstrates to be intelligent in investigated benchmark networks; however, it sometimes misses some weak connections due to its preference to sparse network topologies. In general, the biobjective optimization method accompanied with the automatic selection scheme is a universal method for inference of BSs, because the biobjective model could be applied to BSs of any size, and no problem-dependent parameters are needed for its successful implement. By inferring two widely investigated small-scale networks, we do validate its effectiveness compared with previous researches. However, when applied to large-scale BSs, mv-MOEA could be computationally expensive and perform unsatisfactorily attributed to data noise as well as lack of sufficient samples. Thus, data mining methods should be incorporated to boost its applications on large-scale BSs. Further improvement of this method could be focused on enhancement of its performance on noise data and its applications on large-scale BSs.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
This work is partially supported by the National Science Foundation of China under Grant nos. 61303028 and 61672388.
- M. I. Davidich and S. Bornholdt, “Boolean network model predicts cell cycle sequence of fission yeast,” PLoS ONE, vol. 3, no. 2, Article ID e1672, 2008.
- P. Trairatphisan, A. Mizera, J. Pang, A. A. Tantar, and J. Schneider, “Recent development and biomedical applications of probabilistic Boolean networks,” Cell Communication and Signaling, vol. 11, article 46, 2013.
- N. Friedman, M. Linial, I. Nachman, and D. Pe'er, “Using Bayesian networks to analyze expression data,” Journal of Computational Biology, vol. 7, no. 3-4, pp. 601–620, 2000.
- L. E. Chai, M. S. Mohamad, S. Deris, C. K. Chong, Y. W. Choon, and S. Omatu, “Current development and review of dynamic bayesian network-based methods for inferring gene regulatory networks from gene expression data,” Current Bioinformatics, vol. 9, no. 5, pp. 531–539, 2014.
- G. Michailidis and F. d'Alch\'e-Buc, “Autoregressive models for gene regulatory network inference: sparsity, stability and causality issues,” Mathematical Biosciences, vol. 246, no. 2, pp. 326–334, 2013.
- Y. X. R. Wang and H. Huang, “Review on statistical methods for gene network reconstruction using expression data,” Journal of Theoretical Biology, vol. 362, pp. 53–61, 2014.
- L. E. Chai, S. K. Loh, S. T. Low, M. S. Mohamad, S. Deris, and Z. Zakaria, “A review on the computational approaches for gene regulatory network construction,” Computers in Biology and Medicine, vol. 48, no. 1, pp. 55–65, 2014.
- Y. Li, S. Jin, L. Lei, Z. Pan, and X. Zou, “Deciphering deterioration mechanisms of complex diseases based on the construction of dynamic networks and systems analysis,” Scientific Reports, vol. 5, article e9283, 2015.
- X. Xiao, W. Zhang, and X. Zou, “A new asynchronous parallel algorithm for inferring large-scale gene regulatory networks,” PLoS ONE, vol. 10, no. 3, Article ID e0119294, 2015.
- E. O. Voit and J. Almeida, “Decoupling dynamical systems for pathway identification from metabolic profiles,” Bioinformatics, vol. 20, no. 11, pp. 1670–1681, 2004.
- A. R. Chowdhury, M. Chetty, and N. X. Vinh, “Inferring large scale genetic networks with S-system model,” in Proceedings of The Annual Conference on Genetic And Evolutionary Computation (GECCO ’13), pp. 271–278, 2013.
- A. Komori, Y. Maki, I. Ono, and M. Okamoto, “How to infer the interactive large scale regulatory network in 'omic' studies,” in Proceedings of 4th International Conference on Computational Systems-Biology and Bioinformatics, (CSBio '13), pp. 44–52, November 2013.
- R. R. Khan and M. Chetty, “Towards large scale genetic network modeling,” in Proceedings of the IEEE Computational Intelligence in Bioinformatics & Computational Biology (CIBCB '15), pp. 1–8, 2015.
- D. Tominaga, N. Koga, and M. Okamoto, “Efficient numerical optimization algorithm based on genetic algorithm for inverse problem,” in Proceedings of The Annual Conference on Genetic And Evolutionary Computation, vol. 251, pp. 251–258, 2000.
- L. Palafox, N. Noman, and H. Iba, “Reverse engineering of gene regulatory networks using dissipative particle swarm optimization,” IEEE Transactions on Evolutionary Computation, vol. 17, no. 4, pp. 577–587, 2013.
- W.-P. Lee and Y.-T. Hsiao, “Inferring gene regulatory networks using a hybrid GA-PSO approach with numerical constraints and network decomposition,” Information Sciences, vol. 188, pp. 80–99, 2012.
- S. Li, L. Kang, and X.-M. Zhao, “A survey on evolutionary algorithm based hybrid intelligence in bioinformatics,” BioMed Research International, vol. 2014, Article ID 362738, 8 pages, 2014.
- K.-Y. Tsai and F.-S. Wang, “Evolutionary optimization with data collocation for reverse engineering of biological networks,” Bioinformatics, vol. 21, no. 7, pp. 1180–1188, 2005.
- L.-Z. Liu, F.-X. Wu, and W. J. Zhang, “Inference of biological S-system using the separable estimation method and the genetic algorithm,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 4, pp. 955–965, 2012.
- P.-K. Liu and F.-S. Wang, “Inference of biochemical network models in S-system using multiobjective optimization approach,” Bioinformatics, vol. 24, no. 8, pp. 1085–1092, 2008.
- P. Koduru, Z. Dong, S. Das, S. M. Welch, J. L. Roe, and E. Charbit, “A multiobjective evolutionary-simplex hybrid approach for the optimization of differential equation models of gene networks,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 5, pp. 572–590, 2008.
- X. Cai, Z. Hu, S. Das, and S. M. Welch, “A hierarchical Pareto dominance based multi-objective approach for the optimization of gene regulatory network models,” in Proceedings of 2012 IEEE Congress on Evolutionary Computation, (CEC '12), June 2012.
- C. Spieth, F. Streichert, N. Speer, and A. Zell, “Multi-objective model optimization for inferring gene regulatory networks,” in Proceedings of The International Conference on Evolutionary Multi-Criterion Optimization, vol. 3410, pp. 607–620, 2005.
- Y. Chen, W. Xie, and X. Zou, “A binary differential evolution algorithm learning from explored solutions,” Neurocomputing, vol. 149, pp. 1038–1047, 2015.
- R. Storn and K. Price, “Differential evolution---a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
- L. Li, X. Yao, R. Stolkin, M. Gong, and S. He, “An evolutionary multiobjective approach to sparse reconstruction,” IEEE Transactions on Evolutionary Computation, vol. 18, no. 6, pp. 827–845, 2014.
- J. Branke, K. Deb, H. Dierolf, and M. Osswald, “Finding knees in mult-objective optimization,” in Proceedings of the 8th Conference Parallel Problem Solving from Nature-(PPSN '04), vol. 3242 of Lecture Notes in Computer Science, pp. 722–731, 2004.
- M. Kabir, N. Noman, and H. Iba, “Reverse engineering gene regulatory network from microarray data using linear time-variant model,” BMC Bioinformatics, vol. 11, article S56, supplement 1, 2010.
- S. Kimura, K. Ide, A. Kashihara et al., “Inference of S-system models of genetic networks using a cooperative coevolutionary algorithm,” Bioinformatics, vol. 21, no. 7, pp. 1154–1163, 2005.
- S. Kikuchi, D. Tominaga, M. Arita, M. Takahashi, and M. Tomita, “Dynamic modeling of genetic networks using genetic algorithm and S-system,” Bioinformatics, vol. 19, no. 5, pp. 643–650, 2003.
- N. Noman and H. Iba, “Reverse engineering genetic networks using evolutionary computation,” Genome Informatics, vol. 16, no. 2, pp. 205–214, 2005.
- N. Noman and H. Iba, “On the reconstruction of gene regulatory networks from noisy expression profiles,” in Proceedings of The IEEE International Conference on Evolutionary Computation, no. 1, pp. 2543–2550, 2006.
- J. Vera, P. De Atauri, M. Cascante, and N. V. Torres, “Multicriteria optimization of biochemical systems by linear programming: application to production of ethanol by Saccharomyces cerevisiae,” Biotechnology and Bioengineering, vol. 83, no. 3, pp. 335–343, 2003.
- D.-Y. Cho, K.-H. Cho, and B.-T. Zhang, “Identification of biochemical networks by S-tree based genetic programming,” Bioinformatics, vol. 22, no. 13, pp. 1631–1640, 2006.
Copyright © 2017 Yu Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.