BMC Bioinformatics | |
Jimena: efficient computing and system state identification for genetic regulatory networks | |
Stefan Karl1  Thomas Dandekar1  | |
[1] Department of Bioinformatics, University of Würzburg, Am Hubland, Würzburg, Germany | |
关键词: Boolean tree; Binary decision diagram; Stable state; Interpolation; Genetic regulatory network; Boolean function; | |
Others : 1087730 DOI : 10.1186/1471-2105-14-306 |
|
received in 2013-04-06, accepted in 2013-10-03, 发布年份 2013 | |
【 摘 要 】
Background
Boolean networks capture switching behavior of many naturally occurring regulatory networks. For semi-quantitative modeling, interpolation between ON and OFF states is necessary. The high degree polynomial interpolation of Boolean genetic regulatory networks (GRNs) in cellular processes such as apoptosis or proliferation allows for the modeling of a wider range of node interactions than continuous activator-inhibitor models, but suffers from scaling problems for networks which contain nodes with more than ~10 inputs. Many GRNs from literature or new gene expression experiments exceed those limitations and a new approach was developed.
Results
(i) As a part of our new GRN simulation framework Jimena we introduce and setup Boolean-tree-based data structures; (ii) corresponding algorithms greatly expedite the calculation of the polynomial interpolation in almost all cases, thereby expanding the range of networks which can be simulated by this model in reasonable time. (iii) Stable states for discrete models are efficiently counted and identified using binary decision diagrams. As application example, we show how system states can now be sampled efficiently in small up to large scale hormone disease networks (Arabidopsis thaliana development and immunity, pathogen Pseudomonas syringae and modulation by cytokinins and plant hormones).
Conclusions
Jimena simulates currently available GRNs about 10-100 times faster than the previous implementation of the polynomial interpolation model and even greater gains are achieved for large scale-free networks. This speed-up also facilitates a much more thorough sampling of continuous state spaces which may lead to the identification of new stable states. Mutants of large networks can be constructed and analyzed very quickly enabling new insights into network robustness and behavior.
【 授权许可】
2013 Karl and Dandekar; licensee BioMed Central Ltd.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
20150117035220363.pdf | 2446KB | download | |
Figure 7. | 76KB | Image | download |
Figure 6. | 38KB | Image | download |
Figure 5. | 49KB | Image | download |
Figure 4. | 42KB | Image | download |
Figure 3. | 85KB | Image | download |
Figure 2. | 53KB | Image | download |
Figure 1. | 76KB | Image | download |
【 图 表 】
Figure 1.
Figure 2.
Figure 3.
Figure 4.
Figure 5.
Figure 6.
Figure 7.
【 参考文献 】
- [1]Gershenson C: Introduction to random Boolean networks. Workshop and tutorial proceedings, ninth International conference on the simulation and synthesis of living systems (ALife IX) 2004, 160-173.
- [2]Mendoza L, Xenarios I: A method for the generation of standardized qualitative dynamical systems of regulatory networks. Theor Biol Med Model 2006, 3:13. BioMed Central Full Text
- [3]Di Cara A, Abhishek G, De Micheli G, Xenarios I, Mendoza L: Dynamic simulation of regulatory networks using SQUAD. BMC Bioinforma 2007, 8:462. BioMed Central Full Text
- [4]Wittmann DM, Krumsiek J, Saez-Rodriguez J, Lauffenburger DA, Klamt S, Theis FJ: Transforming Boolean models to continuous models: methodology and application to T-cell receptor signaling. BMC Syst Biol 2009, 3:98. BioMed Central Full Text
- [5]Albert I, Thakar J, Li S, Zhang R, Albert R: Boolean network simulations for life scientists. Sour Code Bio Med 2008, 3:16. BioMed Central Full Text
- [6]Krumsiek J, Pölsterl S, Wittmann DM, Theis FJ: Odefy–from discrete to continuous models. BMC Bioinforma 2010, 11:233. BioMed Central Full Text
- [7]Sánchez-Corrales YE, Alvarez-Buylla ER, Mendoza L: The Arabidopsis thaliana flower organ specification gene regulatory network determines a robust differentiation process. J Theor Biol 2010, 264:971-983.
- [8]Koczan D, Drynda S, Hecker M, Drynda A, Guthke R, Kekow J, Thiesen HJ: Molecular discrimination of responders and nonresponders to anti-TNFalpha therapy in rheumatoid arthritis by etanercept. Arthritis Res Ther 2008, 10:R50. BioMed Central Full Text
- [9]Naseem M, Philippi N, Hussain A, Wangorsch G, Ahmed N, Dandekar T: Integrated systems view on networking by hormones in Arabidopsis immunity reveals multiple crosstalk for cytokinin. Plant Cell 2012, 24:1793-1814.
- [10]Knuth D: Binary decision diagrams. In The Art of Computer Programming. Volume 4A: Combinatorial Algorithm, Part 1. Boston: Addison-Wesley; 2011:202-208.
- [11]Bryant RE: Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput 1986, C-35:8.
- [12]Schlatter R, Philippi N, Wangorsch G, Pick R, Sawodny O, Borner C, Timmer J, Ederer M, Dandekar T: Integration of Boolean models exemplified on hepatocyte signal transduction. Brief Bioinform 2012, 13(3):365-376.
- [13]Whaley J: JavaBDD. http://javabdd.sourceforge.net webcite
- [14]Karl S: Jimena. http://stefan-karl.de/jimena/ webcite
- [15]Albert R: Scale-free networks in cell biology. J Cell Sci 2005, 118(Pt 21):4947-4957.
- [16]Espinosa-Soto C, Padilla-Longoria P, Alvarez-Buylla E: A gene regulatory network model for cell-fate determination during Arabidopsis thaliana flower development that is robust and recovers experimental gene expression profiles. Plant Cell 2004, 16:2923-2939.
- [17]Koornneef M, Alonso-Blanco C, Blankestijn-de Vries H, Hanhart CJ, Peters AJM: Genetic interactions among late-flowering mutants of Arabidopsis. Genetics 1998, 148:885-892.
- [18]Isalan M, Lemerle C, Michalodimitrakis K, Horn C, Beltrao P, Raineri E, Carriga-Canut M, Serrano L: Evolvability and hierarchy in rewired bacterial gene networks. Nature 2008, 452:840-845.
- [19]Homann OR, Dea J, Noble S, Johnson AD: A phenotypic profile of the candida albicans regulatory network. PLoS Genet 2009, 5:e1000783.