Sampling canalizing and nested canalizing functions uniformly at random constitutes a non-trivial combinatorial problem. In a recent manuscript, we described methods to obtain an efficient uniform sampler, which is implemented in BoolForge.
This repository contains all code to generate the figures presented in
Ahana Ghosh and Claus Kadelka. Uniform sampling of canalizing Boolean functions reveals hidden biases in Boolean network analysis. Under review.
.
├── src/
├── figures/
├── requirements.txt
└── README.md
Source code used for all analyses.
Generated manuscript figures.
Clone the repository:
git clone https://github.com/username/boolforge-uniform-samplers.git
cd boolforge-uniform-samplersCreate a virtual environment and install dependencies:
pip install -r requirements.txtTo reproduce all manuscript figures:
python scripts/create_figures124_uniform_sampler_paper.py
python scripts/create_figure3_uniform_sampler_paper.py
Generated figures will be written to:
figures/
- Python 3.10
- NumPy
- Matplotlib
- BoolForge
- Ahana Ghosh
- Claus Kadelka
MIT License