BoolNet
swMATH7365CRANBoolNetMaRDI QIDQ19397FDOQ19397
Construction, Simulation and Analysis of Boolean Networks
Christoph Müssel, Martin Hopfensitz, Hans A. Kestler, Dao Zhou
Last update: 2 October 2023
Copyright license: Artistic License 2.0
Software version identifier: 2.1.8, 1.3, 1.4, 1.41, 1.42, 1.43, 1.44, 1.45, 1.46, 1.50, 1.51, 1.60, 1.61, 1.62, 1.63, 2.0.1, 2.0.2, 2.0, 2.1.0, 2.1.1, 2.1.3, 2.1.4, 2.1.5, 2.1.7, 2.1.9
Source code repository: https://github.com/cran/BoolNet
Functions to reconstruct, generate, and simulate synchronous, asynchronous, probabilistic, and temporal Boolean networks. Provides also functions to analyze and visualize attractors in Boolean networks <doi:10.1093/bioinformatics/btq124>.
Cited In (20)
- An extension of ERODE to reduce Boolean networks by backward Boolean equivalence
- Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
- Computational cell biology. Methods and protocols
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- Robust stabilization and \(H_\infty\) controllers design for stochastic genetic regulatory networks with time-varying delays and structured uncertainties
- The Regulation of Gene Expression by Operons and the Local Modeling Framework
- Attractors in Boolean networks: a tutorial
- Bogdanov-Takens and Hopf bifurcations analysis of a genetic regulatory network
- Computing maximal and minimal trap spaces of Boolean networks
- Computational methods for asynchronous basins
- Aeon 2021: bifurcation decision trees in Boolean networks
- BoolFilter
- Boolean function metrics can assist modelers to check and choose logical rules
- Inferring Boolean functions via higher-order correlations
- Attractor stability in finite asynchronous biological system models
- Exact tests for singular network data
- diffeRenTES
- Boolean models of the transport, synthesis, and metabolism of tryptophan in \textit{Escherichia coli}
- Boolean network analysis through the joint use of linear algebra and algebraic geometry
- On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors
This page was built for software: BoolNet
