Boolean nested canalizing functions: a comprehensive analysis

DOI10.1016/j.tcs.2013.02.020zbMath1291.92068arXiv1204.5203OpenAlexW2963855685MaRDI QIDQ385051

David Murrugarra, Yuan Li, Boris Aguilar, John Ola-Oluwa Adeyeye, Reinhard C. Laubenbacher

Publication date: 29 November 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.5203

zbMATH Keywords

activitydynamical systemBoolean functionHamming weightaverage sensitivitymultinomial coefficientextended monomiallayer numbernested canalizing function

Mathematics Subject Classification ID

Boolean functions (06E30) Systems biology, networks (92C42)

Related Items

A characterization of nested canalyzing functions with maximum average sensitivity, Boolean nested canalizing functions: a comprehensive analysis, The influence of canalization on the robustness of Boolean networks, Stability of linear Boolean networks, Collectively canalizing Boolean functions, From multivalued to Boolean functions: preservation of soft nested canalization, Average sensitivity of nested canalizing multivalued functions, Multistate nested canalizing functions and their networks, Maximal sensitivity of Boolean nested canalizing functions, Linear read-once and related Boolean functions, Sensitivities and block sensitivities of elementary symmetric Boolean functions, Algebraic Models and Their Use in Systems Biology, Certificate complexity of elementary symmetric Boolean functions, Revealing the canalizing structure of Boolean functions: algorithms and applications, Certificate complexity and symmetry of nested canalizing functions, Stratification and enumeration of Boolean functions by canalizing depth

Cites Work

• Unnamed Item
• The average sensitivity of bounded-depth circuits
• Boolean nested canalizing functions: a comprehensive analysis
• On the average sensitivity of the weighted sum function
• Nested canalyzing depth and network stability
• The number of multistate nested canalyzing functions
• Sensitivity vs. block sensitivity (an average-case study)
• Linear transformations of monotone functions on the discrete cube
• Harmonic analysis and Boolean function complexity
• Regulatory patterns in molecular interaction networks
• The number and probability of canalizing functions
• Sensitivity versus block sensitivity of Boolean functions
• Bounds on the Fourier coefficients of the weighted sum function
• Nested canalyzing, unate cascade, and polynomial functions
• AND-NOT logic framework for steady state analysis of Boolean network models
• On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Asymptotic Approximations for the Number of Fanout-Free Functions
• On the Number of Fanout-Free Functions and Unate Cascade Functions