• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

仓鼠:将微阵列实验可视化为一组最小生成树。

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

作者信息

Wan Raymond, Kiseleva Larisa, Harada Hajime, Mamitsuka Hiroshi, Horton Paul

机构信息

Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, 611-0011, Japan.

出版信息

Source Code Biol Med. 2009 Nov 20;4:8. doi: 10.1186/1751-0473-4-8.

DOI:10.1186/1751-0473-4-8
PMID:19925686
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC2784758/
Abstract

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. Both the source and the web server variant of HAMSTER are available from http://hamster.cbrc.jp/.

摘要

背景

可视化工具使研究人员能够全面了解基因表达(如微阵列)数据集的探针或实验之间的相互关系。一些现有方法包括层次聚类和k均值聚类。近年来,其他人提出将最小生成树(MST)应用于微阵列聚类。虽然基于MST的聚类在某些条件下与层次聚类产生的树状图形式上等效;但在视觉上它们可能有很大不同。

方法

HAMSTER(使用最小生成树进行表达关系的有用抽象)是一个开源系统,用于从微阵列数据集的实验中生成一组MST。虽然以前的工作从数据集中生成单个MST用于数据聚类,但我们递归合并实验并重复此过程以获得一组用于数据可视化的MST。根据所选参数,每棵树类似于层次聚类过程中一个步骤的快照。我们使用三种提议的方案之一对这些树进行评分和排序。HAMSTER用C++实现,并利用Graphviz来布局每个MST。

结果

我们报告了HAMSTER的运行时间,并使用来自NCBI基因表达综合数据库(GEO)的数据集进行演示,结果表明HAMSTER创建的图像提供了与层次聚类树状图不同的见解。除了作为开源提供的C++程序外,我们还提供了一个基于网络的版本(HAMSTER+),允许用户通过网络浏览器应用我们的系统,而无需任何计算机编程知识。

结论

研究人员可能会发现将HAMSTER纳入其微阵列分析工作流程中很有帮助,因为它可以提供与层次聚类不同的见解。我们相信HAMSTER对于某些类型的梯度数据集(如时间序列数据)以及表明细胞/组织之间关系的数据将是有用的。HAMSTER的源代码和网络服务器版本均可从http://hamster.cbrc.jp/获得。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/553c2df70de7/1751-0473-4-8-18.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/dc146bad5a4a/1751-0473-4-8-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/2ffa87939e66/1751-0473-4-8-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/372b3830f4e7/1751-0473-4-8-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/3d9c05d78394/1751-0473-4-8-4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/c370d937a8ba/1751-0473-4-8-5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/6bf076eaf4b7/1751-0473-4-8-6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/de741c2254a9/1751-0473-4-8-7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/8901bd870a3f/1751-0473-4-8-8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/8015431a2487/1751-0473-4-8-9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/5c35f76937d2/1751-0473-4-8-10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/2912ed6a9fb3/1751-0473-4-8-11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/88ab239fb781/1751-0473-4-8-12.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/9795aeff3e80/1751-0473-4-8-13.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/625750c11603/1751-0473-4-8-14.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/e45caad7babb/1751-0473-4-8-15.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/4435d79b9cc1/1751-0473-4-8-16.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/7301c1f40b30/1751-0473-4-8-17.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/553c2df70de7/1751-0473-4-8-18.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/dc146bad5a4a/1751-0473-4-8-1.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/2ffa87939e66/1751-0473-4-8-2.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/372b3830f4e7/1751-0473-4-8-3.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/3d9c05d78394/1751-0473-4-8-4.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/c370d937a8ba/1751-0473-4-8-5.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/6bf076eaf4b7/1751-0473-4-8-6.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/de741c2254a9/1751-0473-4-8-7.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/8901bd870a3f/1751-0473-4-8-8.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/8015431a2487/1751-0473-4-8-9.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/5c35f76937d2/1751-0473-4-8-10.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/2912ed6a9fb3/1751-0473-4-8-11.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/88ab239fb781/1751-0473-4-8-12.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/9795aeff3e80/1751-0473-4-8-13.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/625750c11603/1751-0473-4-8-14.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/e45caad7babb/1751-0473-4-8-15.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/4435d79b9cc1/1751-0473-4-8-16.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/7301c1f40b30/1751-0473-4-8-17.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0f79/2784758/553c2df70de7/1751-0473-4-8-18.jpg

相似文献

