Cargando…
Computing preimages of Boolean networks
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 f...
Autores principales: | Klotz, Johannes Georg, Bossert, Martin, Schober, Steffen |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3750533/ https://www.ncbi.nlm.nih.gov/pubmed/24267277 http://dx.doi.org/10.1186/1471-2105-14-S10-S4 |
Ejemplares similares
-
Properties of Boolean networks and methods for their tests
por: Klotz, Johannes Georg, et al.
Publicado: (2013) -
Harmonic analysis of Boolean networks: determinative power and perturbations
por: Heckel, Reinhard, et al.
Publicado: (2013) -
Detecting controlling nodes of boolean regulatory networks
por: Schober, Steffen, et al.
Publicado: (2011) -
Contractibility of a persistence map preimage
por: Cyranka, Jacek, et al.
Publicado: (2020) -
Staging Prostate Cancer with (68)Ga-PSMA-11 PET/CT in the Elderly: Is Preimaging Biopsy Imperative?
por: Kesler, Mikhail, et al.
Publicado: (2023)