The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Dynamic modeling of genetic networks using genetic algorithm and S-system
Open accessAbstract
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. Contact: kikuchi@sfc.keio.ac.jp * To whom correspondence should be addressed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
de Jong, H. (2002) · Journal of Computational Biology · doi:10.1089/10665270252833208 · Cited by 2,663
Arkin, A., Ross, J., & McAdams, H. H. (1998) · Genetics · doi:10.1093/genetics/149.4.1633 · Cited by 1,490
Genetic network inference: from co-expression clustering to reverse engineering
D’haeseleer, P., Liang, S., & Somogyi, R. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.8.707 · Cited by 944
Mackay, D. J. C. (1995) · Network Computation in Neural Systems · doi:10.1088/0954-898x/6/3/011 · Cited by 915
E-CELL: software environment for whole-cell simulation
Tomita, M., Hashimoto, K., Takahashi, K., Shimizu, T. S., Matsuzaki, Y., Miyoshi, F., Saito, K., Tanida, S., Yugi, K., Venter, J. C., et al. (1999) · Bioinformatics · doi:10.1093/bioinformatics/15.1.72 · Cited by 764 · cited 3×
“(2) We employed a novel crossover method, the Simplex Crossover (SPX; Tsutsui et al., 1999).”
BackgroundMethodSelf-citationBiochemical Systems Analysis: A Study of Function and Design in Molecular Biology
Savageau, M. A. (1976) · Medical Entomology and Zoology · Cited by 741
An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms.
Janikow, C. Z., & Michalewicz, Z. (1991) · international conference on Genetic algorithms · Cited by 451
Bayesian Regularization and Pruning Using a Laplace Prior
Williams, P. M. (1995) · Neural Computation · doi:10.1162/neco.1995.7.1.117 · Cited by 377
Multi-parent recombination with simplex crossover in real coded genetic algorithms
Tsutsui, S., Yamamura, M., & Higuchi, T. (1999) · Tokyo Tech Research Repository (Tokyo Institute of Technology) · Cited by 319
Cited by
Machine learning in bioinformatics
Larrañaga, P., Calvo, B., Santana, R., Bielza, C., Galdiano, J., Inza, I., Lozano, J. A., Armañanzas, R., Santafé, G., Pérez, A., et al. (2006) · Briefings in Bioinformatics · doi:10.1093/bib/bbk007 · Cited by 867
Decoupling dynamical systems for pathway identification from metabolic profiles
Voit, E. O., & Almeida, J. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth140 · Cited by 294
Inverse problems in systems biology
Engl, H. W., Flamm, C., Kügler, P., Lu, J., Müller, S., & Schuster, P. (2009) · Inverse Problems · doi:10.1088/0266-5611/25/12/123014 · Cited by 122
Metadata
- Authors
- Kikuchi, S., Tominaga, D., Arita, M., Takahashi, K., & Tomita, M.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2003-03-22
- Volume
- 19
- Issue
- 5
- Pages
- 643-650
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2141239733
- Cited by
- 401
- References
- 18
- FWCI
- 8.90
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic modeling of genetic networks using genetic algorithm and S-system. https://app.cochat.ai/papers/10.1093/bioinformatics/btg027
- The paper
- Kikuchi, S., Tominaga, D., Arita, M., Takahashi, K., & Tomita, M. (2003). Dynamic modeling of genetic networks using genetic algorithm and S-system. Bioinformatics. https://doi.org/10.1093/bioinformatics/btg027
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.