Inferring Boolean network structure via correlation
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Motivation: Accurate, context-specific regulation of gene expression is essential for all organisms. Accordingly, it is very important to understand the complex relations within cellular gene regulatory networks. A tool to describe and analyze the behavior of such networks are Boolean models. The reconstruction of a Boolean network from biological data requires identification of dependencies within the network. This task becomes increasingly computationally demanding with large amounts of data created by recent high-throughput technologies. Thus, we developed a method that is especially suited for network structure reconstruction from large-scale data. In our approach, we took advantage of the fact that a specific transcription factor often will consistently either activate or inhibit a specific target gene, and this kind of regulatory behavior can be modeled using monotone functions. Results: To detect regulatory dependencies in a network, we examined how the expression of different genes correlates to successive network states. For this purpose, we used Pearson correlation as an elementary correlation measure. Given a Boolean network containing only monotone Boolean functions, we prove that the correlation of successive states can identify the dependencies in the network. This method not only finds dependencies in randomly created artificial networks to very high percentage, but also reconstructed large fractions of both a published Escherichia coli regulatory network from simulated data and a yeast cell cycle network from real microarray data. Contact: hans.kestler@uni-ulm.de Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
An Introduction to Systems Biology: Design Principles of Biological Circuits
Alon, U. (2006) · doi:10.1201/9781420011432 · Cited by 2,825
Integrating high-throughput and computational data elucidates bacterial networks
Covert, M. W., Knight, E. M., Reed, J. L., Herrgard, M. J., & Palsson, B. O. (2004) · Nature · doi:10.1038/nature02456 · Cited by 792
Cited by
Herrmann, F., Groß, A., Zhou, D., Kestler, H. A., & Kühl, M. (2012) · PLoS ONE · doi:10.1371/journal.pone.0046798 · Cited by 79
Self-citationRepresenting dynamic biological networks with multi-scale probabilistic models
Groß, A., Kracher, B., Kraus, J. M., Kühlwein, S. D., Pfister, A. S., Wiese, S., Luckert, K., Pötz, O., Joos, T., Van Daele, D., et al. (2019) · Communications Biology · doi:10.1038/s42003-018-0268-3 · Cited by 32
Self-citationLeveraging quantum computing for dynamic analyses of logical networks in systems biology
Weidner, F. M., Schwab, J. D., Wölk, S., Rupprecht, F., Ikonomi, N., Werle, S. D., Hoffmann, S., Kühl, M., & Kestler, H. A. (2023) · Patterns · doi:10.1016/j.patter.2023.100705 · Cited by 21
“9,10,12 In this case, the expression counts could be rescaled toward the (0,1) interval and used to obtain a more realistic weighting of basins.”
MethodSelf-citation
Metadata
- Authors
- Maucher, M., Kracher, B., Kühl, M., & Kestler, H. A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2011-04-05
- Volume
- 27
- Issue
- 11
- Pages
- 1529-1536
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2138922092
- Cited by
- 47
- References
- 3
- FWCI
- 1.18
- 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
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.