The DOI matches its Crossref record.
Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks
Open accessAbstract
Motivation: Our goal is to construct a model for genetic regulatory networks such that the model class: (i) incorporates rule-based dependencies between genes; (ii) allows the systematic study of global network dynamics; (iii) is able to cope with uncertainty, both in the data and the model selection; and (iv) permits the quantification of the relative influence and sensitivity of genes in their interactions with other genes. Results: We introduce Probabilistic Boolean Networks (PBN) that share the appealing rule-based properties of Boolean networks, but are robust in the face of uncertainty. We show how the dynamics of these networks can be studied in the probabilistic context of Markov chains, with standard Boolean networks being special cases. Then, we discuss the relationship between PBNs and Bayesian networks—a family of graphical models that explicitly represent probabilistic relationships between variables. We show how probabilistic dependencies between a gene and its parent genes, constituting the basic building blocks of Bayesian networks, can be obtained from PBNs. Finally, we present methods for quantifying the influence of genes on other genes, within the context of PBNs. Examples illustrating the above concepts are presented throughout the paper. Contact: is@ieee.org
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Modelling and analysis of gene regulatory networks
Karlebach, G., & Shamir, R. (2008) · Nature Reviews Molecular Cell Biology · doi:10.1038/nrm2503 · Cited by 1,296
Controllability and observability of Boolean control networks
Cheng, D., & Qi, H. (2009) · Automatica · doi:10.1016/j.automatica.2009.03.006 · Cited by 770
A Linear Representation of Dynamics of Boolean Networks
Cheng, D., & Qi, H. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2043294 · Cited by 697
Control of Boolean networks: Hardness results and algorithms for tree structured networks
Akutsu, T., Hayashida, M., Ching, W.-K., & Ng, M. K. (2007) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2006.09.023 · Cited by 572
Comparison of co-expression measures: mutual information, correlation, and model based indices
Song, L., Langfelder, P., & Horvath, S. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-328 · Cited by 460
Metadata
- Authors
- Shmulevich, I., Dougherty, E. R., Kim, S., & Zhang, W.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-02-01
- Volume
- 18
- Issue
- 2
- Pages
- 261-274
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2160533336
- Cited by
- 1,608
- References
- 0
- FWCI
- 11.88
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks. https://app.cochat.ai/papers/10.1093/bioinformatics/18.2.261
- The paper
- Shmulevich, I., Dougherty, E. R., Kim, S., & Zhang, W. (2002). Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks. Bioinformatics. https://doi.org/10.1093/bioinformatics/18.2.261
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.