Relationship Between the Reprogramming Determinants of Boolean Networks and Their Interaction Graph

Conference paper

DOI: 10.1007/978-3-319-47151-8_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9957)
Cite this paper as:
Mandon H., Haar S., Paulevé L. (2016) Relationship Between the Reprogramming Determinants of Boolean Networks and Their Interaction Graph. In: Cinquemani E., Donzé A. (eds) Hybrid Systems Biology. HSB 2016. Lecture Notes in Computer Science, vol 9957. Springer, Cham

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.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.LRI UMR 8623, Univ. Paris-Sud – CNRS, Université Paris-SaclayOrsayFrance
  2. 2.LSV, ENS Cachan, Inria, CNRS, Université Paris-SaclayCachanFrance

Personalised recommendations