2010
DOI: 10.1007/s00449-010-0486-7
|View full text |Cite
|
Sign up to set email alerts
|

An integrative and practical evolutionary optimization for a complex, dynamic model of biological networks

Abstract: Computer simulation is an important technique to capture the dynamics of biochemical networks. Numerical optimization is the key to estimate the values of kinetic parameters so that the dynamic model reproduces the behaviors of the existing experimental data. It is required to develop general strategies for the optimization of complex biochemical networks with a huge space of search parameters, under the condition that kinetic and quantitative data are hardly available. We propose an integrative and practical … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 41 publications
0
5
0
Order By: Relevance
“…Since the number of undetermined parameters increases with increased network size, the values of many parameters must be estimated so that the model can reproduce the experimental data. Massive calculation power with constrained evolutionary search methods [ 35 , 36 ] was required to estimate the unknown values of many parameters. We iterated 4 × 10 7 simulations to estimate 351 parameters using a genetic algorithm over 8 days with 101 cores of Intel Xeon E5-2670 v3 2.3 GHz on a super computer.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Since the number of undetermined parameters increases with increased network size, the values of many parameters must be estimated so that the model can reproduce the experimental data. Massive calculation power with constrained evolutionary search methods [ 35 , 36 ] was required to estimate the unknown values of many parameters. We iterated 4 × 10 7 simulations to estimate 351 parameters using a genetic algorithm over 8 days with 101 cores of Intel Xeon E5-2670 v3 2.3 GHz on a super computer.…”
Section: Discussionmentioning
confidence: 99%
“…The parameter estimation problem is formulated as a constrained optimization problem: where is the objective function that evaluates the difference between the estimated parameters and literature-based parameters. consists of multiple if–then rule-based score functions that evaluate whether the simulated behavior is consistent with experimental data [ 35 ]. We categorized search parameters into three groups: Classes I, II and III.…”
Section: Methodsmentioning
confidence: 99%
“…Multiple and conflicting objectives appear often in the design and optimisation of dynamic bioprocesses (e.g., [12,23,24,33,39]). The resulting multi-objective optimisation problems yield a set of so-called Pareto optimal solutions instead of one single optimal solution in singleobjective optimisation problems [29].…”
Section: Introductionmentioning
confidence: 99%
“…By repeating the selection and reproduction operations, RC-GAs evolve the population and eventually obtain the individuals (the sets of model parameters) that provide an optimal fit for the experimental data. Two RCGAs, UNDX/MGG and REX star /JGG, have been previously employed for parameter estimation [20], [21], [22], [23], [24], [25], [26], [27]. UNDX/MGG prevents premature convergence (population trapped in the local optima in the early stage of the search), whereas REX star /JGG evaluates the search space and moves the population in a favorable direction.…”
Section: Rcgasmentioning
confidence: 99%