Cargando…

Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming

Detalles Bibliográficos
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
_version_ 1782322787603447808
author Guziolowski, Carito
Videla, Santiago
Eduati, Federica
Thiele, Sven
Cokelaer, Thomas
Siegel, Anne
Saez-Rodriguez, Julio
author_facet Guziolowski, Carito
Videla, Santiago
Eduati, Federica
Thiele, Sven
Cokelaer, Thomas
Siegel, Anne
Saez-Rodriguez, Julio
author_sort Guziolowski, Carito
collection PubMed
description
format Online
Article
Text
id pubmed-4071210
institution National Center for Biotechnology Information
language English
publishDate 2014
publisher Oxford University Press
record_format MEDLINE/PubMed
spelling pubmed-40712102014-06-26 Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming Guziolowski, Carito Videla, Santiago Eduati, Federica Thiele, Sven Cokelaer, Thomas Siegel, Anne Saez-Rodriguez, Julio Bioinformatics Erratum Oxford University Press 2014-07-01 2014-06-24 /pmc/articles/PMC4071210/ http://dx.doi.org/10.1093/bioinformatics/btu357 Text en © The Author 2014. Published by Oxford University Press. http://creativecommons.org/licenses/by/3.0/ This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Erratum
Guziolowski, Carito
Videla, Santiago
Eduati, Federica
Thiele, Sven
Cokelaer, Thomas
Siegel, Anne
Saez-Rodriguez, Julio
Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
title Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
title_full Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
title_fullStr Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
title_full_unstemmed Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
title_short Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming
title_sort exhaustively characterizing feasible logic models of a signaling network using answer set programming
topic Erratum
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4071210/
http://dx.doi.org/10.1093/bioinformatics/btu357
work_keys_str_mv AT guziolowskicarito exhaustivelycharacterizingfeasiblelogicmodelsofasignalingnetworkusinganswersetprogramming
AT videlasantiago exhaustivelycharacterizingfeasiblelogicmodelsofasignalingnetworkusinganswersetprogramming
AT eduatifederica exhaustivelycharacterizingfeasiblelogicmodelsofasignalingnetworkusinganswersetprogramming
AT thielesven exhaustivelycharacterizingfeasiblelogicmodelsofasignalingnetworkusinganswersetprogramming
AT cokelaerthomas exhaustivelycharacterizingfeasiblelogicmodelsofasignalingnetworkusinganswersetprogramming
AT siegelanne exhaustivelycharacterizingfeasiblelogicmodelsofasignalingnetworkusinganswersetprogramming
AT saezrodriguezjulio exhaustivelycharacterizingfeasiblelogicmodelsofasignalingnetworkusinganswersetprogramming