Linear cuts in Boolean networks

DOI10.1007/s11047-023-09945-2MaRDI QIDQ6535748

Adrien Richard, Aurélien Naldi, Elisa Tonello

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

zbMATH Keywords

attractorsreachabilityBoolean networksupdating semantics

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03) Systems biology, networks (92C42) Boolean control/observation systems (93C29)

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamically consistent reduction of logical regulatory graphs
• Petri net representation of multi-valued logical regulatory graphs
• Fixed points and connections between positive and negative cycles in Boolean networks
• Computing maximal and minimal trap spaces of Boolean networks
• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
• An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
• Static analysis of Biological Regulatory Networks dynamics using abstract interpretation
• Synchronism versus asynchronism in monotonic Boolean automata networks

Related Items (1)

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components

This page was built for publication: Linear cuts in Boolean networks