Abstract

BackgroundCellular decision-making is governed by molecular networks that are highly complex. An integrative understanding of these networks on a genome wide level is essential to understand cellular health and disease. In most cases however, such an understanding is beyond human comprehension and requires computational modeling. Mathematical modeling of biological networks at the level of biochemical details has hitherto relied on state transition models. These are typically based on enumeration of all relevant model states, and hence become very complex unless severely – and often arbitrarily – reduced. Furthermore, the parameters required for genome wide networks will remain underdetermined for the conceivable future. Alternatively, networks can be simulated by Boolean models, although these typically sacrifice molecular detail as well as distinction between different levels or modes of activity. However, the modeling community still lacks methods that can simulate genome scale networks on the level of biochemical reaction detail in a quantitative or semi quantitative manner.ResultsHere, we present a probabilistic bipartite Boolean modeling method that addresses these issues. The method is based on the reaction-contingency formalism, and enables fast simulation of large networks. We demonstrate its scalability by applying it to the yeast mitogen-activated protein kinase (MAPK) network consisting of 140 proteins and 608 nodes.ConclusionThe probabilistic Boolean model can be generated and parameterized automatically from a rxncon network description, using only two global parameters, and its qualitative behavior is robust against order of magnitude variation in these parameters. Our method can hence be used to simulate the outcome of large signal transduction network reconstruction, with little or no overhead in model creation or parameterization.

Highlights

  • Cellular decision-making is governed by molecular networks that are highly complex

  • With a recently presented bipartite Boolean model export, the resulting models can be simulated over time in a Boolean fashion [13]. We extend this bipartite Boolean modeling formalism with probabilistic model export and simulation, as used in Probabilistic Boolean networks (PBN) [14]

  • In the Methods section, we introduced the concept of probabilistic simulation of a rxncon-derived Boolean network and assigned probabilities to execute reactions according to their rules or to contradict them

Read more

Summary

Introduction

Cellular decision-making is governed by molecular networks that are highly complex. An integrative understanding of these networks on a genome wide level is essential to understand cellular health and disease. Mathematical modeling of cellular regulatory networks is a challenge due to two opposite requirements: the aim to describe the biological complexity in all necessary detail and the need for simplicity that makes model analysis and simulation feasible. Many signaling pathways and regulatory networks have been described with sets of ordinary differential equations (ODE) These models enable a representation of their general wiring and of the kinetics of individual reactions, and. On the contrary, are suitable to model larger networks because they simplify the potential values to binary ON or OFF, representing the activity or presence of compounds This simplification enables us to describe and to analyze the dynamics of rather large networks, but neglects intermediate values, which may be of biological relevance

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call