Detection of overlapping protein complexes using a protein ranking algorithm

E. M. Hanna
{"title":"Detection of overlapping protein complexes using a protein ranking algorithm","authors":"E. M. Hanna","doi":"10.1109/INNOVATIONS.2013.6544424","DOIUrl":null,"url":null,"abstract":"The detection of protein complexes is evidently a cornerstone of understanding various biological processes and identifying key genes causing different diseases. Accordingly, many methods aiming at detecting protein complexes were developed. Recently, a novel method called ProRank was introduced. This method uses a ranking algorithm to detect protein complexes by ordering proteins based on their importance in the interaction network and by accounting for the evolutionary relationships among them. The experimental results showed that ProRank outperformed several well-known methods in terms of the number of detected complexes with high accuracy, precision and recall levels. In this paper, we overcome a drawback of the ProRank algorithm and further improve its performance by allowing detected protein complexes to overlap; a supposition that was not considered in the original version of the method.","PeriodicalId":438270,"journal":{"name":"2013 9th International Conference on Innovations in Information Technology (IIT)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 9th International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INNOVATIONS.2013.6544424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The detection of protein complexes is evidently a cornerstone of understanding various biological processes and identifying key genes causing different diseases. Accordingly, many methods aiming at detecting protein complexes were developed. Recently, a novel method called ProRank was introduced. This method uses a ranking algorithm to detect protein complexes by ordering proteins based on their importance in the interaction network and by accounting for the evolutionary relationships among them. The experimental results showed that ProRank outperformed several well-known methods in terms of the number of detected complexes with high accuracy, precision and recall levels. In this paper, we overcome a drawback of the ProRank algorithm and further improve its performance by allowing detected protein complexes to overlap; a supposition that was not considered in the original version of the method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用蛋白质排序算法检测重叠的蛋白质复合物
蛋白复合物的检测显然是理解各种生物过程和识别导致不同疾病的关键基因的基石。因此,许多旨在检测蛋白质复合物的方法被开发出来。最近,一种名为proorank的新方法被引入。该方法采用排序算法,根据蛋白质在相互作用网络中的重要性对蛋白质进行排序,并考虑蛋白质之间的进化关系,从而检测蛋白质复合物。实验结果表明,ProRank在检测到的复合物数量方面优于几种知名的方法,具有较高的准确率、精密度和召回率。在本文中,我们克服了ProRank算法的一个缺点,并通过允许检测到的蛋白质复合物重叠进一步提高了其性能;在方法的原始版本中没有考虑到的假设。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A system for assessing the quality of Web pages Optimized waveform relaxation solution of RLCG transmission line type circuits Ubiquitous computing platform via hardware assisted ISA virtualization A novel approach to develop large-scale virtual environment applications using script-language Supporting environmental awareness using mobile clients
×
引用
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