MIST: Maximum Information Spanning Trees for dimension reduction of biological data sets
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Motivation: The study of complex biological relationships is aided by large and high-dimensional data sets whose analysis often involves dimension reduction to highlight representative or informative directions of variation. In principle, information theory provides a general framework for quantifying complex statistical relationships for dimension reduction. Unfortunately, direct estimation of high-dimensional information theoretic quantities, such as entropy and mutual information (MI), is often unreliable given the relatively small sample sizes available for biological problems. Here, we develop and evaluate a hierarchy of approximations for high-dimensional information theoretic statistics from associated low-order terms, which can be more reliably estimated from limited samples. Due to a relationship between this metric and the minimum spanning tree over a graph representation of the system, we refer to these approximations as MIST (Maximum Information Spanning Trees). Results: The MIST approximations are examined in the context of synthetic networks with analytically computable entropies and using experimental gene expression data as a basis for the classification of multiple cancer types. The approximations result in significantly more accurate estimates of entropy and MI, and also correlate better with biological classification error than direct estimation and another low-order approximation, minimum-redundancy–maximum-relevance (mRMR). Availability: Software to compute the entropy approximations described here is available as Supplementary Material. Contact: tidor@mit.edu 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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Estimation of entropy and mutual information
Paninski, L. (2003) · Neural Computation · doi:10.1162/089976603321780272 · Cited by 1,442
Cited by
The minimum spanning tree: An unbiased method for brain network analysis
Tewarie, P., van Dellen, E., Hillebrand, A., & Stam, C. J. (2015) · NeuroImage · doi:10.1016/j.neuroimage.2014.10.015 · Cited by 345
Sloppy models, parameter uncertainty, and the role of experimental design
Apgar, J. F., Witmer, D. K., White, F. M., & Tidor, B. (2010) · Molecular BioSystems · doi:10.1039/b918098b · Cited by 146
Self-citationCHARMM at 45: Enhancements in Accessibility, Functionality, and Speed
Hwang, W., Austin, S. L., Blondel, A., Boittier, E. D., Boresch, S., Buck, M., Buckner, J., Caflisch, A., Chang, H.-T., Cheng, X., et al. (2024) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.4c04100 · Cited by 136
(2023) · doi:10.1038/s41467-023-41586-y · Cited by 118
Metadata
- Authors
- King, B. M., & Tidor, B.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2009-03-04
- Volume
- 25
- Issue
- 9
- Pages
- 1165-1172
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2144886570
- Cited by
- 92
- References
- 2
- FWCI
- 1.08
- 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: MIST: Maximum Information Spanning Trees for dimension reduction of biological data sets. https://app.cochat.ai/papers/10.1093/bioinformatics/btp109
- The paper
- King, B. M., & Tidor, B. (2009). MIST: Maximum Information Spanning Trees for dimension reduction of biological data sets. Bioinformatics. https://doi.org/10.1093/bioinformatics/btp109
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.