Computation of immediate neighbours of monotone Boolean functions
From MaRDI portal
Cites work
- A computation of the ninth Dedekind number
- An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
- Counting inequivalent monotone Boolean functions.
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- scientific article; zbMATH DE number 5852793 (Why is no real title available?)
- scientific article; zbMATH DE number 6006014 (Why is no real title available?)
- Lattice structures that parameterize regulatory network dynamics
- Mapping multivalued onto Boolean dynamics
- ModRev -- model revision tool for Boolean logical models of biological regulatory networks
- Monotone Boolean functions
- Non-deterministic updates of Boolean networks
- Number of fixed points and disjoint cycles in monotone Boolean networks
- On limit cycles of monotone functions with symmetric connection graph
- On logical bifurcation diagrams
- The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
This page was built for publication: Computation of immediate neighbours of monotone Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7290102)