Preponderance of generalized chain functions in reconstructed Boolean models of biological networks.
Ontology highlight
ABSTRACT: Boolean networks (BNs) have been extensively used to model gene regulatory networks (GRNs). The dynamics of BNs depend on the network architecture and regulatory logic rules (Boolean functions (BFs)) associated with nodes. Nested canalyzing functions (NCFs) have been shown to be enriched among the BFs in the large-scale studies of reconstructed Boolean models. The central question we address here is whether that enrichment is due to certain sub-types of NCFs. We build on one sub-type of NCFs, the chain functions (or chain-0 functions) proposed by Gat-Viks and Shamir. First, we propose two other sub-types of NCFs, namely, the class of chain-1 functions and generalized chain functions, the union of the chain-0 and chain-1 types. Next, we find that the fraction of NCFs that are chain-0 (also
SUBMITTER: Mitra S
PROVIDER: S-EPMC10954731 | biostudies-literature | 2024 Mar
REPOSITORIES: biostudies-literature
ACCESS DATA