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
Authors
Keywords
-
Journal
BIOINFORMATICS
Volume 29, Issue 18, Pages 2320-2326
Publisher
Oxford University Press (OUP)
Online
2013-07-13
DOI
10.1093/bioinformatics/btt393

Ask authors/readers for more resources

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started