Javascript must be enabled to continue!
Fixed points and multistability in monotone Boolean network models
View through CrossRef
Abstract
Gene regulatory networks (GRN) control the expression levels of proteins in cells, and understanding their dynamics is key to potentially controlling disease processes. Steady states of GRNs are interpreted as cellular phenotypes, and the first step in understanding GRN dynamics is describing the collection of steady states the network can support in different conditions. We consider a collection of all monotone Boolean function models compatible with a given GRN, and ask which steady states are supported by most models. We find that for networks with no negative loops, there is an explicit hierarchy in the prevalence of individual steady states, as well as the prevalence of bistability and multistability. The key insight that we use is that monotone Boolean models supporting a given equilibrium are a product of prime ideals and prime filters of the lattices of monotone Boolean functions. To illustrate our result, we show that in the EMT network associated with cancer metastasis, the most common equilibria correspond to epithelial (E) and mesenchymal (M) states, and the bistability between them is the most common bistability among all network-compatible monotone Boolean models.
Author summary
Cells adjust their behavior in response to external inputs via networks of genes that regulate each other’s expression, until they arrive at a new steady state. Each interacting network of genes can behave in different ways that depend on internal and external cellular conditions. In this paper we consider, for a given network, an entire collection of particular type of models (monotone Boolean models) that represent all different ways that network can behave. Then, for any given state a network can potentially be in, we describe all monotone Boolean models that have that state as a steady state. We consider those states that are supported by more models to more likely represent the states that the network will be in. We apply our approach to EMT network that is important in cancer metastasis. We show that the most common steady states are those correspond to epithelial and mesenchymal states, and that the bistability between these two states is the most common bistability. This confirms the experimental results that these are the most common states of the EMT network.
Title: Fixed points and multistability in monotone Boolean network models
Description:
Abstract
Gene regulatory networks (GRN) control the expression levels of proteins in cells, and understanding their dynamics is key to potentially controlling disease processes.
Steady states of GRNs are interpreted as cellular phenotypes, and the first step in understanding GRN dynamics is describing the collection of steady states the network can support in different conditions.
We consider a collection of all monotone Boolean function models compatible with a given GRN, and ask which steady states are supported by most models.
We find that for networks with no negative loops, there is an explicit hierarchy in the prevalence of individual steady states, as well as the prevalence of bistability and multistability.
The key insight that we use is that monotone Boolean models supporting a given equilibrium are a product of prime ideals and prime filters of the lattices of monotone Boolean functions.
To illustrate our result, we show that in the EMT network associated with cancer metastasis, the most common equilibria correspond to epithelial (E) and mesenchymal (M) states, and the bistability between them is the most common bistability among all network-compatible monotone Boolean models.
Author summary
Cells adjust their behavior in response to external inputs via networks of genes that regulate each other’s expression, until they arrive at a new steady state.
Each interacting network of genes can behave in different ways that depend on internal and external cellular conditions.
In this paper we consider, for a given network, an entire collection of particular type of models (monotone Boolean models) that represent all different ways that network can behave.
Then, for any given state a network can potentially be in, we describe all monotone Boolean models that have that state as a steady state.
We consider those states that are supported by more models to more likely represent the states that the network will be in.
We apply our approach to EMT network that is important in cancer metastasis.
We show that the most common steady states are those correspond to epithelial and mesenchymal states, and that the bistability between these two states is the most common bistability.
This confirms the experimental results that these are the most common states of the EMT network.
Related Results
Some Contributions to Boolean like near Rings
Some Contributions to Boolean like near Rings
In this paper we extend Foster’s Boolean-like ring to Near-rings. We introduce the concept of a Boolean like near-ring. A near-ring N is said to be a Boolean-like near-ring if the...
Associated Statistical Parameters’ Aggregations in Interactive MADM
Associated Statistical Parameters’ Aggregations in Interactive MADM
From recent studies, the concept of “monotone expectation” (ME) of Interactive Multi-Attribute Decision Making (MADM) is well known, which was developed for the case of different f...
Boolean Functions with Affine Annihilators
Boolean Functions with Affine Annihilators
In the article we study boolean functions with affine annihilators. We have obtained results in both, estimating the number of functions under study and defining the relationship b...
Indeterminacy of Boolean Ring
Indeterminacy of Boolean Ring
Background A neutrosophic ring represents an algebraic generalization of the classical ring structure by introducing an indeterminacy element I , enabling the modeling of truth, fa...
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudo-Boolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
A Note on Boolean Like Algebras
A Note on Boolean Like Algebras
In this paper we develop on abstract system: viz Boolean-like algebra and prove that every Boolean algebra is a Boolean-like algebra. A necessary and sufficient condition for a B...
The Number of Monotone and Self-Dual Boolean Functions
The Number of Monotone and Self-Dual Boolean Functions
Abstract
In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbrevia...
Construction and Local Routing for Angle-Monotone Graphs
Construction and Local Routing for Angle-Monotone Graphs
A geometric graph in the plane is angle-monotone of width $\gamma$ if every pair of vertices is connected by an angle-monotone path of width $\gamma$, a path such that the angles o...

