Attractor identification in asynchronous Boolean dynamics with network reduction

DOI10.1007/978-3-031-42697-1_14arXiv2305.01327MaRDI QIDQ6199827

Loïc Paulevé, Elisa Tonello

Publication date: 28 February 2024

Published in: Computational Methods in Systems Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.01327

zbMATH Keywords

attractorsreductionBoolean networkstrap spaces

Mathematics Subject Classification ID

Systems biology, networks (92C42)

Cites Work

• Dynamically consistent reduction of logical regulatory graphs
• Computing bottom SCCs symbolically using transition guided reduction
• Attractor analysis of asynchronous Boolean models of signal transduction networks
• Reduction of Boolean network models
• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
• Attractor separation and signed cycles in asynchronous Boolean networks
• An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks
• A Reduction Method for Boolean Network Models Proven to Conserve Attractors