Systems Biology has taken advantage of computational tools and high-throughput experimental data to model several biological processes. These include signaling, gene regulatory, and metabolic networks. However, most of these models are specific to each kind of network. Their interconnection demands a whole-cell modeling framework for a complete understanding of cellular systems. We describe the features required by an integrated framework for modeling, analyzing and simulating biological processes, and review several modeling formalisms that have been used in Systems Biology including Boolean networks, Bayesian networks, Petri nets, process algebras, constraint-based models, differential equations, rule-based models, interacting state machines, cellular automata, and agent-based models. We compare the features provided by different formalisms, and discuss recent approaches in the integration of these formalisms, as well as possible directions for the future.

/pdf/modeling-formalisms-in-systems-biology-2bu1tjfky4.pdf

Modeling formalisms in Systems Biology

Motivation: Logic modeling is a useful tool to study signal transduction across multiple pathways. Logic models can be generated by training a network containing the prior knowledge to phospho-proteomics data. The training can be performed using stochastic optimization procedures, but these are unable to guarantee a global optima or to report the complete family of feasible models. This, however, is essential to provide precise insight in the mechanisms underlaying signal transduction and generate reliable predictions.

Results: We propose the use of Answer Set Programming to explore exhaustively the space of feasible logic models. Toward this end, we have developed caspo, an open-source Python package that provides a powerful platform to learn and characterize logic models by leveraging the rich modeling language and solving technologies of Answer Set Programming. We illustrate the usefulness of caspo by revisiting a model of pro-growth and inflammatory pathways in liver cells. We show that, if experimental error is taken into account, there are thousands (11 700) of models compatible with the data. Despite the large number, we can extract structural features from the models, such as links that are always (or never) present or modules that appear in a mutual exclusive fashion. To further characterize this family of models, we investigate the input–output behavior of the models. We find 91 behaviors across the 11 700 models and we suggest new experiments to discriminate among them. Our results underscore the importance of characterizing in a global and exhaustive manner the family of feasible models, with important implications for experimental design.

Availability: caspo is freely available for download (license GPLv3) and as a web service at http://caspo.genouest.org/.

Supplementary information: Supplementary materials are available at Bioinformatics online.

Contact: rf.asiri@alediv.ogaitnas

/pdf/exhaustively-characterizing-feasible-logic-models-of-a-1x6o6srlxc.pdf

Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming

Petri nets are directed, weighted bipartite graphs that have successfully been applied to the systems biology of metabolic and signal transduction pathways in modeling both stochastic (discrete) and deterministic (continuous) processes Here we exemplify how molecular mechanisms, biochemical or genetic, can be consistently respresented in the form of place/transition Petri nets We then describe the application of Petri nets to the reconstruction of molecular and genetic networks from experimental data and their power to represent biological processes with arbitrary degree of resolution of the subprocesses at the cellular and the molecular level Petri nets are executable formal language models that permit the unambiguous visualization of regulatory mechanisms, and they can be used to encode the results of mathematical algorithms for the reconstruction of causal interaction networks from experimental time series data

Petri nets as a framework for the reconstruction and analysis of signal transduction pathways and regulatory networks

Motivation: Distinguishing direct from indirect influences is a central issue in reverse engineering of biological networks because it facilitates detection and removal of false positive edges. Transitive reduction is one approach for eliminating edges reflecting indirect effects but its use in reconstructing cyclic interaction graphs with true redundant structures is problematic. Results: We present TRANSWESD, an elaborated variant of TRANSitive reduction for WEighted Signed Digraphs that overcomes conceptual problems of existing versions. Major changes and improvements concern: (i) new statistical approaches for generating high-quality perturbation graphs from systematic perturbation experiments; (ii) the use of edge weights (association strengths) for recognizing true redundant structures; (iii) causal interpretation of cycles; (iv) relaxed definition of transitive reduction; and (v) approximation algorithms for large networks. Using standardized benchmark tests, we demonstrate that our method outperforms existing variants of transitive reduction and is, despite its conceptual simplicity, highly competitive with other reverse engineering methods. Contact: klamt@mpi-magdeburg.mpg.de

