BoolForge: Controlled Generation and Analysis of Boolean Functions and Networks
Clicks: 3
ID: 323217
2026
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
0.6
/100
3 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #272 of 818 articles by views in BMC Bioinformatics
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 818 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
MOTIVATION: Boolean networks are a widely used modeling framework in systems biology for studying gene regulation, signal transduction, and cellular decision-making. Empirical studies indicate that biological Boolean networks exhibit a high degree of canalization, a property of Boolean update rules that stabilizes dynamics and constrains state transitions. Despite its central role, existing software packages provide limited support for the systematic generation of Boolean functions and networks with prescribed canalization properties. RESULTS: We present BoolForge, a Python toolbox for the random generation and analysis of Boolean functions and networks, with a particular focus on canalization. BoolForge enables users to (i) generate random Boolean functions with specified canalizing depth, layer structure, and related constraints; (ii) construct Boolean networks with tunable topological and functional properties; and (iii) analyze structural and dynamical features including canalization measures, robustness, modularity, and attractor structure. By enabling controlled generation alongside analysis, BoolForge facilitates ensemble-based investigations of structure-dynamics relationships, benchmarking of theoretical predictions, and construction of biologically informed null models for Boolean network studies. AVAILABILITY AND IMPLEMENTATION: BoolForge is implemented in Python (≥3.10) and can be installed via pip install boolforge. Source code and documentation are available at https://github.com/ckadelka/BoolForge. A comprehensive tutorial compendium is available as Supplementary Material at Bioinformatics online.
| Reference Key |
openalex_W4416182713
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Claus Kadelka, Benjamin Coberly |
| Journal | BMC Bioinformatics |
| Year | 2026 |
| DOI |
10.1093/bioinformatics/btag576
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.