Boolean network sketches: a unifying framework for logical model inference

Abstract

Motivation The problem of model inference is of fundamental importance to systems biology. Logical models (e.g., Boolean networks; BNs) represent a computationally attractive approach capable of handling large biological networks. The models are typically inferred from experimental data. However, even with a substantial amount of experimental data supported by some prior knowledge, existing inference methods often focus on a small sample of admissible candidate models only. Results We propose Boolean network sketches as a new formal instrument for the inference of Boolean networks. A sketch integrates (typically partial) knowledge about the network’s topology and the update logic (obtained through, e.g., a biological knowledge base or a literature search), as well as further assumptions about the properties of the network’s transitions (e.g., the form of its attractor landscape), and additional restrictions on the model dynamics given by the measured experimental data. Our new BNs inference algorithm starts with an initial sketch which is extended by adding restrictions representing experimental data to a data-informed sketch and subsequently computes all BNs consistent with the data-informed sketch. Our algorithm is based on a symbolic representation and coloured model-checking. Our approach is unique in its ability to cover a broad spectrum of knowledge and efficiently produce a compact representation of all inferred BNs. We evaluate the method on a non-trivial collection of real-world and simulated data. Availability All software and data are freely available as a reproducible artefact at https://doi.org/10.5281/zenodo.7688740. Supplementary information Supplementary data available online through Bioinformatics.

Optimizing sequential gene expression modulation for cellular reprogramming - Coupled Boolean modeling and Reinforcement Learning based method

“…Moreover, recent development of computational methods for inferring Boolean network models from high-throughput data (e.g. single cell transcriptomic data) [68], [69], [70] makes it easy to develop such large- scale Boolean network models. Thus, the choice of Boolean modeling formalism in the proposed method makes it possible to scale the method to larger regulatory networks.…”

Modularity of biological systems: a link between structure and function

“…It would, therefore, not be surprising if there was a selection bias among systems biologists to focus their attention on such modules. Larger networks are still challenging to build and analyse since an accurate formulation of a biological network model requires a substantial amount of data for a careful inference and calibration of the update rules by a subject expert [18][19][20][21]. For this reason most published expert-curated models might focus on one specific cellular function of interest and contain, therefore, only one non-trivial SCC.…”

MaBoSS for HPC environments: Implementations of the continuous time Boolean model simulator for large CPU clusters and GPU accelerators

“…Historically, the task of building Boolean models involved reading an extensive amount of literature and summarizing it in a list of essential components and their interactions. More recently, thanks to advances in databases listing such interactions (5, 6) and to experimental techniques providing information on a bigger number of components, the automatic methods have been designed to infer Boolean formulas from the constraints encoded in the knowledge and the experimental data (7–9), allowing construction of large Boolean models. While this effort faces many challenges, we believe it is a promising way to study the large-scale complexity of biological systems.…”