Data on molecular interactions is increasing at a tremendous pace, while the development of solid methods for analyzing this network data is still 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. 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. We exploit that network alignment is a special case of the well-studied quadratic assignment problem (QAP). We focus on sparse network alignment, where each node can be mapped only to a typically small subset of nodes in the other network. This corresponds to a QAP instance with a symmetric and sparse weight matrix. We obtain strong upper and lower bounds for the problem by improving a Lagrangian relaxation approach and introduce the open source 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 established and recent state-of-the-art methods.
Additional Metadata
THEME Life Sciences (theme 5)
Publisher MDPI
Persistent URL dx.doi.org/10.3390/a8041035
Journal Algorithms
Note Special issue Algorithmic Themes in Bioinformatics
Citation
El-Kebir, M, Heringa, J, & Klau, G.W. (2015). Natalie 2.0: Sparse Global Network Alignment as a Special Case of Quadratic Assignment. Algorithms, 8(4), 1035–1051. doi:10.3390/a8041035