Inferring probabilistic Boolean networks from steady-state gene data samples
Vytenis \v{S}liogeris, Leandros Maglaras, Sotiris Moschoyiannis

TL;DR
This paper introduces a reproducible method for inferring Probabilistic Boolean Networks directly from steady-state gene expression data, enabling analysis of biological systems without reconstructing full state evolution.
Contribution
The method infers PBNs from steady-state data without reconstructing network dynamics, suitable for large networks and noisy biological data.
Findings
Successfully applied to melanoma gene expression data
Does not require state evolution reconstruction
Implemented in Python and publicly available
Abstract
Probabilistic Boolean Networks have been proposed for estimating the behaviour of dynamical systems as they combine rule-based modelling with uncertainty principles. Inferring PBNs directly from gene data is challenging however, especially when data is costly to collect and/or noisy, e.g., in the case of gene expression profile data. In this paper, we present a reproducible method for inferring PBNs directly from real gene expression data measurements taken when the system was at a steady state. The steady-state dynamics of PBNs is of special interest in the analysis of biological machinery. The proposed approach does not rely on reconstructing the state evolution of the network, which is computationally intractable for larger networks. We demonstrate the method on samples of real gene expression profiling data from a well-known study on metastatic melanoma. The pipeline is implemented…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGene Regulatory Network Analysis · Protein Structure and Dynamics · Single-cell and spatial transcriptomics
