Limits...
Computing preimages of Boolean networks.

Klotz J, Bossert M, Schober S - BMC Bioinformatics (2013)

Bottom Line: 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.

View Article: PubMed Central - HTML - PubMed

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.

Show MeSH

Related in: MedlinePlus

Example of a feed-forward network
© Copyright Policy - open-access
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC3750533&req=5

Figure 1: Example of a feed-forward network

Mentions: We consider networks like shown in Figure 1, mapping the values of the N in-nodes to the M out-nodes , i.e., we can represent this BN as a function mapping the N input values uniquely to the M output values:


Computing preimages of Boolean networks.

Klotz J, Bossert M, Schober S - BMC Bioinformatics (2013)

Example of a feed-forward network
© Copyright Policy - open-access
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC3750533&req=5

Figure 1: Example of a feed-forward network
Mentions: We consider networks like shown in Figure 1, mapping the values of the N in-nodes to the M out-nodes , i.e., we can represent this BN as a function mapping the N input values uniquely to the M output values:

Bottom Line: 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.

View Article: PubMed Central - HTML - PubMed

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.

Show MeSH
Related in: MedlinePlus