Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Background: Transcriptional gene regulation is one of the most important mechanisms in controlling many essential cellular processes, including cell development, cell-cycle control, and the cellular response to variations in environmental conditions. Genes are regulated by transcription factors and other genes/proteins via a complex interconnection network. Such regulatory links may be predicted using microarray expression data, but most regulation models suppose transcription factor independence, which leads to spurious links when many genes have highly correlated expression levels. Results: We propose a new algorithm to infer combinatorial control networks from gene-expression data. Based on a simple model of combinatorial gene regulation, it includes a message-passing approach which avoids explicit sampling over putative gene-regulatory networks. This algorithm is shown to recover the structure of a simple artificial cell-cycle network model for baker's yeast. It is then applied to a large-scale yeast gene expression dataset in order to identify combinatorial regulations, and to a data set of direct medical interest, namely the Pleiotropic Drug Resistance (PDR) network. Conclusions: The algorithm we designed is able to recover biologically meaningful interactions, as shown by recent experimental results [1]. Moreover, new cases of combinatorial control are predicted, showing how simple models taking this phenomenon into account can lead to informative predictions and allow to extract more putative regulatory interactions from microarray databases.
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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“The belief propagation (BP) algorithm is exact on tree-like graphical models, but it has been extensively used as an heuristic procedure to solve problems defined on sparse graphs [57,58].”
A genomic regulatory network for development
Davidson, E. H., Rast, J. P., Oliveri, P., Ransick, A., Calestani, C., Yuh, C.-H., Minokawa, T., Amore, G., Hinman, V., Arenas-Mena, C., et al. (2002) · Science · doi:10.1126/science.1069883 · Cited by 1,567 · cited 1×
“For higher organisms, the knowledge is restricted to intensively studied small functional modules, see e.g. [9,10].”
BackgroundInferring Genetic Networks and Identifying Compound Mode of Action via Expression Profiling
Gardner, T. S., di Bernardo, D., Lorenz, D., & Collins, J. J. (2003) · Science · doi:10.1126/science.1081900 · Cited by 1,117
A post-translational modification code for transcription factors: sorting through a sea of signals
Benayoun, B. A., & Veitia, R. A. (2009) · Trends in Cell Biology · doi:10.1016/j.tcb.2009.02.003 · Cited by 121
Cited by
Passing Messages between Biological Networks to Refine Predicted Interactions
Glass, K., Huttenhower, C., Quackenbush, J., & Yuan, G.-C. (2013) · PLoS ONE · doi:10.1371/journal.pone.0064832 · Cited by 266
“sion data alone [37,38], to estimate signaling pathways by”
Inverse statistical problems: from the inverse Ising problem to data science
Nguyen, H. C., Zecchina, R., & Berg, J. (2017) · Advances in Physics · doi:10.1080/00018732.2017.1341604 · Cited by 258
Self-citationRevealing disease-associated pathways by network integration of untargeted metabolomics
Pirhaji, L., Milani, P., Leidl, M., Curran, T., Avila-Pacheco, J., Clish, C. B., White, F. M., Saghatelian, A., & Fraenkel, E. (2016) · Nature Methods · doi:10.1038/nmeth.3940 · Cited by 167
Reverse engineering and analysis of large genome-scale gene networks
Aluru, M., Zola, J., Nettleton, D., & Aluru, S. (2013) · Nucleic Acids Research · doi:10.1093/nar/gks904 · Cited by 34
Metadata
- Authors
- Bailly-Bechet, M., Braunstein, A., Pagnani, A., Weigt, M., & Zecchina, R.
- Venue
- BMC Bioinformatics
- Published
- 2010-06-29
- Volume
- 11
- Issue
- 1
- Pages
- 355-355
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2120801957
- Cited by
- 41
- References
- 4
- FWCI
- 1.77
- Type
- journal article
- Language
- en
- Open access
- gold
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: Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach. https://app.cochat.ai/papers/10.1186/1471-2105-11-355
- The paper
- Bailly-Bechet, M., Braunstein, A., Pagnani, A., Weigt, M., & Zecchina, R. (2010). Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-11-355
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.