Cargando…

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 trap space correspond to...

Descripción completa

Detalles Bibliográficos
Autores principales: Klarner, Hannes, Siebert, Heike
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Frontiers Media S.A. 2015
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4562258/
https://www.ncbi.nlm.nih.gov/pubmed/26442247
http://dx.doi.org/10.3389/fbioe.2015.00130