Linear cuts in Boolean networks

DOI10.1007/S11047-023-09945-2MaRDI QIDQ6535748zbMATH OpenFDO

Authors A. Naldi, Adrien Richard, Elisa Tonello

Publication date 9 February 2024

Published in Natural Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11047-023-09945-2

zbMATH Keywords

attractorsBoolean networksreachabilityupdating semantics

Mathematics Subject Classification ID

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

Cites work

• An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
• Computing maximal and minimal trap spaces of Boolean networks
• Dynamically consistent reduction of logical regulatory graphs
• Fixed points and connections between positive and negative cycles in Boolean networks
• scientific article; zbMATH DE number 4042465 (Why is no real title available?)
• scientific article; zbMATH DE number 2144779 (Why is no real title available?)
• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
• Petri net representation of multi-valued logical regulatory graphs
• Static analysis of biological regulatory networks dynamics using abstract interpretation
• Synchronism versus asynchronism in monotonic Boolean automata networks

Cited in

(4)

• Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
• A semantics for Boolean networks consistent with regulatory threshold constraints
• Bringing memory to Boolean networks: a unifying framework
• An open problem: why are motif-avoidant attractors so rare in asynchronous Boolean networks?

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

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