Combinatorics on update digraphs in Boolean networks

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Discrete Applied Mathematics

• Publication date

  2011-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.dam.2010.10.010
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the robustness of update schedules in Boolean networks

  2009cited by this paper
• Robustness in Regulatory Networks: A Multi-Disciplinary Approach

  2008cited by this paper
• On Asynchronous Cellular Automata

  2005cited by this paper
• Robustness and fragility of Boolean models for genetic regulatory networks.

  2005cited by this paper
• The role of certain Post classes in Boolean network models of genetic networks

  2003cited by this paper
• Discrete, sequential dynamical systems

  2001cited by this paper
• Introduction to Graph Theory

  1995cited by this paper
• Regulatory networks seen as asynchronous automata: A logical description

  1991cited by this paper
• Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics

  1990cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Computers and Intractability: A Guide to the Theory of NP-Completeness

  1979cited by this paper
• Boolean formalization of genetic control circuits.

  1973cited by this paper
• Metabolic stability and epigenesis in randomly constructed genetic nets.

  1969cited by this paper

• Foundations of block-parallel automata networks

  2025cites this paper
• On the Convergence of Elementary Cellular Automata under Sequential Update Modes

  2025cites this paper
• Solving decision problems by distributed consensus with one-dimensional, binary, radius-2 cellular automata over cyclic configurations

  2025cites this paper
• Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer

  2025influential citation
• Robustness of Boolean networks to update modes: an application to hereditary angioedema

  2025cites this paper
• Impact of (a)Synchronism on ECA: Towards a New Classification

  2025cites this paper
• Dynamical robustness of a Boolean model for the human gonadal sex determination

  2024cites this paper
• Complexity of Boolean automata networks under block-parallel update modes

  2024cites this paper
• Asynchronous, finite dynamical systems

  2023cites this paper
• On countings and enumerations of block-parallel automata networks

  2023cites this paper
• On elementary cellular automata asymptotic (a)synchronism sensitivity and complexity

  2023cites this paper
• Dynamical methods for target control of biological networks

  2023cites this paper
• Complexity of limit cycles with block-sequential update schedules in conjunctive networks

  2022influential citation
• Boolean networks and their dynamics: the impact of updates

  2022cites this paper
• Computational Complexity of Minimal Trap Spaces in Boolean Networks

  2022cites this paper
• A Theory for Discrete-time Boolean Finite Dynamical Systems with Uncertainty

  2022cites this paper
• Influence maximization in Boolean networks

  2022cites this paper
• Non-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures

  2022cites this paper
• Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates

  2022cites this paper
• Non-Deterministic Updates of Boolean Networks

  2021cites this paper
• About block-parallel Boolean networks: a position paper

  2020cites this paper
• Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks

  2020cites this paper
• Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings

  2020cites this paper
• Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations

  2020cites this paper
• Cellular Automata and Discrete Complex Systems: 26th IFIP WG 1.5 International Workshop, AUTOMATA 2020, Stockholm, Sweden, August 10–12, 2020, Proceedings

  2020cites this paper
• Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures

  2020cites this paper
• #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method

  2020cites this paper
• Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations

  2019cites this paper
• Sequentialization and Procedural Complexity in Automata Networks

  2018cites this paper
• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates

  2018cites this paper
• Sensitivity to synchronism in some boolean automata networks

  2017cites this paper
• Enumeration and extension of non-equivalent deterministic update schedules in Boolean networks

  2016cites this paper
• Enumeration and extension of non-equivalent deterministic update schedules in Boolean networks.

  2016cites this paper
• Causality and Networks

  2016cites this paper
• Perspectives and Networks

  2016cites this paper
• Méthodologie semi-formelle pour l’étude de systèmes biologiques : application à l'homéostasie du fer

  2015cites this paper
• On the number of update digraphs and its relation with the feedback arc sets and tournaments

  2013cites this paper
• On the number of different dynamics in Boolean networks with deterministic update schedules.

  2013cites this paper
• Disjunctive networks and update schedules

  2012cites this paper
• Mises à jour de réseaux d'automates

  2012influential citation
• Updating Automata Networks

  2012influential citation
• About non-monotony in Boolean automata networks

  2011cites this paper