Parsimonious computational inference protocol for Boolean networks: Application to osteogenesis

arXiv:2604.26700v1 Announce Type: new
Abstract: Boolean networks are powerful mathematical tools for modeling the qualitative dynamics of genetic regulation. Yet inferred models often generate spurious attractors that lack biological viability. In this paper, we propose a parsimonious computational framework to systematically refine Boolean network models by eliminating these non-biological asymptotic behaviors while strictly preserving known, biologically relevant attractors. Through an exhaustive exploration of local function substitutions, we generate a comprehensive set of candidate models. To identify the most biologically consistent networks, we implement an incremental pruning protocol that filters candidates based on structural interaction digraph similarity, attraction basin topological organization, trajectorial isomorphism, and the minimization of dynamical instability and frustration. We apply this methodology to a 9-node genetic control model of the osteogenesis regulation network. Our protocol effectively evaluates a syntactic search space of 51,138 potential networks, ultimately narrowing them down to a robust family of 6 parsimonious models that are fully compatible with current biological knowledge.