# Erratum: The combination of the functionalities of feedback circuits is determinant for the attractors' number and size in pathway-like Boolean networks (vol 7, 42023, 2017)

Eugenio Azpeitia, Stalin Munoz, Daniel Gonzalez-Tokman, Mariana Esther Martinez-Sanchez, Nathan Weinstein, Aurélien Naldi, Elena R. Alvarez-Buylla, David A. Rosenblueth, Luis Mendoza

► To cite this version:

Eugenio Azpeitia, Stalin Munoz, Daniel Gonzalez-Tokman, Mariana Esther Martinez-Sanchez, Nathan Weinstein, et al.. Erratum: The combination of the functionalities of feedback circuits is determinant for the attractors' number and size in pathway-like Boolean networks (vol 7, 42023, 2017). Scientific Reports, 2017, 7, pp.1. 10.1038/srep44964. hal-01604935

HAL Id: hal-01604935

https://hal.science/hal-01604935

Submitted on 25 May 2020

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
OPEN

**Erratum:** The combination of the functionalities of feedback circuits is determinant for the attractors' number and size in pathway-like Boolean networks

Eugenio Azpeitia, Stalin Muñoz, Daniel González-Tokman, Mariana Esther Martínez-Sánchez, Nathan Weinstein, Aurélien Naldi, Elena R. Álvarez-Buylla, David A. Rosenblueth & Luis Mendoza

Scientific Reports 7:42023; doi: 10.1038/srep42023; published online 10 February 2017; updated on 22 March 2017

This Article contains typographical errors.

In the methods section under subheading 'Boolean networks', "In Boolean networks, variables can only take one of two possible values, 0 or 1, and their dynamics is described by

$$x_i(t + 1) = f_1(x_1(t), \dots, x_n(t)), \qquad (1)$$

where $x_i(t+1)$ represents the value of variable i at the time $t+1$ as a Boolean function $f_i$ of its n regulators $x_i(t)$, ..., $x_n(t)$ at the current time".

should read:

"In Boolean networks, variables can only take one of two possible values, 0 or 1, and their dynamics is described by

$$x_i(t + 1) = f_1(x_1(t), \dots, x_n(t)), \qquad (1)$$

where $x_i(t+1)$ represents the value of variable i at the time $t+1$ as a Boolean function $f_i$ of its n regulators $x_i(t)$, ..., $x_n(t)$ at the current time".

In the Results section under subheading 'Non-hierarchical and non-unidirectional interactions greatly increases the dynamical diversity of pathways',

"Because the inputs follow the identity function, the minimum number of attractors is equal to $2^{|inputs|}$, where *inputs* is the set of inputs".

should read:

"Because the inputs follow the identity function, the minimum number of attractors is equal to $2^{|inputs|}$ where *inputs* is the set of inputs".
<figure><img src="image_2.png" /></figure>

This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

© The Author(s) 2017