MCBF repository contains the codes and dataset associated with the following research article:
Ajay Subbaroyan, Olivier C. Martin* & Areejit Samal*, Minimum complexity drives regulatory logic in Boolean models of living systems, PNAS Nexus, 1(1):pgac017, 2022.
(* Corresponding authors)
This repository contains 4 folders which are described below.
The folder contains codes to check (BF_checkers.py) and generate (BF_generators.py) different types of biologically meaningful BFs. The code (BF_properties.py) enables computations of some properties of BFs and perform various operations on them.
The procedure to compute the Boolean Complexity of a given BF is provided in this folder.
The code to check if a BF is a read-once function (RoF), and to generate the representative RoFs are given in this folder. The RoF_catalog lists all representative RoFs and their various properties up to k=10 inputs.
This folder gives the reference_biological_dataset.tsv file containing details of the 2687 Boolean functions compiled from 88 discrete models in published literature. It also contains the statistical_tests.R code which is used to compute the p-values to show enrichment of different types of BFs.
In case you use the codes herein, please cite the following research article:
Ajay Subbaroyan, Olivier C. Martin* & Areejit Samal*, Minimum complexity drives regulatory logic in Boolean models of living systems, PNAS Nexus, 1(1):pgac017, 2022.