Compositional techniques for Boolean networks and attractor analysis

DOI10.1007/978-3-662-68191-6_11MaRDI QIDQ6550571zbMATH OpenFDO

Authors Hanin Abdulrahman, Jason Steggles

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/978-3-662-68191-6_11

Mathematics Subject Classification ID

Systems biology, networks (92C42) Networked control (93B70) Boolean control/observation systems (93C29)

Recommendations

• A Formal Framework for Composing Qualitative Models of Biological Systems
• Compositional analysis of Boolean networks using local fixed-point iterations
• Stability analysis of large-scale Boolean networks via compositional method
• Modular construction of Boolean networks
• Optimising attractor computation in Boolean automata networks

Cites work

• A Formal Framework for Composing Qualitative Models of Biological Systems
• A framework for (de)composing with Boolean automata networks
• A strong-connectivity algorithm and its applications in data flow analysis
• A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models
• Aggregation Algorithm Towards Large-Scale Boolean Network Analysis
• Depth-First Search and Linear Graph Algorithms
• Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
• Optimising attractor computation in Boolean automata networks
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}

Cited in

(2)

• Stability analysis of large-scale Boolean networks via compositional method
• Stability analysis of compositional Boolean networks through different logical operators

This page was built for publication: Compositional techniques for Boolean networks and attractor analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550571)