Inferring gene regulatory networks from time series data using the minimum description length principle
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Motivation: A central question in reverse engineering of genetic networks consists in determining the dependencies and regulating relationships among genes. This paper addresses the problem of inferring genetic regulatory networks from time-series gene-expression profiles. By adopting a probabilistic modeling framework compatible with the family of models represented by dynamic Bayesian networks and probabilistic Boolean networks, this paper proposes a network inference algorithm to recover not only the direct gene connectivity but also the regulating orientations. Results: Based on the minimum description length principle, a novel network inference algorithm is proposed that greatly shrinks the search space for graphical solutions and achieves a good trade-off between modeling complexity and data fitting. Simulation results show that the algorithm achieves good performance in the case of synthetic networks. Compared with existing state-of-the-art results in the literature, the proposed algorithm exceptionally excels in efficiency, accuracy, robustness and scalability. Given a time-series dataset for Drosophila melanogaster, the paper proposes a genetic regulatory network involved in Drosophila's muscle development. Availability: Available from the authors upon request. Contact: wtzhao@ece.tamu.edu
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
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Margolin, A. A., Nemenman, I., Basso, K., Wiggins, C., Stolovitzky, G., Favera, R. D., & Califano, A. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-s1-s7 · Cited by 2,420
Estimation of entropy and mutual information
Paninski, L. (2003) · Neural Computation · doi:10.1162/089976603321780272 · Cited by 1,442 · cited 2×
“Recent progress in estimating information theoretic quantities has led to a number of good estimators in this regard (Beirlant et al ., 1997; Paninski, 2003, 2004; Treves and Panzeri, 1995).”
A model for reasoning about persistence and causation
Dean, T., & Kanazawa, K. (1989) · Computational Intelligence · doi:10.1111/j.1467-8640.1989.tb00324.x · Cited by 999
Cited by
Cultural Confusions Show that Facial Expressions Are Not Universal
Jack, R. E., Blais, C., Scheepers, C., Schyns, P. G., & Caldara, R. (2009) · Current Biology · doi:10.1016/j.cub.2009.07.051 · Cited by 602
Saez‐Rodriguez, J., Alexopoulos, L. G., Epperlein, J., Samaga, R., Lauffenburger, D. A., Klamt, S., & Sorger, P. K. (2009) · Molecular Systems Biology · doi:10.1038/msb.2009.87 · Cited by 351
A review on the computational approaches for gene regulatory network construction
Chai, L. E., Loh, S. K., Low, S. T., Mohamad, M. S., Deris, S., & Zakaria, Z. (2014) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2014.02.011 · Cited by 265
Zoppoli, P., Morganella, S., & Ceccarelli, M. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-154 · Cited by 248
Ramsey, S. A., Klemm, S. L., Zak, D. E., Kennedy, K. A., Thorsson, V., Li, B., Gilchrist, M., Gold, E. S., Johnson, C. D., Litvak, V., et al. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000021 · Cited by 147
Integrated information as a measure of cognitive processes in coupled genetic repressilators
Abrego, L., & Zaikin, A. (2019) · Entropy · doi:10.3390/e21040382 · Cited by 5
Metadata
- Authors
- Zhao, W., Serpedin, E., & Dougherty, E. R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-07-15
- Volume
- 22
- Issue
- 17
- Pages
- 2129-2135
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2040575507
- Cited by
- 149
- References
- 4
- FWCI
- 5.40
- Type
- journal article
- Language
- en
- Open access
- closed
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.