HetNetAligner: A Novel Algorithm for Local Alignment of Heterogeneous Biological Networks

Marianna Milano, P. Guzzi, M. Cannataro
{"title":"HetNetAligner: A Novel Algorithm for Local Alignment of Heterogeneous Biological Networks","authors":"Marianna Milano, P. Guzzi, M. Cannataro","doi":"10.1145/3233547.3233690","DOIUrl":null,"url":null,"abstract":"The importance of the use of networks to model and analyse biological data and the interplay of bio-molecules is widely recognised. Consequently, many algorithms for the analysis and the comparison of networks (such as alignment algorithms) have been developed in the past. Recently, many different approaches tried to integrate into a single model the interplay of different molecules, such as genes, transcription factors and microRNAs. A possible formalism to model such scenario comes from node/edge coloured networks (or heterogeneous networks) implemented as node/ edge-coloured graphs. Consequently, the need for the introduction of alignment algorithms able to analyse heterogeneous networks arises. We here focus on the local comparison of heterogeneous networks that may be formulated as a network alignment problem. To the best of our knowledge, this problem has not been investigated in the past. We here propose HetNetAligner a novel algorithm that receives as input two heterogeneous networks (node-coloured graphs) and a similarity function among nodes of two networks. We first build a single alignment graph. Then we mine this graph extracting relevant subgraphs. We also implemented our algorithm, and we tested it on some selected heterogeneous biological networks. Preliminary results confirm that our method builds high-quality alignments. The website https://sites.google.com/view/heterogeneusnetworkalignment/home contains supplementary material and the code.","PeriodicalId":131906,"journal":{"name":"Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3233547.3233690","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The importance of the use of networks to model and analyse biological data and the interplay of bio-molecules is widely recognised. Consequently, many algorithms for the analysis and the comparison of networks (such as alignment algorithms) have been developed in the past. Recently, many different approaches tried to integrate into a single model the interplay of different molecules, such as genes, transcription factors and microRNAs. A possible formalism to model such scenario comes from node/edge coloured networks (or heterogeneous networks) implemented as node/ edge-coloured graphs. Consequently, the need for the introduction of alignment algorithms able to analyse heterogeneous networks arises. We here focus on the local comparison of heterogeneous networks that may be formulated as a network alignment problem. To the best of our knowledge, this problem has not been investigated in the past. We here propose HetNetAligner a novel algorithm that receives as input two heterogeneous networks (node-coloured graphs) and a similarity function among nodes of two networks. We first build a single alignment graph. Then we mine this graph extracting relevant subgraphs. We also implemented our algorithm, and we tested it on some selected heterogeneous biological networks. Preliminary results confirm that our method builds high-quality alignments. The website https://sites.google.com/view/heterogeneusnetworkalignment/home contains supplementary material and the code.
HetNetAligner:一种异质生物网络局部对齐的新算法
使用网络来模拟和分析生物数据以及生物分子之间的相互作用的重要性已得到广泛认可。因此,过去已经开发了许多用于网络分析和比较的算法(如对齐算法)。最近,许多不同的方法试图将不同分子(如基因、转录因子和microrna)的相互作用整合到一个单一的模型中。对这种场景进行建模的一种可能的形式化方法来自于实现为节点/边缘彩色图的节点/边缘彩色网络(或异构网络)。因此,需要引入能够分析异构网络的对齐算法。我们在这里关注的是异构网络的局部比较,这可能被表述为网络对齐问题。据我们所知,过去没有人调查过这个问题。我们在此提出了一种新的算法HetNetAligner,它将两个异构网络(节点彩色图)和两个网络节点之间的相似函数作为输入。我们首先构建一个单一的对齐图。然后我们挖掘这个图,提取相关的子图。我们也实现了我们的算法,并在一些选择的异质生物网络上进行了测试。初步结果证实我们的方法构建了高质量的校准。网站https://sites.google.com/view/heterogeneusnetworkalignment/home包含补充材料和代码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信