On the computation of fixed points in Boolean networks

DOI10.1007/s12190-011-0517-9zbMath1381.94145arXiv1010.0359OpenAlexW1967292023MaRDI QIDQ2511059

Alan Veliz-Cuba, Reinhard C. Laubenbacher

Publication date: 5 August 2014

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.0359

zbMATH Keywords

fixed pointsnetwork dynamicsmaximal independent setsBoolean network

Mathematics Subject Classification ID

Boolean functions (06E30) Applications of graph theory to circuits and networks (94C15)

Related Items

Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Stability structures of conjunctive Boolean networks ⋮ Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Synchronizing Boolean networks asynchronously ⋮ Boolean analysis of lateral inhibition ⋮ Maximum number of periodic orbits in parallel dynamical systems ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ On periods and equilibria of computational sequential systems ⋮ Dimension reduction of large sparse AND-NOT network models ⋮ Algebraic Models and Their Use in Systems Biology ⋮ Fixed points and 2-cycles of synchronous dynamic coloring processes on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerating maximal independent sets with applications to graph colouring.
• The dynamics of conjunctive and disjunctive Boolean network models
• Maximum number of fixed points in regulatory Boolean networks
• Enumeration aspects of maximal cliques and bicliques
• The number of maximal independent sets in a connected graph
• The number of fixed points of the majority rule
• Fixed points and maximal independent sets in AND-OR networks
• All maximal independent sets and dynamic dominance for sparse graphs
• A log-star distributed maximal independent set algorithm for growth-bounded graphs
• Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
• The number of maximal independent sets in connected graphs
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Algorithm Theory - SWAT 2004
• Distributed Computing
• Linear analysis of switching nets
• Linear Finite Dynamical Systems
• On cliques in graphs