The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees
Open accessAbstract
Motivation: Gene expression data clustering provides a powerful tool for studying functional relationships of genes in a biological process. Identifying correlated expression patterns of genes represents the basic challenge in this clustering problem. Results: This paper describes a new framework for representing a set of multi-dimensional gene expression data as a Minimum Spanning Tree (MST), a concept from the graph theory. A key property of this representation is that each cluster of the expression data corresponds to one subtree of the MST, which rigorously converts a multi-dimensional clustering problem to a tree partitioning problem. We have demonstrated that though the inter-data relationship is greatly simplified in the MST representation, no essential information is lost for the purpose of clustering. Two key advantages in representing a set of multi-dimensional data as an MST are: (1) the simple structure of a tree facilitates efficient implementations of rigorous clustering algorithms, which otherwise are highly computationally challenging; and (2) as an MST-based clustering does not depend on detailed geometric shape of a cluster, it can overcome many of the problems faced by classical clustering algorithms. Based on the MST representation, we have developed a number of rigorous and efficient clustering algorithms, including two with guaranteed global optimality. We have implemented these algorithms as a computer software EXpression data Clustering Analysis and VisualizATiOn Resource (EXCAVATOR). To demonstrate its effectiveness, we have tested it on three data sets, i.e. expression data from yeast Saccharomyces cerevisiae , expression data in response of human fibroblasts to serum, and Arabidopsis expression data in response to chitin elicitation. The test results are highly encouraging. Availability: EXCAVATOR is available on request from the authors. Contact: xyn@ornl.gov * To whom correspondence should be addressed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cluster analysis and display of genome-wide expression patterns
Eisen, M. B., Spellman, P. T., Brown, P. O., & Botstein, D. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.25.14863 · Cited by 16,184
The Scree Test For The Number Of Factors
Cattell, R. B. (1966) · Multivariate Behavioral Research · doi:10.1207/s15327906mbr0102_10 · Cited by 13,554
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Tamayo, P., Slonim, D., Mesirov, J., Zhu, Q., Kitareewan, S., Dmitrovsky, E., Lander, E. S., & Golub, T. R. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.6.2907 · Cited by 2,923
The Transcriptional Program in the Response of Human Fibroblasts to Serum
Iyer, V. R., Eisen, M. B., Ross, D. T., Schuler, G., Moore, T., Lee, J. C. F., Trent, J. M., Staudt, L. M., Hudson, J., Boguski, M. S., et al. (1999) · Science · doi:10.1126/science.283.5398.83 · Cited by 1,965
Percival, D. B. (1989) · Technometrics · doi:10.1080/00401706.1989.10488494 · Cited by 1,234
Minimum Spanning Trees and Single Linkage Cluster Analysis
Gower, J. C., & Ross, G. J. S. (1969) · Applied Statistics · doi:10.2307/2346439 · Cited by 1,223
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.2307/2033241 · Cited by 1,117
Large-scale temporal gene expression mapping of central nervous system development
Wen, X., Fuhrman, S., Michaels, G. S., Carr, D. B., Smith, S., Barker, J. L., & Somogyi, R. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.1.334 · Cited by 648
Mathematical Classification and Clustering
Mirkin, B. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600836 · Cited by 563
Mathematical Classification and Clustering
Mirkin, B. (1996) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4613-0457-9 · Cited by 464
Analysis of large-scale gene expression data
Sherlock, G. (2000) · Current Opinion in Immunology · doi:10.1016/s0952-7915(99)00074-6 · Cited by 365
Large-Scale Clustering of cDNA-Fingerprinting Data
Herwig, R., Poustka, A. J., Müller, C., Bull, C., Lehrach, H., & O'Brien, J. (1999) · Genome Research · doi:10.1101/gr.9.11.1093 · Cited by 221
Microarray analysis of chitin elicitation in Arabidopsis thaliana
Ramonell, K. M., Zhang, B., Ewing, R. M., Chen, Y., Xu, D. H., Stacey, G. S., & Somerville, S. C. (2002) · Molecular Plant Pathology · doi:10.1046/j.1364-3703.2002.00123.x · Cited by 134
Self-citation
Cited by
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Bouziat, R., Hinterleitner, R., Brown, J. J., Stencel-Baerenwald, J. E., Ikizler, M., Mayassi, T., Meisel, M., Kim, S. M., Discepolo, V., Pruijssers, A. J., et al. (2017) · Science · doi:10.1126/science.aah5298 · Cited by 448
QUBIC: a qualitative biclustering algorithm for analyses of gene expression data
Li, G., Ma, Q., Tang, H., Paterson, A. H., & Xu, Y. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkp491 · Cited by 267
Self-citation
Metadata
- Authors
- Xu, Y., Olman, V., & Xu, D.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-04-01
- Volume
- 18
- Issue
- 4
- Pages
- 536-545
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2127284416
- Cited by
- 295
- References
- 19
- FWCI
- 5.29
- 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.