Cargando…
Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
Autores principales: | Guziolowski, Carito, Videla, Santiago, Eduati, Federica, Thiele, Sven, Cokelaer, Thomas, Siegel, Anne, Saez-Rodriguez, Julio |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4071210/ http://dx.doi.org/10.1093/bioinformatics/btu357 |
Ejemplares similares
-
Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
por: Guziolowski, Carito, et al.
Publicado: (2013) -
caspo: a toolbox for automated reasoning on the response of logical signaling networks families
por: Videla, Santiago, et al.
Publicado: (2017) -
Designing Experiments to Discriminate Families of Logic Models
por: Videla, Santiago, et al.
Publicado: (2015) -
Identification of bifurcation transitions in biological regulatory networks using Answer-Set Programming
por: Fitime, Louis Fippo, et al.
Publicado: (2017) -
Predicting weighted unobserved nodes in a regulatory network using answer set programming
por: Le Bars, Sophie, et al.
Publicado: (2023)