Effective calibration of artificial gene regulatory networks

Knowing every single component of a given biological system is not enough to understand the complexity of the system but rather it becomes crucial to understand how these components interact with each others. It is not only important the knowledge of genes and proteins, but also knowing their structures and primarily the laws and parameters governing their dynamics, which is often unknown and impossible to measure directly. The Gene Regulatory Networks explain exactly how a genomic sequence encodes the regulation of expression of sets of genes, which progressively generate developmental patterns, and execute the construction of multiple states of differentiation. Their main aim is to represent the regulation rules underlying the gene expression. In this work we have designed the CMA-ES algorithm to infer the parameters in the S-system model of a gene regulatory network. This model is a well-known mathematical framework whose structure is rich enough to capture many relevant biological details, and it can model more complicated genetic network behaviour. CMA-ES has been compared against 7 state-of-the-art algorithms to evaluate its efficiency and its robustness. From a general point of view, it seems clear how CMA-ES is able to estimate in a better way the target parameters with respect to the state-of-the-art methods, either in terms of success rate or in terms of Euclidean distance. Finally, this research paper includes a study on the convergence of CMA-ES through Time-To-Target plots, which are a way to characterize the running time of stochastic algorithms; and a global sensitivity analysis method, the Morris algorithm.

[1]  Pedro Mendes,et al.  Artificial gene networks for objective comparison of analysis algorithms , 2003, ECCB.

[2]  J. Hasty,et al.  Reverse engineering gene networks: Integrating genetic perturbations with dynamical modeling , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Nikolaus Hansen,et al.  A restart CMA evolution strategy with increasing population size , 2005, 2005 IEEE Congress on Evolutionary Computation.

[4]  J. Vohradský Neural network model of gene expression , 2001, FASEB journal : official publication of the Federation of American Societies for Experimental Biology.

[5]  Hitoshi Iba,et al.  Reverse engineering gene regulatory network from microarray data using linear time-variant model , 2010, BMC Bioinformatics.

[6]  Marcel J. T. Reinders,et al.  A Comparison of Genetic Network Models , 2000, Pacific Symposium on Biocomputing.

[7]  Hyung-Seok Choi,et al.  Reverse engineering of gene regulatory networks. , 2007, IET systems biology.

[8]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[9]  Feng-Sheng Wang,et al.  Evolutionary optimization with data collocation for reverse engineering of biological networks , 2005, Bioinform..

[10]  Ting Chen,et al.  Modeling Gene Expression with Differential Equations , 1998, Pacific Symposium on Biocomputing.

[11]  E. Davidson,et al.  Gene regulatory networks. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[12]  H. Iba,et al.  Reverse engineering genetic networks using evolutionary computation. , 2005, Genome informatics. International Conference on Genome Informatics.

[13]  Celso C. Ribeiro,et al.  TTT plots: a perl program to create time-to-target plots , 2007, Optim. Lett..

[14]  Masaru Tomita,et al.  Dynamic modeling of genetic networks using genetic algorithm and S-system , 2003, Bioinform..

[15]  Vincenzo Cutello,et al.  Entropic divergence for population based optimization algorithms , 2010, IEEE Congress on Evolutionary Computation.

[16]  Max D. Morris,et al.  Factorial sampling plans for preliminary computational experiments , 1991 .

[17]  Hitoshi Iba,et al.  Inference of genetic networks using S-system: information criteria for model selection , 2006, GECCO.

[18]  Doheon Lee,et al.  Component-based software architecture for biosystem reverse engineering , 2005 .

[19]  D. Irvine,et al.  Efficient solution of nonlinear ordinary differential equations expressed in S-system canonical form , 1990 .

[20]  Christian L. Barrett,et al.  Systems biology as a foundation for genome-scale synthetic biology. , 2006, Current opinion in biotechnology.

[21]  J. Doyle,et al.  Reverse Engineering of Biological Complexity , 2002, Science.

[22]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

[23]  Patrik D'haeseleer,et al.  Genetic network inference: from co-expression clustering to reverse engineering , 2000, Bioinform..

[24]  Michal Linial,et al.  Using Bayesian Networks to Analyze Expression Data , 2000, J. Comput. Biol..

[25]  Shuhei Kimura,et al.  Inference of S-system models of genetic networks using a cooperative coevolutionary algorithm , 2005, Bioinform..

[26]  Alvis Brazma,et al.  Current approaches to gene regulatory network modelling , 2007, BMC Bioinformatics.

[27]  Satoru Miyano,et al.  Identification of Genetic Networks from a Small Number of Gene Expression Patterns Under the Boolean Network Model , 1998, Pacific Symposium on Biocomputing.

[28]  H. Iba,et al.  Inferring Gene Regulatory Networks using Differential Evolution with Local Search Heuristics , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[29]  Jonas S. Almeida,et al.  Parameter optimization in S-system models , 2008, BMC Systems Biology.

[30]  Alina Sîrbu,et al.  Comparison of evolutionary algorithms in gene regulatory network model inference , 2010, BMC Bioinformatics.

[31]  Feng-Sheng Wang,et al.  Inference of biochemical network models in S-system using multiobjective optimization approach , 2008, Bioinform..

[32]  Werner Dubitzky,et al.  Comparative study of three commonly used continuous deterministic methods for modeling gene regulation networks , 2010, BMC Bioinformatics.