Extending boolean regulatory network models with answer set programmingReportar como inadecuado

Extending boolean regulatory network models with answer set programming - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

(2010)Proceedings 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW 2010).p.207-212 Mark abstract Because of their simplicity, boolean networks are a popular formalism to model gene regulatory networks. However, they have their limitations, including their inability to formally and unambiguously define network behaviour, and their lack of the possibility to model meta interactions, i.e., interactions that target other interactions. In this paper we develop an answer set programming (ASP) framework that supports threshold boolean network semantics and extends it with the capability to model meta interactions. The framework is easy to use but sufficiently flexible to express intricate interactions that go beyond threshold network semantics as we illustrate with an example of a Mammalian cell cycle network. Moreover, readily available answer set solvers can be used to find the steady states of the network.

Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-1108292

Autor: Timur Fayruzov , Jeroen Janssen , Chris Cornelis , Dirk Vermeir and Martine De Cock

Fuente: https://biblio.ugent.be/publication/1108292


Documentos relacionados