A Reduction of Logical Regulatory Graphs Preserving Essential Dynamical Properties

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, 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:
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Year:
2009

Citing 7
Cited 6

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle

Bioinformatics
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
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

Action-based analysis of discrete regulatory networks with short-term stimuli

Proceedings of the 8th International Conference on Computational Methods in Systems Biology
On the use of temporal formal logic to model gene regulatory networks

CIBB'09 Proceedings of the 6th international conference on Computational intelligence methods for bioinformatics and biostatistics
Petri net representation of multi-valued logical regulatory graphs

Natural Computing: an international journal
An abstraction theory for qualitative models of biological systems

Theoretical Computer Science
Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey

Electronic Notes in Theoretical Computer Science (ENTCS)
Concretizing the process hitting into biological regulatory networks

CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology

Quantified Score

Hi-index	0.00

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, this method enables the computation of a reduced model by iteratively "hiding" regulatory components. To keep a consistent behaviour, the logical rules associated with the targets of each hidden node are actualised to account for the (indirect) effects of its regulators. The construction of reduced models ensures the preservation of a number of dynamical properties of the original model. In particular, stable states and more complex attractors are conserved. More generally, we focus on the relationship between the attractor configuration of the original model and that of the reduced model, along with the issue of attractor reachability. The power of the reduction method is illustrated by its application to a multi-valued model of the segment-polarity network Controlling segmentation in the fly Drosophila melanogaster.