Suppr超能文献

MAGNA++:通过节点和边的保留实现全球网络对齐的准确性最大化。

MAGNA++: Maximizing Accuracy in Global Network Alignment via both node and edge conservation.

作者信息

Vijayan V, Saraph V, Milenković T

机构信息

Department of Computer Science and Engineering, ECK Institute for Global Health, Interdisciplinary Center for Network Science and Application, University of Notre Dame, IN 46556, USA and.

Department of Computer Science, Brown University, Providence, RI 02912, USA.

出版信息

Bioinformatics. 2015 Jul 15;31(14):2409-11. doi: 10.1093/bioinformatics/btv161. Epub 2015 Mar 19.

Abstract

MOTIVATION

Network alignment aims to find conserved regions between different networks. Existing methods aim to maximize total similarity over all aligned nodes (i.e. node conservation). Then, they evaluate alignment quality by measuring the amount of conserved edges, but only after the alignment is constructed. Thus, we recently introduced MAGNA (Maximizing Accuracy in Global Network Alignment) to directly maximize edge conservation while producing alignments and showed its superiority over the existing methods. Here, we extend the original MAGNA with several important algorithmic advances into a new MAGNA++ framework.

RESULTS

MAGNA++ introduces several novelties: (i) it simultaneously maximizes any one of three different measures of edge conservation (including our recent superior [Formula: see text] measure) and any desired node conservation measure, which further improves alignment quality compared with maximizing only node conservation or only edge conservation; (ii) it speeds up the original MAGNA algorithm by parallelizing it to automatically use all available resources, as well as by reimplementing the edge conservation measures more efficiently; (iii) it provides a friendly graphical user interface for easy use by domain (e.g. biological) scientists; and (iv) at the same time, MAGNA++ offers source code for easy extensibility by computational scientists.

AVAILABILITY AND IMPLEMENTATION

http://www.nd.edu/∼cone/MAGNA++/

摘要

动机

网络对齐旨在找出不同网络之间的保守区域。现有方法旨在使所有对齐节点上的总相似度最大化(即节点保守性)。然后,它们通过测量保守边的数量来评估对齐质量,但这仅在构建对齐之后进行。因此,我们最近引入了MAGNA(全局网络对齐中的最大准确性),以便在生成对齐时直接最大化边的保守性,并展示了其相对于现有方法的优越性。在此,我们通过若干重要的算法改进将原始的MAGNA扩展为一个新的MAGNA++框架。

结果

MAGNA++引入了若干新颖之处:(i)它同时最大化三种不同的边保守性度量中的任何一种(包括我们最近提出的优越的[公式:见原文]度量)以及任何期望的节点保守性度量,与仅最大化节点保守性或仅最大化边保守性相比,这进一步提高了对齐质量;(ii)它通过并行化自动利用所有可用资源来加速原始的MAGNA算法,并且通过更高效地重新实现边保守性度量;(iii)它提供了一个友好的图形用户界面,便于领域(如生物学)科学家使用;以及(iv)同时,MAGNA++提供源代码,便于计算科学家进行扩展。

可用性与实现

http://www.nd.edu/∼cone/MAGNA++/

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验