Synthesis of Boolean Networks from Biological Dynamical Constraints using Answer-Set Programming

Abstract : Boolean networks model finite discrete dynamical systems with complex behaviours. The state of each component is determined by a Boolean function of the state of (a subset of) the components of the network. This paper addresses the synthesis of these Boolean functions from constraints on their domain and emerging dynamical properties of the resulting network. The dynamical properties relate to the existence and absence of trajectories between partially observed configurations, and to the stable behaviours (fixpoints and cyclic attractors). The synthesis is expressed as a Boolean satisfiability problem relying on Answer-Set Programming with a parametrized complexity, and leads to a complete non-redundant characterization of the set of solutions. Considered constraints are particularly suited to address the synthesis of models of cellular differentiation processes, as illustrated on a case study. The scalability of the approach is demonstrated on random networks with scale-free structures up to 100 to 1,000 nodes depending on the type of constraints.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02276921
Contributor : Loïc Paulevé <>
Submitted on : Monday, September 9, 2019 - 4:45:57 PM
Last modification on : Wednesday, September 11, 2019 - 1:25:14 AM

Files

ictai19.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02276921, version 1
  • ARXIV : 1909.04309

Citation

Stéphanie Chevalier, Christine Froidevaux, Loïc Paulevé, Andrei Zinovyev. Synthesis of Boolean Networks from Biological Dynamical Constraints using Answer-Set Programming. 31st International Conference on Tools with Artificial Intelligence, 2019, Portland, Oregon, United States. ⟨hal-02276921⟩

Share

Metrics

Record views

132

Files downloads

46