Computing maximal and minimal trap spaces of Boolean networks

Abstract

Asymptotic behaviors are often of particular interest when analyzing Boolean networks that represent biological systems such as signal transduction or gene regulatory networks. Methods based on a generalization of the steady state notion, the so-called trap spaces, can be exploited to investigate attractor properties as well as for model reduction… (More)
DOI: 10.1007/s11047-015-9520-7

Topics

7 Figures and Tables

Cite this paper

@article{Klarner2015ComputingMA, title={Computing maximal and minimal trap spaces of Boolean networks}, author={Hannes Klarner and Alexander Bockmayr and Heike Siebert}, journal={Natural Computing}, year={2015}, volume={14}, pages={535-544} }