首页> 外文期刊>BMC Bioinformatics >Nearest Neighbor Networks: clustering expression data based on gene neighborhoods
【24h】

Nearest Neighbor Networks: clustering expression data based on gene neighborhoods

机译:最近的邻居网络:基于基因邻域对表达数据进行聚类

获取原文
           

摘要

Background The availability of microarrays measuring thousands of genes simultaneously across hundreds of biological conditions represents an opportunity to understand both individual biological pathways and the integrated workings of the cell. However, translating this amount of data into biological insight remains a daunting task. An important initial step in the analysis of microarray data is clustering of genes with similar behavior. A number of classical techniques are commonly used to perform this task, particularly hierarchical and K-means clustering, and many novel approaches have been suggested recently. While these approaches are useful, they are not without drawbacks; these methods can find clusters in purely random data, and even clusters enriched for biological functions can be skewed towards a small number of processes (e.g. ribosomes). Results We developed Nearest Neighbor Networks (NNN), a graph-based algorithm to generate clusters of genes with similar expression profiles. This method produces clusters based on overlapping cliques within an interaction network generated from mutual nearest neighborhoods. This focus on nearest neighbors rather than on absolute distance measures allows us to capture clusters with high connectivity even when they are spatially separated, and requiring mutual nearest neighbors allows genes with no sufficiently similar partners to remain unclustered. We compared the clusters generated by NNN with those generated by eight other clustering methods. NNN was particularly successful at generating functionally coherent clusters with high precision, and these clusters generally represented a much broader selection of biological processes than those recovered by other methods. Conclusion The Nearest Neighbor Networks algorithm is a valuable clustering method that effectively groups genes that are likely to be functionally related. It is particularly attractive due to its simplicity, its success in the analysis of large datasets, and its ability to span a wide range of biological functions with high precision.
机译:背景技术可以在数百种生物学条件下同时测量数千种基因的微阵列,为了解单个生物途径和细胞的整合运作提供了机会。然而,将如此大量的数据转化为生物学见解仍然是一项艰巨的任务。分析微阵列数据的重要的初始步骤是对具有相似行为的基因进行聚类。通常使用许多经典技术来执行此任务,尤其是分层聚类和K-means聚类,最近已提出了许多新颖的方法。这些方法虽然有用,但并非没有缺点。这些方法可以在纯随机数据中找到聚类,甚至为生物功能而富集的聚类也可以偏向少数过程(例如核糖体)。结果我们开发了最近邻网络(NNN),这是一种基于图的算法,可以生成具有相似表达谱的基因簇。该方法基于从相互最近的邻域生成的交互网络中的重叠派系生成聚类。通过关注最近的邻居而不是绝对距离度量,即使在空间上分隔时,我们也可以捕获具有高度连通性的簇,并且要求相互最近的邻居可以使没有足够相似伴侣的基因保持未聚簇状态。我们将NNN生成的聚类与其他八种聚类方法生成的聚类进行了比较。 NNN特别成功地生成了功能上一致的簇,并且这些簇通常代表比其他方法回收的生物学过程更为广泛的生物过程选择。结论最近邻居网络算法是一种有价值的聚类方法,可以有效地对可能与功能相关的基因进行分组。由于它的简单性,在大型数据集分析中的成功以及以高精度跨越广泛的生物学功能的能力,它特别有吸引力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号