On circuit functionality in boolean networks.

Détails

ID Serval
serval:BIB_75F51380A25E
Type
Article: article d'un périodique ou d'un magazine.
Collection
Publications
Titre
On circuit functionality in boolean networks.
Périodique
Bulletin of Mathematical Biology
Auteur(s)
Comet J.P., Noual M., Richard A., Aracena J., Calzone L., Demongeot J., Kaufman M., Naldi A., Snoussi el H, Thieffry D.
ISSN
1522-9602 (Electronic)
ISSN-L
0092-8240
Statut éditorial
Publié
Date de publication
2013
Volume
75
Numéro
6
Pages
906-919
Langue
anglais
Résumé
It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp. negative) circuit is said to be functional when it "generates" several stable states (resp. a cyclic attractor). However, there are no definite mathematical frameworks translating the underlying meaning of "generates." Focusing on Boolean networks, we recall and propose some definitions concerning the notion of functionality along with associated mathematical results.
Pubmed
Web of science
Création de la notice
04/08/2013 9:32
Dernière modification de la notice
03/03/2018 18:24
Données d'usage