首页> 外文会议>International Conference on Computing, Analytics and Networking >K-means Clustering: An Efficient Algorithm for Protein Complex Detection
【24h】

K-means Clustering: An Efficient Algorithm for Protein Complex Detection

机译:K-means聚类:蛋白质复杂检测的有效算法

获取原文

摘要

The protein complexes have significant biological functions of proteins and nucleic acids dense from the molecular interaction network in cells. Several computational methods are developed to detect protein complexes from the protein-protein interaction (PPI) networks. The existing algorithms do not predict better complex, and it also provides low performance values. In this research, K-means algorithm has been proposed for protein complex detection and compared with the existing algorithms such as MCODE and SPICi. The protein interaction and gene expression benchmark datasets such as Collins, DIP, Krogan, Krogan Extended, PPI-D1, PPI-D2, GSE12220, GSE12221, GSE12442, and GSE17716 have been used for comparing the performance of the existing and proposed algorithms. From this experimental analysis, it is inferred that the proposed K-means clustering algorithm outperforms the other existing methods.
机译:蛋白质复合物具有来自细胞中的分子相互作用网络的蛋白质和核酸的显着生物学功能。开发了几种计算方法以检测来自蛋白质 - 蛋白质相互作用(PPI)网络的蛋白质复合物。现有算法不预测更好的复杂性,并且还提供低性能值。在该研究中,已提出K-Means算法用于蛋白质复杂检测,并与现有算法(如MCODE和SPICI)相比。蛋白质相互作用和基因表达基准数据集如COLLINS,DIP,Krogan,Krogan扩展,PPI-D1,PPI-D2,GSE12220,GSE12221,GSE12442和GSE17716已被用于比较现有和所提出的算法的性能。从该实验分析中,推断提出的K-Means聚类算法优于其他现有方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号