arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.4358cs.DSq-bio.QM
收藏

拉格朗日松弛法在稀疏全局网络对齐中的应用

Lagrangian Relaxation Applied to Sparse Global Network Alignment

Mohammed El-Kebir, Jaap Heringa, Gunnar W. Klau

摘要:

关于分子相互作用的数据正在以惊人的速度增长,而分析这种网络数据的可靠方法的发展却滞后了。这尤其适用于比较网络分析领域,人们希望确定生物网络之间的共性。由于生物功能主要在网络水平上运行,因此显然需要拓扑感知的比较方法。在本文中,我们提出了一种全局网络对齐的方法,是快速和强大的,可以灵活地处理各种评分计划,同时考虑到节点到节点的对应关系以及网络拓扑结构。它是基于一个整数线性规划公式,推广了研究良好的二次分配问题。我们得到强的上界和下界的问题,通过改进拉格朗日松弛的方法,并介绍了软件工具娜塔莉2.0,公开实现我们的方法。在对六种不同物种的蛋白质相互作用网络进行的广泛计算研究中,我们发现我们的新方法在质量和运行时间方面优于其他最先进的方法。

英文摘要:

Data on molecular interactions is increasing at a tremendous pace, while the development of solid methods for analyzing this network data is lagging behind. This holds in particular for the field of comparative network analysis, where one wants to identify commonalities between biological networks. Since biological functionality primarily operates at the network level, there is a clear need for topology-aware comparison methods. In this paper we present a method for global network alignment that is fast and robust, and can flexibly deal with various scoring schemes taking both node-to-node correspondences as well as network topologies into account. It is based on an integer linear programming formulation, generalizing the well-studied quadratic assignment problem. We obtain strong upper and lower bounds for the problem by improving a Lagrangian relaxation approach and introduce the software tool natalie 2.0, a publicly available implementation of our method. In an extensive computational study on protein interaction networks for six different species, we find that our new method outperforms alternative state-of-the-art methods with respect to quality and running time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