Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph

TL;DR

This paper explores how the structure of interaction graphs in Boolean networks influences the ability to switch between fixed points, providing theoretical insights and algorithms for cellular trans-differentiation modeling.

Contribution

It offers a formal characterization of mutation sets for fixed point transitions in Boolean networks, linking graph connectivity to reachability properties.

Findings

Mutations for fixed point switching are confined to specific graph components.

Algorithms are developed to identify mutation subsets for inevitable reachability.

The study advances understanding of cellular trans-differentiation mechanisms.

Abstract

In this paper, we address the formal characterization of targets triggering cellular trans-differentiation in the scope of Boolean networks with asynchronous dynamics. Given two fixed points of a Boolean network, we are interested in all the combinations of mutations which allow to switch from one fixed point to the other, either possibly, or inevitably. In the case of existential reachability, we prove that the set of nodes to (permanently) flip are only and necessarily in certain connected components of the interaction graph. In the case of inevitable reachability, we provide an algorithm to identify a subset of possible solutions.