Parallel One-Step Control of Parametrised Boolean Networks
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F21%3A00121201" target="_blank" >RIV/00216224:14330/21:00121201 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.3390/math9050560" target="_blank" >https://doi.org/10.3390/math9050560</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/math9050560" target="_blank" >10.3390/math9050560</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Parallel One-Step Control of Parametrised Boolean Networks
Popis výsledku v původním jazyce
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 naive 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.
Název v anglickém jazyce
Parallel One-Step Control of Parametrised Boolean Networks
Popis výsledku anglicky
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 naive 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.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2021
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Mathematics
ISSN
2227-7390
e-ISSN
2227-7390
Svazek periodika
9
Číslo periodika v rámci svazku
5
Stát vydavatele periodika
CH - Švýcarská konfederace
Počet stran výsledku
16
Strana od-do
1-16
Kód UT WoS článku
000628353300001
EID výsledku v databázi Scopus
2-s2.0-85102946242