Computing preimages of Boolean Networks release_zmeuirmoufdq7alvm4hpo3kdua

by Johannes Georg Klotz, Martin Bossert, Steffen Schober

Released as a article .

2013  

Abstract

In this paper we present an algorithm to address the predecessor problem of feed-forward Boolean networks. We propose an probabilistic algorithm, which solves this problem in linear time with respect to the number of nodes in the network. Finally, we evaluate our algorithm for random Boolean networks and the regulatory network of Escherichia coli.
In text/plain format

Archived Files and Locations

application/pdf  95.4 kB
file_xzw2y65ntjb2leylqoovzzyyde
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  92.5 kB
file_wwdr26jirbelpn4zjljrtmjiji
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2013-02-15
Version   v1
Language   en ?
arXiv  1302.3723v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2a89392a-d715-45ed-b1c2-ac16b8a7b1bf
API URL: JSON