基于Markov聚类的蛋白质相互作用网络的比较分析

Marco Mina, P. Guzzi
{"title":"基于Markov聚类的蛋白质相互作用网络的比较分析","authors":"Marco Mina, P. Guzzi","doi":"10.1109/BIBMW.2012.6470300","DOIUrl":null,"url":null,"abstract":"Evolutionary analysis and comparison of biological networks may result in the identification of conserved mechanism between species as well as conserved modules, such as protein complexes and pathways. Following an holistic philosophy several algorithms, known as network alignment algorithms, have been proposed recently as counterpart of sequence and structure alignment algorithms, to unravel relations between different species at the interactome level. In this work we present AlignMCL, a local alignment algorithm for the identification of conserved subnetworks in different species. As many other existing tools, AlignMCL is based on the idea of merging many protein interaction networks in a single alignment graph and subsequently mining it to identify potentially conserved subnetworks. In order to asses AlignMCL we compared it to the state of the art local alignment algorithms over a rather extensive and updated dataset. Finally, to improve the usability of our tool we developed a Cytoscape plugin, AlignMCL, that offers a graphical user interface to an MCL engine.","PeriodicalId":6392,"journal":{"name":"2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops","volume":"10 1","pages":"174-181"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"AlignMCL: Comparative analysis of protein interaction networks through Markov clustering\",\"authors\":\"Marco Mina, P. Guzzi\",\"doi\":\"10.1109/BIBMW.2012.6470300\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Evolutionary analysis and comparison of biological networks may result in the identification of conserved mechanism between species as well as conserved modules, such as protein complexes and pathways. Following an holistic philosophy several algorithms, known as network alignment algorithms, have been proposed recently as counterpart of sequence and structure alignment algorithms, to unravel relations between different species at the interactome level. In this work we present AlignMCL, a local alignment algorithm for the identification of conserved subnetworks in different species. As many other existing tools, AlignMCL is based on the idea of merging many protein interaction networks in a single alignment graph and subsequently mining it to identify potentially conserved subnetworks. In order to asses AlignMCL we compared it to the state of the art local alignment algorithms over a rather extensive and updated dataset. Finally, to improve the usability of our tool we developed a Cytoscape plugin, AlignMCL, that offers a graphical user interface to an MCL engine.\",\"PeriodicalId\":6392,\"journal\":{\"name\":\"2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops\",\"volume\":\"10 1\",\"pages\":\"174-181\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIBMW.2012.6470300\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBMW.2012.6470300","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

摘要

通过对生物网络的进化分析和比较,可以确定物种之间的保守机制以及蛋白质复合物和通路等保守模块。遵循整体哲学,最近提出了几种算法,称为网络比对算法,作为序列和结构比对算法的对应,以在相互作用体水平上揭示不同物种之间的关系。在这项工作中,我们提出了AlignMCL,一种局部对齐算法,用于识别不同物种的保守子网络。与许多其他现有工具一样,AlignMCL基于将许多蛋白质相互作用网络合并到单个比对图中,然后挖掘它以识别潜在的保守子网络的想法。为了评估AlignMCL,我们在一个相当广泛和更新的数据集上将其与最先进的本地对齐算法进行了比较。最后,为了提高我们的工具的可用性,我们开发了一个Cytoscape插件AlignMCL,它为MCL引擎提供了一个图形用户界面。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
AlignMCL: Comparative analysis of protein interaction networks through Markov clustering
Evolutionary analysis and comparison of biological networks may result in the identification of conserved mechanism between species as well as conserved modules, such as protein complexes and pathways. Following an holistic philosophy several algorithms, known as network alignment algorithms, have been proposed recently as counterpart of sequence and structure alignment algorithms, to unravel relations between different species at the interactome level. In this work we present AlignMCL, a local alignment algorithm for the identification of conserved subnetworks in different species. As many other existing tools, AlignMCL is based on the idea of merging many protein interaction networks in a single alignment graph and subsequently mining it to identify potentially conserved subnetworks. In order to asses AlignMCL we compared it to the state of the art local alignment algorithms over a rather extensive and updated dataset. Finally, to improve the usability of our tool we developed a Cytoscape plugin, AlignMCL, that offers a graphical user interface to an MCL engine.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信