Combinatorics on update digraphs in Boolean networks

DOI10.1016/J.DAM.2010.10.010zbMATH Open1209.05103OpenAlexW2000235460MaRDI QIDQ628333FDOQ628333

Authors: E. Fanchon, Julio Aracena, Marco Montalva, Mathilde Noual 

Publication date: 10 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.010

Recommendations

• Limit cycles and update digraphs in Boolean networks
• On the number of different dynamics in Boolean networks with deterministic update schedules
• On the number of update digraphs and its relation with the feedback arc sets and tournaments
• Block-sequential update schedules and Boolean automata circuits
• Combinatorics of Boolean automata circuits dynamics

zbMATH Keywords

Boolean networkfeedback arc setupdate scheduleupdate digraph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrete, sequential dynamical systems
• ON ASYNCHRONOUS CELLULAR AUTOMATA
• Robustness and fragility of Boolean models for genetic regulatory networks
• Title not available (Why is that?)

Cited In (20)

• \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
• Disjunctive networks and update schedules
• Sequentialization and procedural complexity in automata networks
• On the number of different dynamics in Boolean networks with deterministic update schedules
• Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks
• Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates
• Limit cycles and update digraphs in Boolean networks
• About non-monotony in Boolean automata networks
• On the number of update digraphs and its relation with the feedback arc sets and tournaments
• Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures
• Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations
• Computational complexity of minimal trap spaces in Boolean networks
• About block-parallel Boolean networks: a position paper
• Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations
• Asynchronous, finite dynamical systems
• Complexity of limit cycles with block-sequential update schedules in conjunctive networks
• A spectral outlook on the elementary cellular automata with cyclic configurations and block-sequential asynchronous updates
• From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
• Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata
• Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates

This page was built for publication: Combinatorics on update digraphs in Boolean networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628333)