Lattice structures that parameterize regulatory network dynamics

We consider two types of models of regulatory network dynamics: Boolean maps and systems of switching ordinary differential equations. Our goal is to construct all models in each category that are compatible with the directed signed graph that describe the network interactions. This leads to conside...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematical biosciences Ročník 374; s. 109225
Hlavný autor: Gedeon, Tomáš
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: United States Elsevier Inc 01.08.2024
Predmet:
ISSN:0025-5564, 1879-3134, 1879-3134
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We consider two types of models of regulatory network dynamics: Boolean maps and systems of switching ordinary differential equations. Our goal is to construct all models in each category that are compatible with the directed signed graph that describe the network interactions. This leads to consideration of lattice of monotone Boolean functions (MBF), poset of non-degenerate MBFs, and a lattice of chains in these sets. We describe explicit inductive construction of these posets where the induction is on the number of inputs in MBF. Our results allow enumeration of potential dynamic behavior of the network for both model types, subject to practical limitation imposed by the size of the lattice of MBFs described by the Dedekind number. •Regulatory networks are modeled using both Boolean and ODE models.•There are finite ensembles of Boolean and switching ODE models compatible with network structure.•Capacity of network to support dynamics is given by its prevalence in the ensemble.•.We present iterative algorithms that construct ensembles of the network models.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0025-5564
1879-3134
1879-3134
DOI:10.1016/j.mbs.2024.109225