Boolean network sketches: a unifying framework for logical model inference

N Beneš, L Brim, O Huvar, S Pastva, D Šafránek - Bioinformatics, 2023 - academic.oup.com
Motivation The problem of model inference is of fundamental importance to systems biology.
Logical models (eg Boolean networks; BNs) represent a computationally attractive approach …

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 …

Temporary and permanent control of partially specified Boolean networks

L Brim, S Pastva, D Šafránek, E Šmijáková - Biosystems, 2023 - Elsevier
Boolean networks (BNs) are a well-accepted modelling formalism in computational systems
biology. Nevertheless, modellers often cannot identify only a single BN that matches 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 …

BoNesis: a Python-based declarative environment for the verification, reprogramming, and synthesis of Most Permissive Boolean networks

S Chevalier, D Boyenval, G Magaña-López… - … Methods in Systems …, 2024 - Springer
BoNesis is a Python library which offers a declarative framework for the synthesis of Boolean
networks from advanced dynamical properties, such as reachability, bifurcation, minimal trap …

Computing bottom SCCs symbolically using transition guided reduction

N Beneš, L Brim, S Pastva, D Šafránek - … , CAV 2021, Virtual Event, July 20 …, 2021 - Springer
Detection of bottom strongly connected components (BSCC) in state-transition graphs is an
important problem with many applications, such as detecting recurrent states in Markov …

Phenotype Control of Partially Specified Boolean Networks

N Beneš, L Brim, S Pastva, D Šafránek… - … Methods in Systems …, 2023 - Springer
Abstract Partially specified Boolean networks (PSBNs) represent a promising framework for
the qualitative modelling of biological systems in which the logic of interactions is not …

Parallel one-step control of parametrised Boolean networks

L Brim, S Pastva, D Šafránek, E Šmijáková - Mathematics, 2021 - mdpi.com
Boolean network (BN) is a simple model widely used to study complex dynamic behaviour of
biological systems. Nonetheless, it might be difficult to gather enough data to precisely …

Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks

S Riva, JM Lagniez, GM López, L Paulevé - International Conference on …, 2023 - Springer
Minimal trap spaces (MTSs) capture subspaces in which the Boolean dynamics is trapped,
whatever the update mode. They correspond to the attractors of the most permissive mode …