Dynamically consistent reduction of logical regulatory graphs

DOI10.1016/j.tcs.2010.10.021zbMath1211.92024OpenAlexW2018519939WikidataQ59211689 ScholiaQ59211689MaRDI QIDQ533364

Aurélien Naldi, Claudine Chaouiya, Elisabeth Remy, Denis Thieffrey

Publication date: 3 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.021

zbMATH Keywords

attractorsmodel reductionregulatory networksdecision diagramsdrosophila segmentationlogical modelling

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Many-valued logic (03B50) Other applications of logic (03B80) Systems biology, networks (92C42)

Related Items (17)

Reducing Boolean networks with backward Boolean equivalence ⋮ بررسی موردی حساسیت و توپولوژی گرههای شبکههای بولی کاهشیافته ⋮ Attractor controllability of Boolean networks by flipping a subset of their nodes ⋮ Remarks on the respective roles of logical parameters and time delays in asynchronous logic: an homage to El Houssine Snoussi ⋮ Analysis and characterization of asynchronous state transition graphs using extremal states ⋮ Boolean function metrics can assist modelers to check and choose logical rules ⋮ Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding ⋮ Attractor identification in asynchronous Boolean dynamics with network reduction ⋮ Attractor computation using interconnected Boolean networks: testing growth rate models in \textit{E. coli} ⋮ A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models ⋮ Negative local feedbacks in Boolean networks ⋮ Minimization and equivalence in multi-valued logical models of regulatory networks ⋮ An effective network reduction approach to find the dynamical repertoire of discrete dynamic networks ⋮ Dynamical modeling and analysis of large cellular regulatory networks ⋮ Unwinding biological systems ⋮ An extension of ERODE to reduce Boolean networks by backward Boolean equivalence ⋮ Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy

Uses Software

• Ginsim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri net representation of multi-valued logical regulatory graphs
• Dynamical behaviour of biological regulatory networks. I: Biological role of feedback loops and practical use of the concept of the loop- characteristic state
• Reduction rules for time Petri nets
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
• Segmenting the fly embryo: a logical analysis of the \textit{pair-rule} cross-regulatory module
• Robustness and fragility of Boolean models for genetic regulatory networks
• Abstract interpretation and types for systems biology
• Graph-Based Algorithms for Boolean Function Manipulation

This page was built for publication: Dynamically consistent reduction of logical regulatory graphs