利用多尺度熵动力学揭示蛋白质相互作用网络中的重叠群落

Hanzhou Liu, Jia Chen
{"title":"利用多尺度熵动力学揭示蛋白质相互作用网络中的重叠群落","authors":"Hanzhou Liu, Jia Chen","doi":"10.15866/IREBIC.V4I2.1659","DOIUrl":null,"url":null,"abstract":"Most existing clustering approaches require the complete graph information, which is often impractical for large-scale protein-protein interaction networks. We proposed a novel algorithm which does not embrace the universal approach but instead tries to focus on local ties and model multiscales of biological interactions in these networks. It identifies functional leaders and modules around these leaders using local information. It naturally supports overlapping information by associating each node with a membership vector that describes its involvement of each community. In addition to uncover overlapping communities, we can describe different multi-scale partitions allowing to tune the characteristic size of biologically meaningful modules. The high efficiency and accuracy of the proposed algorithm make it feasible to be used for accurately detecting community structure in real biomolecular networks","PeriodicalId":14377,"journal":{"name":"International Review of Biophysical Chemistry","volume":"1 1","pages":"96-102"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reveal Overlapping Communities in Protein Interaction Network Using Multi-Scale Entropy Dynamic\",\"authors\":\"Hanzhou Liu, Jia Chen\",\"doi\":\"10.15866/IREBIC.V4I2.1659\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most existing clustering approaches require the complete graph information, which is often impractical for large-scale protein-protein interaction networks. We proposed a novel algorithm which does not embrace the universal approach but instead tries to focus on local ties and model multiscales of biological interactions in these networks. It identifies functional leaders and modules around these leaders using local information. It naturally supports overlapping information by associating each node with a membership vector that describes its involvement of each community. In addition to uncover overlapping communities, we can describe different multi-scale partitions allowing to tune the characteristic size of biologically meaningful modules. The high efficiency and accuracy of the proposed algorithm make it feasible to be used for accurately detecting community structure in real biomolecular networks\",\"PeriodicalId\":14377,\"journal\":{\"name\":\"International Review of Biophysical Chemistry\",\"volume\":\"1 1\",\"pages\":\"96-102\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Review of Biophysical Chemistry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15866/IREBIC.V4I2.1659\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Review of Biophysical Chemistry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15866/IREBIC.V4I2.1659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

大多数现有的聚类方法需要完整的图信息,这对于大规模的蛋白质-蛋白质相互作用网络来说往往是不切实际的。我们提出了一种新的算法,它不采用通用方法,而是试图关注局部联系,并对这些网络中生物相互作用的多尺度进行建模。它使用本地信息识别职能领导和围绕这些领导的模块。它通过将每个节点与描述其参与每个社区的成员向量相关联,自然地支持重叠信息。除了发现重叠的群落外,我们还可以描述不同的多尺度分区,从而调整具有生物学意义的模块的特征大小。该算法具有较高的效率和准确性,可用于真实生物分子网络中群落结构的准确检测
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reveal Overlapping Communities in Protein Interaction Network Using Multi-Scale Entropy Dynamic
Most existing clustering approaches require the complete graph information, which is often impractical for large-scale protein-protein interaction networks. We proposed a novel algorithm which does not embrace the universal approach but instead tries to focus on local ties and model multiscales of biological interactions in these networks. It identifies functional leaders and modules around these leaders using local information. It naturally supports overlapping information by associating each node with a membership vector that describes its involvement of each community. In addition to uncover overlapping communities, we can describe different multi-scale partitions allowing to tune the characteristic size of biologically meaningful modules. The high efficiency and accuracy of the proposed algorithm make it feasible to be used for accurately detecting community structure in real biomolecular networks
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Biocoagulants for Water and Waste Water Purification: a Review Optimisation of Poly(γ-Glutamic Acid) Production by Bacillus velezensis NRRL B – 23189 in Liquid Fermentation with Molasses as the Carbon Source without Addition of Glutamic Acid Effects of Transesterification Parameters on the Biodiesel Produced from Crude Groundnut Oil Effect of Filling Kinetic of Sequencing Batch Reactor on the Poultry Wastewater Treatment Technology and Engineering of Biodiesel Production: a Comparative Study between Microalgae and Other Non-Photosynthetic Oleaginous Microbes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1