首页> 外文期刊>BMC Bioinformatics >An overlapping module identification method in protein-protein interaction networks
【24h】

An overlapping module identification method in protein-protein interaction networks

机译:蛋白质-蛋白质相互作用网络中的重叠模块识别方法

获取原文
           

摘要

BackgroundPrevious studies have shown modular structures in PPI (protein-protein interaction) networks. More recently, many genome and metagenome investigations have focused on identifying modules in PPI networks. However, most of the existing methods are insufficient when applied to networks with overlapping modular structures. In our study, we describe a novel overlapping module identification method (OMIM) to address this problem.ResultsOur method is an agglomerative clustering method merging modules according to their contributions to modularity. Nodes that have positive effects on more than two modules are defined as overlapping parts. As well, we designed de-noising steps based on a clustering coefficient and hub finding steps based on nodal weight.ConclusionsThe low computational complexity and few control parameters prove that our method is suitable for large scale PPI network analysis. First, we verified OMIM on a small artificial word association network which was able to provide us with a comprehensive evaluation. Then experiments on real PPI networks from the MIPS Saccharomyces Cerevisiae dataset were carried out. The results show that OMIM outperforms several other popular methods in identifying high quality modular structures.
机译:背景技术先前的研究表明PPI(蛋白质-蛋白质相互作用)网络中的模块结构。最近,许多基因组和元基因组研究都集中在识别PPI网络中的模块上。然而,当应用于具有重叠的模块化结构的网络时,大多数现有方法是不够的。在我们的研究中,我们描述了一种新颖的重叠模块识别方法(OMIM)来解决这个问题。结果我们的方法是一种聚集聚类方法,根据模块对模块化的贡献进行合并。对两个以上模块产生积极影响的节点被定义为重叠部分。同样,我们基于聚类系数设计了降噪步骤,并基于节点权重设计了集线器找到步骤。结论计算复杂度低,控制参数少,证明了该方法适用于大规模PPI网络分析。首先,我们在一个小型人工词关联网络上验证了OMIM,该网络能够为我们提供全面的评估。然后对来自啤酒酵母MIPS的真实PPI网络进行了实验。结果表明,在识别高质量模块化结构方面,OMIM优于其他几种流行方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号