Skip Navigation


Bioinformatics Advance Access originally published online on October 28, 2004
Bioinformatics 2005 21(7):1154-1163; doi:10.1093/bioinformatics/bti071
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
21/7/1154    most recent
bti071v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (32)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kimura, S.
Right arrow Articles by Konagaya, A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Kimura, S.
Right arrow Articles by Konagaya, A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2004. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

Inference of S-system models of genetic networks using a cooperative coevolutionary algorithm

Shuhei Kimura 1,3,*, Kaori Ide 1,3, Aiko Kashihara 3, Makoto Kano 5, Mariko Hatakeyama 1,3, Ryoji Masui 3,6, Noriko Nakagawa 3,7, Shigeyuki Yokoyama 2,3,4,6, Seiki Kuramitsu 3,7 and Akihiko Konagaya 1,3

1Bioinformatics Group, RIKEN Genomic Sciences Center 1-7-22 Suehiro-cho, Tsurumi, Yokohama 230-0045, Japan
2Protein Research Group, RIKEN Genomic Sciences Center 1-7-22 Suehiro-cho, Tsurumi, Yokohama 230-0045, Japan
3Structurome Group, RIKEN Harima Institute at Spring-8 1-1-1 Kohto, Mikazuki-cho, Sayo, Hyogo 679-5148, Japan
4Cellular Signaling Laboratory, RIKEN Harima Institute at Spring-8 1-1-1 Kohto, Mikazuki-cho, Sayo, Hyogo 679-5148, Japan
5Tokyo Research Laboratory, IBM Japan 1623-14 Shimo-tsuruma, Yamato, Kanagawa 242-8502, Japan
6Department of Biophysics and Biochemistry, Graduate School of Science, the University of Tokyo 7-3-1 Hongo, Bunkyo, Tokyo 113-0033, Japan
7Department of Biology, Graduate School of Science, Osaka University Toyonaka, Osaka 560-0043, Japan

*To whom correspondence should be addressed.

Motivation: To resolve the high-dimensionality of the genetic network inference problem in the S-system model, a problem decomposition strategy has been proposed. While this strategy certainly shows promise, it cannot provide a model readily applicable to the computational simulation of the genetic network when the given time-series data contain measurement noise. This is a significant limitation of the problem decomposition, given that our analysis and understanding of the genetic network depend on the computational simulation.

Results: We propose a new method for inferring S-system models of large-scale genetic networks. The proposed method is based on the problem decomposition strategy and a cooperative coevolutionary algorithm. As the subproblems divided by the problem decomposition strategy are solved simultaneously using the cooperative coevolutionary algorithm, the proposed method can be used to infer any S-system model ready for computational simulation. To verify the effectiveness of the proposed method, we apply it to two artificial genetic network inference problems. Finally, the proposed method is used to analyze the actual DNA microarray data.

Contact: skimura{at}gsc.riken.jp

Supplementary information: See Bioinformatics Online.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Brief BioinformHome page
W.-P. Lee and W.-S. Tzou
Computational methods for discovering gene networks from expression data
Brief Bioinform, July 1, 2009; 10(4): 408 - 423.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
S. Kimura, S. Nakayama, and M. Hatakeyama
Genetic network inference as a series of discrimination tasks
Bioinformatics, April 1, 2009; 25(7): 918 - 925.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
P. Gennemark and D. Wedelin
Benchmarks for identification of ordinary differential equations from time series data
Bioinformatics, March 15, 2009; 25(6): 780 - 786.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
G. Goel, I-C. Chou, and E. O. Voit
System estimation from metabolic time-series data
Bioinformatics, November 1, 2008; 24(21): 2505 - 2511.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
P.-K. Liu and F.-S. Wang
Inference of biochemical network models in S-system using multiobjective optimization approach
Bioinformatics, April 15, 2008; 24(8): 1085 - 1092.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
O. R. Gonzalez, C. Kuper, K. Jung, P. C. Naval Jr, and E. Mendoza
Parameter estimation using Simulated Annealing for S-system models of biochemical networks
Bioinformatics, February 15, 2007; 23(4): 480 - 486.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
D.-Y. Cho, K.-H. Cho, and B.-T. Zhang
Identification of biochemical networks by S-tree based genetic programming
Bioinformatics, July 1, 2006; 22(13): 1631 - 1640.
[Abstract] [Full Text] [PDF]

Home page
 Brief BioinformHome page
P. Larranaga, B. Calvo, R. Santana, C. Bielza, J. Galdiano, I. Inza, J. A. Lozano, R. Armananzas, G. Santafe, A. Perez, et al.
Machine learning in bioinformatics
Brief Bioinform, March 1, 2006; 7(1): 86 - 112.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.