/pdf/transwesd-inferring-cellular-networks-with-transitive-2nvqyn1tt0.pdf

TRANSWESD: inferring cellular networks with transitive reduction

/pdf/colored-petri-nets-for-systems-biology-op188zkbxn.pdf

Colored Petri Nets for Systems Biology

Network inference methods reconstruct mathematical models of molecular or genetic networks directly from experimental data sets. We have previously reported a mathematical method which is exclusively data-driven, does not involve any heuristic decisions within the reconstruction process, and deliveres all possible alternative minimal networks in terms of simple place/transition Petri nets that are consistent with a given discrete time series data set. We fundamentally extended the previously published algorithm to consider catalysis and inhibition of the reactions that occur in the underlying network. The results of the reconstruction algorithm are encoded in the form of an extended Petri net involving control arcs. This allows the consideration of processes involving mass flow and/or regulatory interactions. As a non-trivial test case, the phosphate regulatory network of enterobacteria was reconstructed using in silico-generated time-series data sets on wild-type and in silico mutants. The new exact algorithm reconstructs extended Petri nets from time series data sets by finding all alternative minimal networks that are consistent with the data. It suggested alternative molecular mechanisms for certain reactions in the network. The algorithm is useful to combine data from wild-type and mutant cells and may potentially integrate physiological, biochemical, pharmacological, and genetic data in the form of a single model.

/pdf/reconstruction-of-extended-petri-nets-from-time-series-data-3i2papz92k.pdf

Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks.

We apply a mathematical algorithm which processes discrete time series data to generate a complete list of Petri net structures containing the minimal number of nodes required to reproduce the data set. The completeness of the list as guaranteed by a mathematical proof allows to define a minimal set of experiments required to discriminate between alternative network structures. This in principle allows to prove all possible minimal network structures by disproving all alternative candidate structures. The dynamic behaviour of the networks in terms of a switching rule for the transitions of the Petri net is part of the result. In addition to network reconstruction, the algorithm can be used to determine how many yet undetected components at least must be involved in a certain process. The algorithm also reveals all alternative structural modifications of a network that are required to generate a predefined behaviour.

Automatic reconstruction of molecular and genetic networks from discrete time series data.

The aim of this work is to extend a previously presented algorithm (Durzinsky et al. 2008b in Computational methods in systems biology, LNCS, vol 5307. Springer, Heidelberg, pp 328–346; Marwan et al. 2008 in Math Methods Oper Res 67:117–132) for the reconstruction of standard place/transition Petri nets from time-series of experimental data sets. This previously reported method finds provably all networks capable to reproduce the experimental observations. In this paper we enhance this approach to generate extended Petri nets involving mechanisms formally corresponding to catalytic or inhibitory dependencies that mediate the involved reactions. The new algorithm delivers the set of all extended Petri nets being consistent with the time-series data used for reconstruction. It is illustrated using the phosphate regulatory network of enterobacteria as a case study.

Reconstruction of extended Petri nets from time-series data by using logical control functions

Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarative and thus transparent for biological experts. Second, it is elaboration tolerant and thus allows for an easy exploration and incorporation of biological constraints. Third, it allows for exploring the entire space of possible models. Finally, our approach offers an excellent performance, matching existing, special-purpose systems.

/pdf/automatic-network-reconstruction-using-asp-24ckfvz7al.pdf

Automatic network reconstruction using ASP

For many aspects of health and disease, it is important to understand different phenomena in biology and medicine To gain the required insight, experimental data are provided and need to be interpreted, thus the challenging task is to generate all models that explain the observed phenomena In systems biology the framework of Petri nets is often used to describe models for the regulatory mechanisms of biological systems The aim of this paper is to present an exact combinatorial approach for the reconstruction of such models from experimental data

Markus Durzinsky

Papers

Reconstruction of extended Petri nets from time series data and its application to signal transduction and to gene regulatory networks.

Automatic reconstruction of molecular and genetic networks from discrete time series data.

Reconstruction of extended Petri nets from time-series data by using logical control functions

Automatic network reconstruction using ASP

A Combinatorial Approach to Reconstruct Petri Nets from Experimental Data