Boolean nested canalizing functions: a comprehensive analysis
From MaRDI portal
Publication:385051
DOI10.1016/j.tcs.2013.02.020zbMath1291.92068arXiv1204.5203MaRDI 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
activity; dynamical system; Boolean function; Hamming weight; average sensitivity; multinomial coefficient; extended monomial; layer number; nested canalizing function
Related Items
Algebraic Models and Their Use in Systems Biology, Certificate complexity and symmetry of nested canalizing functions, Stability of linear Boolean networks, From multivalued to Boolean functions: preservation of soft nested canalization, Average sensitivity of nested canalizing multivalued functions, Boolean nested canalizing functions: a comprehensive analysis, Multistate nested canalizing functions and their networks, A characterization of nested canalyzing functions with maximum average sensitivity, The influence of canalization on the robustness of Boolean networks, Linear read-once and related Boolean functions, Sensitivities and block sensitivities of elementary symmetric Boolean functions, Certificate complexity of elementary symmetric Boolean functions, 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, Collectively canalizing Boolean functions
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
