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

  • Authors:
  • LoïC Paulevé;Adrien Richard

  • Affiliations:
  • LUNAM Université, ícole Centrale de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communications et Cybernétique de Nantes), 1 rue de la Noë - B.P. 92101 - 44321 Nante ...;I3S, UMR 6070 CNRS & Universitéé de Nice-Sophia Antipolis, 2000 route des Lucioles, 06903 Sophia Antipolis, France

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Boolean networks are discrete dynamical systems extensively used to model biological regulatory networks. The dynamical analysis of these networks suffers from the combinatorial explosion of the state space, which grows exponentially with the number n of components. To face this problem, a classical approach consists in deducing from the interaction graph of the network, which only contains n vertices, some information on the dynamics of the network. In this paper, we present results in this topic, mainly by focusing on the influence of positive and negative feedbacks.