Multistate nested canalizing functions and their networks
From MaRDI portal
Publication:528485
Abstract: This paper provides a collection of mathematical and computational tools for the study of robustness in nonlinear gene regulatory networks, represented by time- and state-discrete dynamical systems taking on multiple states. The focus is on networks governed by nested canalizing functions (NCFs), first introduced in the Boolean context by S. Kauffman. After giving a general definition of NCFs we analyze the class of such functions. We derive a formula for the normalized average -sensitivities of multistate NCFs, which enables the calculation of the Derrida plot, a popular measure of network stability. We also provide a unique canonical parametrized polynomial form of NCFs. This form has several consequences. We can easily generate NCFs for varying parameter choices, and derive a closed form formula for the number of such functions in a given number of variables, as well as an asymptotic formula. Finally, we compute the number of equivalence classes of NCFs under permutation of variables. Together, the results of the paper represent a useful mathematical framework for the study of NCFs and their dynamic networks.
Recommendations
Cites work
- Algebraic Models and Their Use in Systems Biology
- Boolean nested canalizing functions: a comprehensive analysis
- Canalization and symmetry in Boolean models for genetic regulatory networks
- Complex networks: structure and dynamics
- Exploring complex networks
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 1774199 (Why is no real title available?)
- Maximal sensitivity of Boolean nested canalizing functions
- Nested canalyzing depth and network stability
- Nested canalyzing, unate cascade, and polynomial functions
- Regulatory patterns in molecular interaction networks
- Stratification and enumeration of Boolean functions by canalizing depth
- The influence of canalization on the robustness of Boolean networks
- The number and probability of canalizing functions
- The number of multistate nested canalyzing functions
Cited in
(15)- A characterization of nested canalyzing functions with maximum average sensitivity
- The influence of canalization on the robustness of Boolean networks
- Revealing the canalizing structure of Boolean functions: algorithms and applications
- Maximal sensitivity of Boolean nested canalizing functions
- Stratification and enumeration of Boolean functions by canalizing depth
- Nested canalyzing, unate cascade, and polynomial functions
- Quantifying the total effect of edge interventions in discrete multistate networks
- Collectively canalizing Boolean functions
- Boolean nested canalizing functions: a comprehensive analysis
- Nested canalyzing depth and network stability
- The number of multistate nested canalyzing functions
- Certificate complexity and symmetry of nested canalizing functions
- From multivalued to Boolean functions: preservation of soft nested canalization
- Average sensitivity of nested canalizing multivalued functions
- Verification, enumeration and generation of multistate canalizing functions
This page was built for publication: Multistate nested canalizing functions and their networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528485)