Approximating attractors of Boolean networks by iterative CTL model checking
This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: faithfulness which requires that the oscillating variables of all attractors in a trapspace correspond to th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Frontiers Media S.A.
2015-09-01
|
| Series: | Frontiers in Bioengineering and Biotechnology |
| Subjects: | |
| Online Access: | http://journal.frontiersin.org/Journal/10.3389/fbioe.2015.00130/full |