Comptes Rendus
Combinatorics
Topological fixed points in Boolean networks
[Points fixes topologiques dans les réseaux booléens]
Comptes Rendus. Mathématique, Volume 348 (2010) no. 15-16, pp. 825-828.

Nous introduisons la notion de point fixe topologique dans les réseaux booléens : un point fixe d'un réseau booléen F est dit topologique s'il est un point fixe de tous les réseaux booléens ayant le même graphe d'interaction que F. Ensuite, nous caractérisons le nombre de points fixes topologiques d'un réseau booléen en fonction de la structure de son graphe d'interaction.

We introduce the notion of a topological fixed point in Boolean Networks: a fixed point of Boolean network F is said to be topologic if it is a fixed point of every Boolean network with the same interaction graph as the one of F. Then, we characterize the number of topological fixed points of a Boolean network according to the structure of its interaction graph.

Reçu le :
Accepté le :
Publié le :
DOI : 10.1016/j.crma.2010.07.014
Loïc Paulevé 1 ; Adrien Richard 2

1 IRCCyN, École centrale de Nantes, 1, rue de la Noë, 44321 Nantes, France
2 I3S, UMR 6070 CNRS & Université de Nice–Sophia Antipolis, 2000, route des Lucioles, 06903 Sophia Antipolis, France
@article{CRMATH_2010__348_15-16_825_0,
     author = {Lo{\"\i}c Paulev\'e and Adrien Richard},
     title = {Topological fixed points in {Boolean} networks},
     journal = {Comptes Rendus. Math\'ematique},
     pages = {825--828},
     publisher = {Elsevier},
     volume = {348},
     number = {15-16},
     year = {2010},
     doi = {10.1016/j.crma.2010.07.014},
     language = {en},
}
TY  - JOUR
AU  - Loïc Paulevé
AU  - Adrien Richard
TI  - Topological fixed points in Boolean networks
JO  - Comptes Rendus. Mathématique
PY  - 2010
SP  - 825
EP  - 828
VL  - 348
IS  - 15-16
PB  - Elsevier
DO  - 10.1016/j.crma.2010.07.014
LA  - en
ID  - CRMATH_2010__348_15-16_825_0
ER  - 
%0 Journal Article
%A Loïc Paulevé
%A Adrien Richard
%T Topological fixed points in Boolean networks
%J Comptes Rendus. Mathématique
%D 2010
%P 825-828
%V 348
%N 15-16
%I Elsevier
%R 10.1016/j.crma.2010.07.014
%G en
%F CRMATH_2010__348_15-16_825_0
Loïc Paulevé; Adrien Richard. Topological fixed points in Boolean networks. Comptes Rendus. Mathématique, Volume 348 (2010) no. 15-16, pp. 825-828. doi : 10.1016/j.crma.2010.07.014. https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.1016/j.crma.2010.07.014/

[1] J. Aracena Maximum number of fixed points in regulatory boolean networks, Bull. Math. Biol., Volume 70 (2008), pp. 1398-1409

[2] J. Aracena; J. Demongeot; E. Goles Positive and negative circuits in discrete neural networks, IEEE Trans. Neural Networks, Volume 15 (2004), pp. 77-83

[3] H. de Jong Modeling and simulation of genetic regulatory systems: A literature review, J. Comput. Biol., Volume 9 (2002), pp. 67-103

[4] S. Kauffman Metabolic stability and epigenesis in randomly connected nets, J. Theoret. Biol., Volume 22 (1969), pp. 437-467

[5] S. Kauffman Origins of Order Self-Organization and Selection Evolution, Oxford University Press, 1993

[6] L. Mendoza; D. Thieffry; E.R. Alvarez-Buylla Genetic control of flower morphogenesis of Arabidopsis thaliana: a logical analysis, Bioinformatics, Volume 15 (1999), pp. 593-606

[7] R. Thomas Boolean formalization of genetic control circuits, J. Theoret. Biol., Volume 42 (1973), pp. 563-585

[8] R. Thomas; R. d'Ari Biological Feedback, CRC Press, 1990

Cité par Sources :

Commentaires - Politique


Ces articles pourraient vous intéresser

Robustness in biological regulatory network III: Application to genetic networks controlling the morphogenesis

Jacques Demongeot; Jules Waku

C. R. Math (2012)


Introduction to GPGPU, a hardware and software background

Guillaume Colin de Verdière

C. R. Méca (2011)


Robustness in biological regulatory networks II: Application to genetic threshold Boolean random regulatory networks (getBren)

Jacques Demongeot; Jules Waku

C. R. Math (2012)