1
HAMSTER: visualizing microarray experiments as a set of minimum spanning trees.仓鼠:将微阵列实验可视化为一组最小生成树。
Source Code Biol Med. 2009 Nov 20;4:8. doi: 10.1186/1751-0473-4-8.
2
Hierarchical clustering in minimum spanning trees.最小生成树中的层次聚类。
Chaos. 2015 Feb;25(2):023107. doi: 10.1063/1.4908014.
3
Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees.使用图论方法对基因表达数据进行聚类:最小生成树的应用
Bioinformatics. 2002 Apr;18(4):536-45. doi: 10.1093/bioinformatics/18.4.536.
4
Minimum spanning trees for gene expression data clustering.用于基因表达数据聚类的最小生成树
Genome Inform. 2001;12:24-33.
5
Functional grouping of similar genes using eigenanalysis on minimum spanning tree based neighborhood graph.基于最小生成树邻域图的特征分析对相似基因进行功能分组。
Comput Biol Med. 2016 Apr 1;71:135-48. doi: 10.1016/j.compbiomed.2016.02.007. Epub 2016 Feb 21.
6
A dynamically growing self-organizing tree (DGSOT) for hierarchical clustering gene expression profiles.一种用于分层聚类基因表达谱的动态生长自组织树(DGSOT)。
Bioinformatics. 2004 Nov 1;20(16):2605-17. doi: 10.1093/bioinformatics/bth292. Epub 2004 May 6.
7
Not seeing the forest for the trees: size of the minimum spanning trees (MSTs) forest and branch significance in MST-based phylogenetic analysis.只见树木不见森林:基于最小生成树(MST)的系统发育分析中最小生成树森林的大小及分支意义
PLoS One. 2015 Mar 23;10(3):e0119315. doi: 10.1371/journal.pone.0119315. eCollection 2015.
8
Parallel clustering algorithm for large data sets with applications in bioinformatics.用于大数据集的并行聚类算法及其在生物信息学中的应用
IEEE/ACM Trans Comput Biol Bioinform. 2009 Apr-Jun;6(2):344-52. doi: 10.1109/TCBB.2007.70272.
9
GEO2Enrichr: browser extension and server app to extract gene sets from GEO and analyze them for biological functions.GEO2Enrichr:用于从基因表达综合数据库(GEO)中提取基因集并分析其生物学功能的浏览器扩展程序和服务器应用程序。
Bioinformatics. 2015 Sep 15;31(18):3060-2. doi: 10.1093/bioinformatics/btv297. Epub 2015 May 13.
10
K-ary clustering with optimal leaf ordering for gene expression data.用于基因表达数据的具有最优叶排序的K元聚类
Bioinformatics. 2003 Jun 12;19(9):1070-8. doi: 10.1093/bioinformatics/btg030.

本文引用的文献

1
Parallel clustering algorithm for large data sets with applications in bioinformatics.用于大数据集的并行聚类算法及其在生物信息学中的应用
IEEE/ACM Trans Comput Biol Bioinform. 2009 Apr-Jun;6(2):344-52. doi: 10.1109/TCBB.2007.70272.
2
Cell identity mediates the response of Arabidopsis roots to abiotic stress.细胞身份介导拟南芥根对非生物胁迫的响应。
Science. 2008 May 16;320(5878):942-5. doi: 10.1126/science.1153795. Epub 2008 Apr 24.
3
Detection of a microRNA signal in an in vivo expression set of mRNAs.在体内表达的 mRNA 集合中检测 microRNA 信号。
PLoS One. 2007 Aug 29;2(8):e804. doi: 10.1371/journal.pone.0000804.
4
Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes.用于检测所有疾病聚集形状的密度均衡欧几里得最小生成树
Proc Natl Acad Sci U S A. 2007 May 29;104(22):9404-9. doi: 10.1073/pnas.0609457104. Epub 2007 May 22.
5
Creatine improves health and survival of mice.肌酸可改善小鼠的健康状况并提高其存活率。
Neurobiol Aging. 2008 Sep;29(9):1404-11. doi: 10.1016/j.neurobiolaging.2007.03.001. Epub 2007 Apr 9.
6
NCBI GEO: mining tens of millions of expression profiles--database and tools update.NCBI基因表达综合数据库:挖掘数千万个表达谱——数据库与工具更新
Nucleic Acids Res. 2007 Jan;35(Database issue):D760-5. doi: 10.1093/nar/gkl887. Epub 2006 Nov 11.
7
Evaluation and comparison of gene clustering methods in microarray analysis.微阵列分析中基因聚类方法的评估与比较
Bioinformatics. 2006 Oct 1;22(19):2405-12. doi: 10.1093/bioinformatics/btl406. Epub 2006 Jul 31.
8
Iterative class discovery and feature selection using Minimal Spanning Trees.使用最小生成树的迭代类发现和特征选择
BMC Bioinformatics. 2004 Sep 8;5:126. doi: 10.1186/1471-2105-5-126.
9
CUBIC: identification of regulatory binding sites through data clustering.CUBIC:通过数据聚类识别调控结合位点。
J Bioinform Comput Biol. 2003 Apr;1(1):21-40. doi: 10.1142/s0219720003000162.
10
Open source clustering software.开源聚类软件。
Bioinformatics. 2004 Jun 12;20(9):1453-4. doi: 10.1093/bioinformatics/bth078. Epub 2004 Feb 10.