Collectively canalizing Boolean functions
From MaRDI portal
Publication:2687272
DOI10.1016/j.aam.2022.102475OpenAlexW3081795074MaRDI QIDQ2687272
Reinhard C. Laubenbacher, Benjamin Keilty, Claus Kadelka
Publication date: 1 March 2023
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.13741
Related Items (1)
Cites Work
- Unnamed Item
- The average sensitivity of bounded-depth circuits
- Boolean nested canalizing functions: a comprehensive analysis
- Nested canalyzing depth and network stability
- The number of multistate nested canalyzing functions
- Multistate nested canalizing functions and their networks
- The influence of canalization on the robustness of Boolean networks
- The number and probability of canalizing functions
- Revealing the canalizing structure of Boolean functions: algorithms and applications
- A computational algebra approach to the reverse engineering of gene regulatory networks
- The dynamics of canalizing Boolean networks
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Stratification and enumeration of Boolean functions by canalizing depth
- Canalization and symmetry in Boolean models for genetic regulatory networks
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- CREW PRAM<scp>s</scp> and Decision Trees
This page was built for publication: Collectively canalizing Boolean functions