Corpus ID: 51904365

Representing Model Ensembles as Boolean Functions

  title={Representing Model Ensembles as Boolean Functions},
  author={Robert Schwieger and Heike Siebert},
  journal={arXiv: Molecular Networks},
Families of ODE models characterized by a common sign structure of their Jacobi matrix are investigated within the formalism of qualitative differential equations. In the context of regulatory networks the sign structure of the Jacobi matrix carries the information about which components of the network inhibit or activate each other. Information about constraints on the behavior of models in this family is stored in a so called qualitative state transition graph. We showed previously that a… Expand

Figures from this paper

Combining Boolean Networks and Ordinary Differential Equations for Analysis and Comparison of Gene Regulatory Networks
This disputation talk will present and compare different automated reduction methods for Boolean models and discuss what dynamical properties of the original models are conserved during the reduction, and focus on different types of attractors and conditions for their conservation. Expand


Graph Representations of Monotonic Boolean Model Pools
This work presents an approach to analyze sets of monotonic Boolean models consistent with given signed interactions between systems components and shows that for each such model constraints on its behavior can be derived from a universally constructed state transition graph essentially capturing possible sign changes of the derivative. Expand
Approximating Attractors of Boolean Networks by Iterative CTL Model Checking
In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks. Expand
Transforming Boolean models to continuous models: methodology and application to T-cell receptor signaling
This work presents a canonical way of transforming Boolean into continuous models, where the use of multivariate polynomial interpolation allows transformation of logic operations into a system of ordinary differential equations (ODE). Expand
Computing maximal and minimal trap spaces of Boolean networks
A novel optimization-based method for computing all minimal and maximal trap spaces and motivating their use is proposed and a new result yielding a lower bound for the number of cyclic attractors is added. Expand
Synchronous versus asynchronous modeling of gene regulatory networks
Algorithms for synchronous and asynchronous transition models have been proposed and their corresponding computational properties have been analyzed, which allow users to compute cyclic attractors of large networks that are currently not feasible using existing software. Expand
Reveal, a general reverse engineering algorithm for inference of genetic network architectures.
This study investigates the possibility of completely infer a complex regulatory network architecture from input/output patterns of its variables using binary models of genetic networks, and finds the problem to be tractable within the conditions tested so far. Expand
An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data
It is found that employing the right combination of methods for data discretization and network learning results in Boolean networks that capture the dynamics well and provide predictive power, in contrast to a recent survey that placed Boolean networks on the low end of the “faithfulness to biological reality” and “ability to model dynamics” spectra. Expand
PyBoolNet: a python package for the generation, analysis and visualization of boolean networks
PyBoolNet is a Python package for working with Boolean networks that supports simple access to model checking via NuSMV, standard graph algorithms via NetworkX and visualization via; state of the art attractor computation exploiting Potassco ASP is implemented. Expand
Principles of model checking
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field. Expand
A novel mutual information-based Boolean network inference method from time-series gene expression data
A Boolean network model with a restricted update rule scheme to capture coarse-grained dynamics, and a novel mutual information-based Boolean network inference (MIBNI) method, which is a promising tool for predicting both the structure and the dynamics of a gene regulatory network. Expand