An Adaptive Hybrid Algorithm for Global Network Alignment.
It is challenging to obtain reliable and optimal mapping between networks for alignment algorithms when both nodal and topological structures are taken into consideration due to the underlying NP-hard problem. Here, we introduce an adaptive hybrid algorithm that combines the classical Hungarian algorithm and the Greedy algorithm (HGA) for the global alignment of biomolecular networks. With this hybrid algorithm, every pair of nodes with one in each network is first aligned based on node information (e.g., their sequence attributes) and then followed by an adaptive and convergent iteration procedure for aligning the topological connections in the networks. For four well-studied protein interaction networks, i.e., C.elegans, yeast, D.melanogaster, and human, applications of HGA lead to improved alignments in acceptable running time. The mapping between yeast and human PINs obtained by the new algorithm has the largest value of common gene ontology (GO) terms compared to those obtained by other existing algorithms, while it still has lower Mean normalized entropy (MNE) and good performances on several other measures. Overall, the adaptive HGA is effective and capable of providing good mappings between aligned networks in which the biological properties of both the nodes and the connections are important.
Jiang
J
Xie
Chaojuan
C
Xiang
Jin
J
Ma
Jun
J
Tan
Tieqiao
T
Wen
Jinzhi
J
Lei
Qing
Q
Nie
D000465:Algorithms; D000818:Animals; D017173:Caenorhabditis elegans; D019295:Computational Biology / Q000379:methods*; D004331:Drosophila melanogaster; D006801:Humans; D025941:Protein Interaction Mapping / Q000379:methods*; D060066:Protein Interaction Maps / Q000502:physiology; D012441:Saccharomyces cerevisiae; D015398:Signal Transduction / Q000502:physiology*