[HTML][HTML] Attractor detection and enumeration algorithms for Boolean networks

T Mori, T Akutsu - Computational and Structural Biotechnology Journal, 2022 - Elsevier
The Boolean network (BN) is a mathematical model used to represent various biological
processes such as gene regulatory networks. The state of a BN is determined from the …

AEON. py: Python library for attractor analysis in asynchronous Boolean networks

N Beneš, L Brim, O Huvar, S Pastva, D Šafránek… - …, 2022 - academic.oup.com
AEON. py is a Python library for the analysis of the long-term behaviour in very large
asynchronous Boolean networks. It provides significant computational improvements over …

Computing attractors of large-scale asynchronous Boolean networks using minimal trap spaces

VG Trinh, K Hiraishi, B Benhamou - Proceedings of the 13th ACM …, 2022 - dl.acm.org
Boolean Networks (BNs) play a crucial role in modeling, analyzing, and controlling
biological systems. One of the most important problems on BNs is to compute all the …

Repository of logically consistent real-world Boolean network models

S Pastva, D Šafránek, N Beneš, L Brim, T Henzinger - bioRxiv, 2023 - biorxiv.org
Recent developments in both computational analysis and data-driven synthesis enable a
new era of automated reasoning with logical models (Boolean networks in particular) in …

[HTML][HTML] Unlocking mitochondrial dysfunction-associated senescence (MiDAS) with NAD+–A Boolean model of mitochondrial dynamics and cell cycle control

H Sizek, D Deritei, K Fleig, M Harris, PL Regan… - Translational …, 2024 - Elsevier
The steady accumulation of senescent cells with aging creates tissue environments that aid
cancer evolution. Aging cell states are highly heterogeneous.'Deep senescent'cells rely on …

Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming

G Trinh, B Benhamou, S Pastva… - Proceedings of the AAAI …, 2024 - ojs.aaai.org
Boolean Networks (BNs) are widely used as a modeling formalism in several domains,
notably systems biology and computer science. A fundamental problem in BN analysis is the …

Attractor identification in asynchronous Boolean dynamics with network reduction

E Tonello, L Paulevé - … Conference on Computational Methods in Systems …, 2023 - Springer
Identification of attractors, that is, stable states and sustained oscillations, is an important
step in the analysis of Boolean models and exploration of potential variants. We describe an …

An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?

S Pastva, KH Park, O Huvar, JC Rozum… - arXiv preprint arXiv …, 2024 - arxiv.org
Asynchronous Boolean networks are a type of discrete dynamical system in which each
variable can take one of two states, and a single variable state is updated in each time step …

Fast Symbolic Computation of Bottom SCCs

AB Jakobsen, RSM Jørgensen, J van de Pol… - … Conference on Tools …, 2024 - Springer
The computation of bottom strongly connected components (BSCCs) is a fundamental task
in model checking, as well as in characterizing the attractors of dynamical systems. As such …

A truly symbolic linear-time algorithm for SCC decomposition

CA Larsen, SM Schmidt, J Steensgaard… - … Conference on Tools …, 2023 - Springer
Decomposing a directed graph to its strongly connected components (SCCs) is a
fundamental task in model checking. To deal with the state-space explosion problem …