A Methodology for Evaluating the Extensibility of Boolean Networks’ Structure and Function - Université d'Évry Access content directly
Conference Papers Year : 2020

A Methodology for Evaluating the Extensibility of Boolean Networks’ Structure and Function

Abstract

Formal interaction networks are well suited for representing complex biological systems and have been used to model signalling pathways, gene regulatory networks, interaction within ecosystems, etc. In this paper, we introduce Sign Boolean Networks (SBNs), which are a uniform variant of Threshold Boolean Networks (TBFs). We continue the study of the complexity of SBNs and build a new framework for evaluating their ability to extend, i.e. the potential to gain new functions by addition of nodes, while also maintaining the original functions. We describe our software implementation of this framework and show some first results. These results seem to confirm the conjecture that networks of moderate complexity are the most able to grow, because they are not too simple, but also not too constrained, like the highly complex ones.
Fichier principal
Vignette du fichier
Segretain2021.pdf (414.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03168800 , version 1 (07-09-2022)

Licence

Attribution - NonCommercial

Identifiers

Cite

Rémi Segretain, Sergiu Ivanov, Laurent Trilling, Nicolas Glade. A Methodology for Evaluating the Extensibility of Boolean Networks’ Structure and Function. 9th International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2020), Dec 2020, Madrid, Spain. pp.372-385, ⟨10.1007/978-3-030-65351-4_30⟩. ⟨hal-03168800⟩
1222 View
35 Download

Altmetric

Share

Gmail Facebook X LinkedIn More