On the Impact of Entropy Estimation on Transcriptional Regulatory Network Inference Based on Mutual Information
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
The reverse engineering of transcription regulatory networks from expression data is gaining large interest in the bioinformatics community. An important family of inference techniques is represented by algorithms based on information theoretic measures which rely on the computation of pairwise mutual information. This paper aims to study the impact of the entropy estimator on the quality of the inferred networks. This is done by means of a comprehensive study which takes into consideration three state-of-the-art mutual information algorithms: ARACNE, CLR, and MRNET. Two different setups are considered in this work. The first one considers a set of 12 synthetically generated datasets to compare 8 different entropy estimators and three network inference algorithms. The two methods emerging as the most accurate ones from the first set of experiments are the MRNET method combined with the newly applied Spearman correlation and the CLR method combined with the Pearson correlation. The validation of these two techniques is then carried out on a set of 10 public domain microarray datasets measuring the transcriptional regulatory activity in the yeast organism.
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
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
Beyond Accuracy, F-Score and ROC: A Family of Discriminant Measures for Performance Evaluation
Sokolova, M., Japkowicz, N., & Szpakowicz, S. (2006) · Lecture Notes in Computer Science · doi:10.1007/11941439_114 · Cited by 1,974
Estimation of entropy and mutual information
Paninski, L. (2003) · Neural Computation · doi:10.1162/089976603321780272 · Cited by 1,442 · cited 2×
“It has been shown in [10] that the asymptotic bias of this estimator amounts to bias”
The mutual information: detecting and evaluating dependencies between variables
Steuer, R., Kurths, J., Daub, C. O., Weise, J., & Selbig, J. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.suppl_2.s231 · Cited by 815
Gasch, A. P., Huang, M., Metzner, S., Botstein, D., Elledge, S. J., & Brown, P. O. (2001) · Molecular Biology of the Cell · doi:10.1091/mbc.12.10.2987 · Cited by 542
Cited by
Gene Regulatory Network Inference from Single-Cell Data Using Multivariate Information Measures
Chan, T. E., Stumpf, M. P. H., & Babtie, A. C. (2017) · Cell Systems · doi:10.1016/j.cels.2017.08.014 · Cited by 578
Computational methods for Gene Regulatory Networks reconstruction and analysis: A review
Delgado, F. M., & Gómez-Vela, F. (2019) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2018.10.006 · Cited by 206
“Among the main proposals based on this model for GRN reconstruction we can highlight: REVEAL (The REVerse Engineering ALgorithm) [39]; RELEVANCE [40]; ARACNE (Algorithm for the Reverse engineering of Accurate Cellular Network) [41] or ARACNE-based algorithms [42]; CLR (Context Likelihood of Relatedness) [43]; MRNET (b…”
MethodInfluentialDistributed Variational Representation Learning
Aguerri, I. E., & Zaidi, A. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2928806 · Cited by 84
“Perhaps, this justifies partially why mutual information (or, equivalently, the corresponding loss function which is the log-loss fidelity measure) is widely used in learning theory and has already been adopted inmany algorithms in practice such as the infomax criterion [6], the tree-based algorithm of [7] or the well…”
MethodWexler, E. M., Rosen, E., Lu, D., Osborn, G. E., Martin, E., Raybould, H., & Geschwind, D. H. (2011) · Science Signaling · doi:10.1126/scisignal.2002282 · Cited by 56
“For example, time series data are often mathematically nonstationary and show autocorrelation, creating nonlinearities or discontinuities in the data, which limit the use of many statistical techniques that assume fixed or Gaussian probability distributions (47).”
Background
Metadata
- Authors
- Olsen, C., Meyer, P. E., & Bontempi, G.
- Venue
- EURASIP Journal on Bioinformatics and Systems Biology
- Published
- 2009
- Volume
- 2009
- Pages
- 1-9
- ISSN
- 1687-4145 (ISSN-L)
- 1687-4153
- OpenAlex
- W2079517420
- Cited by
- 78
- References
- 5
- FWCI
- 2.40
- Type
- journal article
- Language
- en
- Open access
- green
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.