Minimum complexity drives regulatory logic in Boolean models of living systems

The properties of random Boolean networks have been investigated extensively as models of regulation in biological systems. However, the Boolean functions (BFs) specifying the associated logical update rules should not be expected to be random. In this contribution, we focus on biologically meaningf...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	PNAS nexus Ročník 1; číslo 1; s. pgac017
Hlavní autori:	Subbaroyan, Ajay, Martin, Olivier C, Samal, Areejit
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	England Oxford University Press 01.03.2022
Predmet:	Algebra, Boolean Bias Biological complexity Boolean Boolean functions Complexity Logic Mathematical logic Physical Sciences and Engineering Sensitivity India New York Boolean complexity gene regulatory networks update rules average sensitivity Boolean networks
ISSN:	2752-6542, 2752-6542
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!