We provide the SPINAL algorithm for the problem of globally aligning a pair of PPI networks. Our algorithm proceeds in two phases. In the first coarse-grained alignment phase we construct all pairwise initial similarity scores based on pairwise local neighborhood matchings. Employing the produced similarity scores, the fine-grained alignment phase produces the final one-to-one mapping by iteratively growing a locally improved solution subset. Both phases make use of the construction of ”neighborhood bipartite graphs” and the ”contributors” as a common primitive. We assess the performance of our algorithm on the PPI networks of yeast, fly, human, and worm. We show that based on the accuracy measures employed in relevant work, our method outperforms the state-of-the-art algorithms. Furthermore our algorithm does not suffer from scalability issues, as such accurate results are achieved in reasonable running times as compared to the benchmark algorithms.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Emmert-Streib, Frank; Dehmer, Matthias; Shi, Yongtang: Fifty years of graph matching, network alignment and network comparison (2016)
- El-Kebir, Mohammed; Heringa, Jaap; Klau, Gunnar W.: Natalie 2.0: sparse global network alignment as a special case of quadratic assignment (2015)
- Erciyes, K.: Distributed and sequential algorithms for bioinformatics (2015)
- Ibragimov, Rashid; Malek, Maximilian; Guo, Jiong; Baumbach, Jan: GEDEVO: an evolutionary graph edit distance algorithm for biological network alignment (2013)