December 10, 2004
A great part of the effort in the study of coarse grained models of transcription networks is directed to the analysis of their dynamical features. In this letter, we consider the \emph{equilibrium} properties of such systems, showing that the logic backbone underlying all dynamic descriptions has the structure of a computational optimization problem. It involves variables, which correspond to gene expression levels, and constraints, which describe the effect of \emph{cis-}regulatory signal integration functions. In the simple paradigmatic case of Boolean variables and signal integration functions, we derive and discuss phase diagrams. Notably, the model exhibits a connectivity transition between a regime of simple, but uncertain, gene control, to a regime of complex combinatorial control.
Similar papers 1
February 15, 2005
Identity, response to external stimuli, and spatial architecture of a living system are central topics of molecular biology. Presently, they are largely seen as a result of the interplay between a gene repertoire and the regulatory machinery of the cell. At the transcriptional level, the cis-regulatory regions establish sets of interdependencies between transcription factors and genes, including other transcription factors. These ``transcription networks'' are too large to be...
November 13, 2008
Complex systems are often modeled as Boolean networks in attempts to capture their logical structure and reveal its dynamical consequences. Approximating the dynamics of continuous variables by discrete values and Boolean logic gates may, however, introduce dynamical possibilities that are not accessible to the original system. We show that large random networks of variables coupled through continuous transfer functions often fail to exhibit the complex dynamics of correspond...
September 26, 2021
Networks of gene regulation govern morphogenesis, determine cell identity and regulate cell function. But we have little understanding, at the local level, of which logics are biologically preferred or even permitted. To solve this puzzle, we studied the consequences of a fundamental aspect of gene regulatory networks: genes and transcription factors talk to each other but not themselves. Remarkably, this bipartite structure severely restricts the number of logical dependenci...
August 28, 2008
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in Molecular Biology, which is mostly driven by experimental research, relying on first-order or statistica...
December 17, 2003
This paper proposes a new method to reverse engineer gene regulatory networks from experimental data. The modeling framework used is time-discrete deterministic dynamical systems, with a finite set of states for each of the variables. The simplest examples of such models are Boolean networks, in which variables have only two possible states. The use of a larger number of possible states allows a finer discretization of experimental data and more than one possible mode of acti...
January 17, 2003
Cells receive a wide variety of cellular and environmental signals, which must be processed combinatorially to generate specific and timely genetic responses. We present here a theoretical study on the combinatorial control and integration of transcription signals, with the finding that cis-regulatory systems with specific protein-DNA interaction and glue-like protein-protein interactions, supplemented by distal activation or repression mechanisms, have the capability to exec...
October 16, 2008
We show how to construct a reduced description of interacting genes in noisy, small regulatory networks using coupled binary "spin" variables. Treating both the protein number and gene expression state variables stochastically and on equal footing we propose a mapping which connects the molecular level description of networks to the binary representation. We construct a phase diagram indicating when genes can be considered to be independent and when the coupling between them ...
December 5, 2005
In this paper, we analyse large random Boolean networks in terms of a constraint satisfaction problem. We first develop an algorithmic scheme which allows to prune simple logical cascades and under-determined variables, returning thereby the computational core of the network. Second we apply the cavity method to analyse number and organisation of fixed points. We find in particular a phase transition between an easy and a complex regulatory phase, the latter one being charact...
April 28, 2022
In this paper we describe a combined combinatorial/numerical approach to studying equilibria and bifurcations in network models arising in Systems Biology. ODE models of the dynamics suffer from high dimensional parameters which presents a significant obstruction to studying the global dynamics via numerical methods. The main point of this paper is to demonstrate that combining classical techniques with recently developed combinatorial methods provides a richer picture of the...
July 19, 2022
Gene regulatory networks (GRNs) perform a wide range of biological functions. It is, however, often challenging to reveal their functioning mechanism with the conventional approach focusing on the network topological structure from a bottom-up perspective. Here, we apply the top-down approach based on the optimality theory to study the information integration in morphogen systems, and show that the optimal integration strategy raises requirement on the phase diagram, rather t...