Dynamically consistent reduction of logical regulatory graphs

Authors:
Aurélien Naldi;Elisabeth Remy;Denis Thieffry;Claudine Chaouiya
Affiliations:
TAGC Inserm U928 - Université de la Méditerranée, Marseille, France;IML UMR 6206, Marseille, France;TAGC Inserm U928 - Université de la Méditerranée, Marseille, France and CONTRAINTES project, INRIA Paris-Rocquencourt, France;TAGC Inserm U928 - Université de la Méditerranée, Marseille, France and IGC, Instituto Gulbenkian de Ciência, Oeiras, Portugal
Venue:
Theoretical Computer Science
Year:
2011

Citing 12
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Checking properties of nets using transformation

Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Property Preserving Homomorphisms of Transition Systems

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle

Bioinformatics
Abstract interpretation and types for systems biology

Theoretical Computer Science
Logical modelling of the role of the Hh pathway in the patterning of the Drosophila wing disc

Bioinformatics
Temporal logic patterns for querying dynamic models of cellular interaction networks

Bioinformatics
From minimal signed circuits to the dynamics of Boolean regulatory networks

Bioinformatics
Synchronous versus asynchronous modeling of gene regulatory networks

Bioinformatics
Automated symbolic reachability analysis: with application to delta-notch signaling automata

HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Decision diagrams for the representation and analysis of logical models of genetic networks

CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
Petri net representation of multi-valued logical regulatory graphs

Natural Computing: an international journal

Logical modelling of haematopoietic cell fate reprogramming

Proceedings of the 9th International Conference on Computational Methods in Systems Biology
Parameter identification and model ranking of thomas networks

CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology
Efficient handling of large signalling-regulatory networks by focusing on their core control

CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology
Interconnection of asynchronous Boolean networks, asymptotic and transient dynamics

Automatica (Journal of IFAC)

Quantified Score

Hi-index	5.23

Visualization

Abstract

To cope with the increasing complexity of regulatory networks, we define a reduction method for multi-valued logical models. Starting with a detailed model, we use decision diagrams to compute reduced models by iteratively ''removing'' regulatory components. To keep a consistent dynamical behaviour, the logical rules associated with the targets of each removed node are actualised to account for the (indirect) effects of its regulators. This construction of reduced models preserves crucial dynamical properties of the original model, including stable states and more complex attractors. In this respect, the relationship between the attractor configuration of the original model and those of reduced models is formally established. We further analyse the issue of attractor reachability. Finally, we illustrate the flexibility and efficiency of the proposed reduction method by its application to a multi-valued model of the fly segment polarity network, which is involved in the control of segmentation during early embryogenesis.