Uncovering operational interactions in genetic networks using asynchronous boolean dynamics

Laurent Tournier; Madalena Chaves

HAL : inria-00325914, version 2

Uncovering operational interactions in genetic networks using asynchronous boolean dynamics
Tournier L., Chaves M.
Research report (2008) - http://hal.inria.fr/inria-00325914

Versions disponibles

v1 (30-09-2008)

v2 (23-10-2008)

Type de publication :

Rapport de recherche

Domaine :

Mathématiques/Systèmes dynamiques

Titre :

Uncovering operational interactions in genetic networks using asynchronous boolean dynamics

Auteur(s) :

Laurent Tournier (

) ¹, Madalena Chaves (

) ¹

Projet(s) / laboratoire(s) :

1 :	COMORE (INRIA Sophia Antipolis)

	http://www-sop.inria.fr/comore/main_fr.html

	INRIA – CNRS : UMR7093

	2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis cedex

	France

Résumé :

To analyze and gain intuition on the mechanisms of complex systems of large dimensions, one strategy is to simplify the model by identifying a reduced system, in the form of a smaller set of variables and interactions that still capture specific properties of the system. For large models of biological networks, the diagram of interactions is often well represented by a Boolean model with a family of logical rules. The state space of a Boolean model is finite, and its asynchronous dynamics are fully described by a transition graph in the state space. In this context, a method will be developed for identifying the active or operational interactions responsible for a given dynamic behaviour. The first step in this procedure is the decomposition of the asynchronous transition graph into its strongly connected components, to obtain a ``reduced'' and hierarchically organized graph of transitions. The second step consists of the identification of a partial graph of interactions and a sub-family of logical rules that remain operational in a given region of the state space. This model reduction method and its usefulness are illustrated by an application to a model of programmed cell death. The method identifies two mechanisms used by the cell to respond to death-receptor stimulation and decide between the survival or apoptotic pathways.

Langue du document :

Anglais

Type de rapport :

Rapport de recherche

Date de publication :

2008

Mots-clés :

Boolean networks – Asynchronous transition graph – Model reduction – Biological networks.

Référence interne :

RR-6703

Liste des fichiers attachés à ce document :

PDF

RR-6703.pdf

(508.2 KB)


inria-00325914, version 2
http://hal.inria.fr/inria-00325914
oai:hal.inria.fr:inria-00325914
Contributeur : Laurent Tournier <>
Soumis le : Jeudi 23 Octobre 2008, 12:38:51
Dernière modification le : Vendredi 24 Octobre 2008, 11:42:37