title: Computing preimages of Boolean networks.
abstract: In this paper we present an algorithm based on the sum-product algorithm that finds elements in the preimage of a feed-forward Boolean networks given an output of the network. Our probabilistic method runs in linear time with respect to the number of nodes in the network. We evaluate our algorithm for randomly constructed Boolean networks and a regulatory network of Escherichia coli and found that it gives a valid solution in most cases.
authors.forename: Johannes
authors.initials: J
authors.lastname: Klotz
authors.forename: Martin
authors.initials: M
authors.lastname: Bossert
authors.forename: Steffen
authors.initials: S
authors.lastname: Schober
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods; D003198:Computer Simulation; D004926:Escherichia coli / Q000235:genetics; D053263:Gene Regulatory Networks; D008957:Models, Genetic; D011336:Probability