Mapping multivalued onto Boolean dynamics.
This paper deals with the generalized logical framework defined by René Thomas in the 70's to qualitatively represent the dynamics of regulatory networks. In this formalism, a regulatory network is represented as a graph, where nodes denote regulatory components (basically genes) and edges denote regulations between these components. Discrete variables are associated to regulatory components accounting for their levels of expression. In most cases, Boolean variables are enough, but some situations may require further values. Despite this fact, the majority of tools dedicated to the analysis of logical models are restricted to the Boolean case. A formal Boolean mapping of multivalued logical models is a natural way of extending the applicability of these tools. Three decades ago, a multivalued to Boolean variable mapping was proposed by P. Van Ham. Since then, all works related to multivalued logical models and using a Boolean representation rely on this particular mapping. We formally show in this paper that this mapping is actually the sole, up to cosmetic changes, that could preserve the regulatory structures of the underlying graphs as well as their dynamical behaviours.
Didier
Gilles
G
Institut de Mathématiques de Luminy, Marseille, France. gilles.didier@univmed.fr
Remy
Elisabeth
E
Chaouiya
Claudine
C
D000465:Algorithms; D002467:Cell Nucleus / Q000378:metabolism; D003593:Cytoplasm / Q000378:metabolism; D053263:Gene Regulatory Networks / Q000502:physiology*; D008954:Models, Biological; D051736:Proto-Oncogene Proteins c-mdm2 / Q000378:metabolism; D016159:Tumor Suppressor Protein p53 / Q000378:metabolism
D016159:Tumor Suppressor Protein p53; D051736:Proto-Oncogene Proteins c-mdm2