Next Article in Journal
Global Persistence of the Unit Eigenvectors of Perturbed Eigenvalue Problems in Hilbert Spaces: The Odd Multiplicity Case
Next Article in Special Issue
Lac Operon Boolean Models: Dynamical Robustness and Alternative Improvements
Previous Article in Journal
Analysis of a k-Stage Bulk Service Queuing System with Accessible Batches for Service
Previous Article in Special Issue
Coexistence of Periods in Parallel and Sequential Boolean Graph Dynamical Systems over Directed Graphs
Article

Parallel One-Step Control of Parametrised Boolean Networks

Faculty of Informatics, Masaryk University, 60200 Brno, Czech Republic
*
Author to whom correspondence should be addressed.
Academic Editor: J. Alberto Conejero
Mathematics 2021, 9(5), 560; https://doi.org/10.3390/math9050560
Received: 30 January 2021 / Revised: 21 February 2021 / Accepted: 26 February 2021 / Published: 6 March 2021
(This article belongs to the Special Issue Boolean Networks Models in Science and Engineering)
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 capture the behavior of a biological system into a set of Boolean functions. These issues can be dealt with to some extent using parametrised Boolean networks (ParBNs), as this model allows leaving some update functions unspecified. In our work, we attack the control problem for ParBNs with asynchronous semantics. While there is an extensive work on controlling BNs without parameters, the problem of control for ParBNs has not been in fact addressed yet. The goal of control is to ensure the stabilisation of a system in a given state using as few interventions as possible. There are many ways to control BN dynamics. Here, we consider the one-step approach in which the system is instantaneously perturbed out of its actual state. A naïve approach to handle control of ParBNs is using parameter scan and solve the control problem for each parameter valuation separately using known techniques for non-parametrised BNs. This approach is however highly inefficient as the parameter space of ParBNs grows doubly exponentially in the worst case. We propose a novel semi-symbolic algorithm for the one-step control problem of ParBNs, that builds on symbolic data structures to avoid scanning individual parameters. We evaluate the performance of our approach on real biological models. View Full-Text
Keywords: boolean networks; parameters; control; reprogramming; attractors; perturbations boolean networks; parameters; control; reprogramming; attractors; perturbations
Show Figures

Figure 1

MDPI and ACS Style

Brim, L.; Pastva, S.; Šafránek, D.; Šmijáková, E. Parallel One-Step Control of Parametrised Boolean Networks. Mathematics 2021, 9, 560. https://doi.org/10.3390/math9050560

AMA Style

Brim L, Pastva S, Šafránek D, Šmijáková E. Parallel One-Step Control of Parametrised Boolean Networks. Mathematics. 2021; 9(5):560. https://doi.org/10.3390/math9050560

Chicago/Turabian Style

Brim, Luboš, Samuel Pastva, David Šafránek, and Eva Šmijáková. 2021. "Parallel One-Step Control of Parametrised Boolean Networks" Mathematics 9, no. 5: 560. https://doi.org/10.3390/math9050560

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop