Unfolding of Parametric Boolean Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F18%3A00100911" target="_blank" >RIV/00216224:14330/18:00100911 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.entcs.2018.03.009" target="_blank" >http://dx.doi.org/10.1016/j.entcs.2018.03.009</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.entcs.2018.03.009" target="_blank" >10.1016/j.entcs.2018.03.009</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Unfolding of Parametric Boolean Networks

Popis výsledku v původním jazyce

In systems biology, models of cellular regulatory processes such as gene regulatory networks or signalling pathways are crucial to understanding the behaviour of living cells. Available biological data are however often insufficient for full model specification. In this paper, we focus on partially specified models where the missing information is abstracted in the form of parameters. We introduce a novel approach to analysis of parametric logical regulatory networks addressing both sources of combinatoric explosion native to the model. First, we introduce a new compact representation of admissible parameters using Boolean lattices. Then, we define the unfolding of parametric Boolean networks. The resulting structure provides a partial-order reduction of concurrent transitions, and factorises the common transitions among the concrete models. A comparison is performed against state-of-the-art approaches to parametric model analysis

Název v anglickém jazyce

Unfolding of Parametric Boolean Networks

Popis výsledku anglicky

In systems biology, models of cellular regulatory processes such as gene regulatory networks or signalling pathways are crucial to understanding the behaviour of living cells. Available biological data are however often insufficient for full model specification. In this paper, we focus on partially specified models where the missing information is abstracted in the form of parameters. We introduce a novel approach to analysis of parametric logical regulatory networks addressing both sources of combinatoric explosion native to the model. First, we introduce a new compact representation of admissible parameters using Boolean lattices. Then, we define the unfolding of parametric Boolean networks. The resulting structure provides a partial-order reduction of concurrent transitions, and factorises the common transitions among the concrete models. A comparison is performed against state-of-the-art approaches to parametric model analysis

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA15-11089S" target="_blank" >GA15-11089S: Získávání parametrů biologických modelů pomocí techniky ověřování modelů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

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ů

Název periodika

Electronic Notes in Theoretical Computer Science

ISSN

1571-0661

e-ISSN

—

Svazek periodika

335

Číslo periodika v rámci svazku

Duben 2018

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

24

Strana od-do

67-90

Kód UT WoS článku

000430334800005

EID výsledku v databázi Scopus

2-s2.0-85045239193