TY - JOUR
T1 - Dynamics modeling of genetic networks using genetic algorithm and S-system
AU - Kikuchi, Shinichi
AU - Tominaga, Daisuke
AU - Arita, Masanori
AU - Takahashi, Katsutoshi
AU - Tomita, Masaru
N1 - Funding Information:
This work is also supported in part by a grant from the Ministry of Agriculture, Forestry and Fisheries of Japan (Rice Genome Project SY-2103), a grant from New Energy and Industrial Technology Development and Organization (NEDO) of the Ministry of Economy, Trade and Industry of Japan (Development of a Technological Infrastructure for Industrial Bioprocess Project), and a grant from Japan Science and Technology Agency (JST).
Funding Information:
This work is supported by a grant from the bioinformat-ics field, dedicated to the development of talent in newly-established areas, the special coordination funds for promoting science and technology, the Ministry of Education, Culture, Sports, Science and Technology.
PY - 2003/3/22
Y1 - 2003/3/22
N2 - Motivation: The modeling of system dynamics of genetic networks, metabolic networks or signal transduction cascades from time-course data is formulated as a reverse-problem. Previous studies focused on the estimation of only network structures, and they were ineffective in inferring a network structure with feedback loops. We previously proposed a method to predict not only the network structure but also its dynamics using a Genetic Algorithm (GA) and an S-system formalism. However, it could predict only a small number of parameters and could rarely obtain essential structures. In this work, we propose a unified extension of the basic method. Notable improvements are as follows: (1) an additional term in its evaluation function that aims at eliminating futile parameters; (2) a crossover method called Simplex Crossover (SPX) to improve its optimization ability; and (3) a gradual optimization strategy to increase the number of predictable parameters. Results: The proposed method is implemented as a C program called PEACE1 (Predictor by Evolutionary Algorithms and Canonical Equations 1). Its performance was compared with the basic method. The comparison showed that: (1) the convergence rate increased about 5-fold; (2) the optimization speed was raised about 1.5-fold; and (3) the number of predictable parameters was increased about 5-fold. Moreover, we successfully inferred the dynamics of a small genetic network constructed with 60 parameters for 5 network variables and feedback loops using only time-course data of gene expression.
AB - Motivation: The modeling of system dynamics of genetic networks, metabolic networks or signal transduction cascades from time-course data is formulated as a reverse-problem. Previous studies focused on the estimation of only network structures, and they were ineffective in inferring a network structure with feedback loops. We previously proposed a method to predict not only the network structure but also its dynamics using a Genetic Algorithm (GA) and an S-system formalism. However, it could predict only a small number of parameters and could rarely obtain essential structures. In this work, we propose a unified extension of the basic method. Notable improvements are as follows: (1) an additional term in its evaluation function that aims at eliminating futile parameters; (2) a crossover method called Simplex Crossover (SPX) to improve its optimization ability; and (3) a gradual optimization strategy to increase the number of predictable parameters. Results: The proposed method is implemented as a C program called PEACE1 (Predictor by Evolutionary Algorithms and Canonical Equations 1). Its performance was compared with the basic method. The comparison showed that: (1) the convergence rate increased about 5-fold; (2) the optimization speed was raised about 1.5-fold; and (3) the number of predictable parameters was increased about 5-fold. Moreover, we successfully inferred the dynamics of a small genetic network constructed with 60 parameters for 5 network variables and feedback loops using only time-course data of gene expression.
UR - http://www.scopus.com/inward/record.url?scp=0037461033&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037461033&partnerID=8YFLogxK
U2 - 10.1093/bioinformatics/btg027
DO - 10.1093/bioinformatics/btg027
M3 - Article
C2 - 12651723
AN - SCOPUS:0037461033
SN - 1367-4803
VL - 19
SP - 643
EP - 650
JO - Bioinformatics
JF - Bioinformatics
IS - 5
ER -