HAMSTER: visualizing microarray experiments as a set of minimum spanning trees

被引:1
|
作者
Wan, Raymond [1 ,2 ]
Kiseleva, Larisa [2 ]
Harada, Hajime [2 ]
Mamitsuka, Hiroshi [1 ]
Horton, Paul [2 ]
机构
[1] Kyoto Univ, Bioinformat Ctr, Inst Chem Res, Uji, Kyoto 6110011, Japan
[2] AIST, Computat Biol Res Ctr, Koto Ku, Tokyo 1350064, Japan
来源
基金
日本学术振兴会; 日本科学技术振兴机构;
关键词
D O I
10.1186/1751-0473-4-8
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: Visualization tools allow researchers to obtain a global view of the interrelationships between the probes or experiments of a gene expression (e.g. microarray) data set. Some existing methods include hierarchical clustering and k-means. In recent years, others have proposed applying minimum spanning trees (MST) for microarray clustering. Although MST-based clustering is formally equivalent to the dendrograms produced by hierarchical clustering under certain conditions; visually they can be quite different. Methods: HAMSTER (Helpful Abstraction using Minimum Spanning Trees for Expression Relations) is an open source system for generating a set of MSTs from the experiments of a microarray data set. While previous works have generated a single MST from a data set for data clustering, we recursively merge experiments and repeat this process to obtain a set of MSTs for data visualization. Depending on the parameters chosen, each tree is analogous to a snapshot of one step of the hierarchical clustering process. We scored and ranked these trees using one of three proposed schemes. HAMSTER is implemented in C++ and makes use of Graphviz for laying out each MST. Results: We report on the running time of HAMSTER and demonstrate using data sets from the NCBI Gene Expression Omnibus (GEO) that the images created by HAMSTER offer insights that differ from the dendrograms of hierarchical clustering. In addition to the C++ program which is available as open source, we also provided a web-based version (HAMSTER+) which allows users to apply our system through a web browser without any computer programming knowledge. Conclusion: Researchers may find it helpful to include HAMSTER in their microarray analysis workflow as it can offer insights that differ from hierarchical clustering. We believe that HAMSTER would be useful for certain types of gradient data sets (e.g time-series data) and data that indicate relationships between cells/tissues.
引用
收藏
页数:18
相关论文
共 50 条
  • [1] Visualizing evolving networks: Minimum spanning trees versus Pathfinder networks
    Chen, CM
    Morris, S
    INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2003, PROCEEDINGS, 2003, : 67 - 74
  • [2] On generalized minimum spanning trees
    Feremans, C
    Labbé, M
    Laporte, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 134 (02) : 457 - 458
  • [3] The minimum labeling spanning trees
    Chang, RS
    Leu, SJ
    INFORMATION PROCESSING LETTERS, 1997, 63 (05) : 277 - 282
  • [4] On partitioning minimum spanning trees
    Guttmann-Beck, Nili
    Hassin, Refael
    Stern, Michal
    DISCRETE APPLIED MATHEMATICS, 2024, 359 : 45 - 54
  • [5] Successive minimum spanning trees
    Janson, Svante
    Sorkin, Gregory B.
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (01) : 126 - 172
  • [6] The saga of minimum spanning trees
    Mares, Martin
    COMPUTER SCIENCE REVIEW, 2008, 2 (03) : 165 - 221
  • [7] CLUSTERING WITH MINIMUM SPANNING TREES
    Zhou, Yan
    Grygorash, Oleksandr
    Hain, Thomas F.
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2011, 20 (01) : 139 - 177
  • [8] On Steiner trees and minimum spanning trees in hypergraphs
    Polzin, T
    Daneshmand, SV
    OPERATIONS RESEARCH LETTERS, 2003, 31 (01) : 12 - 20
  • [9] On Sorting, Heaps, and Minimum Spanning Trees
    Navarro, Gonzalo
    Paredes, Rodrigo
    ALGORITHMICA, 2010, 57 (04) : 585 - 620
  • [10] Increasing the weight of minimum spanning trees
    Frederickson, GN
    SolisOba, R
    PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 539 - 546