Revealing the canalizing structure of Boolean functions: algorithms and applications
From MaRDI portal
Publication:2097792
DOI10.1016/j.automatica.2022.110630OpenAlexW3171909902MaRDI QIDQ2097792
Claus Kadelka, David Murrugarra, Brandilyn Stigler, Elena S. Dimitrova
Publication date: 14 November 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.06580
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Regulatory patterns in molecular interaction networks
- 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
- On the Number of Fanout-Free Functions and Unate Cascade Functions
- The Problem of Simplifying Truth Functions
This page was built for publication: Revealing the canalizing structure of Boolean functions: algorithms and applications