Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
Discrete mathematics & theoretical computer science, Tome 25 (2023-2024) no. 2.

Voir la notice de l'article provenant de la source Episciences

To simplify the analysis of Boolean networks, a reduction in the number of components is often considered. A popular reduction method consists in eliminating components that are not autoregulated, using variable substitution. In this work, we show how this method can be extended, for asynchronous dynamics of Boolean networks, to the elimination of vertices that have a negative autoregulation, and study the effects on the dynamics and interaction structure. For elimination of non-autoregulated variables, the preservation of attractors is in general guaranteed only for fixed points. Here we give sufficient conditions for the preservation of complex attractors. The removal of so called mediator nodes (i.e. vertices with indegree and outdegree one) is often considered, and frequently does not affect the attractor landscape. We clarify that this is not always the case, and in some situations even subtle changes in the interaction structure can lead to a different asymptotic behaviour. Finally, we use properties of the more general elimination method introduced here to give an alternative proof for a bound on the number of attractors of asynchronous Boolean networks in terms of the cardinality of positive feedback vertex sets of the interaction graph.
DOI : 10.46298/dmtcs.10930
Classification : 05C20, 90B10
@article{DMTCS_2024_25_2_a25,
     author = {Schwieger, Robert and Tonello, Elisa},
     title = {Reduction for asynchronous {Boolean} networks: elimination of negatively autoregulated components},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2023-2024},
     doi = {10.46298/dmtcs.10930},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10930/}
}
TY  - JOUR
AU  - Schwieger, Robert
AU  - Tonello, Elisa
TI  - Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
JO  - Discrete mathematics & theoretical computer science
PY  - 2023-2024
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10930/
DO  - 10.46298/dmtcs.10930
LA  - en
ID  - DMTCS_2024_25_2_a25
ER  - 
%0 Journal Article
%A Schwieger, Robert
%A Tonello, Elisa
%T Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
%J Discrete mathematics & theoretical computer science
%D 2023-2024
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10930/
%R 10.46298/dmtcs.10930
%G en
%F DMTCS_2024_25_2_a25
Schwieger, Robert; Tonello, Elisa. Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components. Discrete mathematics & theoretical computer science, Tome 25 (2023-2024) no. 2. doi : 10.46298/dmtcs.10930. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.10930/

Cité par Sources :