蛋白质相互作用网络中的石墨烯排列

Mu-Fen Hsieh, S. Sze
{"title":"蛋白质相互作用网络中的石墨烯排列","authors":"Mu-Fen Hsieh, S. Sze","doi":"10.1109/GENSIPS.2010.5719676","DOIUrl":null,"url":null,"abstract":"With the increased availability of genome-scale data, it becomes possible to study functional relationships of genes across multiple biological networks. While most previous approaches for studying conservation of patterns in networks are through the application of network alignment algorithms or the identification of network motifs, we show that it is possible to exhaustively enumerate all graphlet alignments, which consist of subgraphs from each network that share a common topology and contain homologous proteins at the same position in the topology. We show that our algorithm is able to cover significantly more proteins than previous network alignment algorithms while achieving comparable specificity and higher sensitivity with respect to functional enrichment.","PeriodicalId":388703,"journal":{"name":"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graphlet alignment in protein interaction networks\",\"authors\":\"Mu-Fen Hsieh, S. Sze\",\"doi\":\"10.1109/GENSIPS.2010.5719676\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the increased availability of genome-scale data, it becomes possible to study functional relationships of genes across multiple biological networks. While most previous approaches for studying conservation of patterns in networks are through the application of network alignment algorithms or the identification of network motifs, we show that it is possible to exhaustively enumerate all graphlet alignments, which consist of subgraphs from each network that share a common topology and contain homologous proteins at the same position in the topology. We show that our algorithm is able to cover significantly more proteins than previous network alignment algorithms while achieving comparable specificity and higher sensitivity with respect to functional enrichment.\",\"PeriodicalId\":388703,\"journal\":{\"name\":\"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GENSIPS.2010.5719676\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GENSIPS.2010.5719676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着基因组尺度数据可用性的增加,跨多个生物网络研究基因的功能关系成为可能。虽然以前研究网络中模式守恒的大多数方法是通过应用网络对齐算法或识别网络基序,但我们表明有可能穷尽枚举所有的石墨烯对齐,这些石墨烯对齐由来自每个网络的子图组成,这些子图共享一个共同的拓扑结构,并在拓扑结构中包含相同位置的同源蛋白质。我们表明,我们的算法能够覆盖比以前的网络比对算法更多的蛋白质,同时在功能富集方面实现相当的特异性和更高的灵敏度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Graphlet alignment in protein interaction networks
With the increased availability of genome-scale data, it becomes possible to study functional relationships of genes across multiple biological networks. While most previous approaches for studying conservation of patterns in networks are through the application of network alignment algorithms or the identification of network motifs, we show that it is possible to exhaustively enumerate all graphlet alignments, which consist of subgraphs from each network that share a common topology and contain homologous proteins at the same position in the topology. We show that our algorithm is able to cover significantly more proteins than previous network alignment algorithms while achieving comparable specificity and higher sensitivity with respect to functional enrichment.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Network propagation models for gene selection Subtype specific breast cancer event prediction Importance sampling method for efficient estimation of the probability of rare events in biochemical reaction systems Bayesian MMSE estimation of classification error and performance on real genomic data Pathway and network analysis probing epigenetic influences on chemosensitivity in ovarian cancer
×
引用
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