Maximum number of fixed points in regulatory Boolean networks

DOI10.1007/s11538-008-9304-7zbMath1144.92323OpenAlexW2007062164WikidataQ51892031 ScholiaQ51892031MaRDI QIDQ941144

Julio Aracena

Publication date: 4 September 2008

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/139764

zbMATH Keywords

attractorfeedback vertex setsigned digraphgenetic networksign-definite functionpositive cycle

Mathematics Subject Classification ID

Applications of graph theory (05C90) Circuits, networks (94C99) Genetics and epigenetics (92D10)

Related Items (47)

Complexity of fixed point counting problems in Boolean networks ⋮ Simple dynamics on graphs ⋮ Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Static analysis of Biological Regulatory Networks dynamics using abstract interpretation ⋮ Modeling and Analysis of Gene Regulatory Networks ⋮ Boolean networks: beyond generalized asynchronicity ⋮ Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ On circuit functionality in Boolean networks ⋮ Analysis and characterization of asynchronous state transition graphs using extremal states ⋮ Discrimination of singleton and periodic attractors in Boolean networks ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ On the complexity of feedback set problems in signed digraphs ⋮ On the relationship of steady states of continuous and discrete models arising from biology ⋮ Synchronizing Boolean networks asynchronously ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ Cold dynamics in cellular automata: a tutorial ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Concurrency in Boolean networks ⋮ The maximal coordination principle in regulatory Boolean networks ⋮ Tackling universal properties of minimal trap spaces of Boolean networks ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Positive and negative cycles in Boolean networks ⋮ On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ Optimising attractor computation in Boolean automata networks ⋮ Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey ⋮ Invalidation of the structure of genetic network dynamics: a geometric approach ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates ⋮ Abstract Interpretation of Dynamics of Biological Regulatory Networks ⋮ Negative circuits and sustained oscillations in asynchronous automata networks ⋮ Positive circuits and maximal number of fixed points in discrete dynamical systems ⋮ The dynamics of conjunctive and disjunctive Boolean network models ⋮ Topological fixed points in Boolean networks ⋮ On the rank and periodic rank of finite dynamical systems ⋮ Sequential operator for filtering cycles in Boolean networks ⋮ On the computation of fixed points in Boolean networks ⋮ Sequential importance sampling of binary sequences ⋮ Achieving a global objective with competing networked agents in the framework of discrete event systems ⋮ Singleton and 2-periodic attractors of sign-definite Boolean networks ⋮ Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules ⋮ The number of fixed points of AND-OR networks with chain topology ⋮ Fixed points and 2-cycles of synchronous dynamic coloring processes on trees ⋮ Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks

Cites Work

• Positive feedback loops and multistationarity
• Improving the efficiency of attractor cycle identification in Boolean networks
• Superpolynomial Growth in the Number of Attractors in Kauffman Networks
• On the complexity of feedback set problems in signed digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum number of fixed points in regulatory Boolean networks