[1]LIU Xiao,CHEN Jing,WANG Zixiang.A divide-and-conquer and integration algorithm for pairwise alignment of PPI networks[J].CAAI Transactions on Intelligent Systems,2022,17(5):960-968.[doi:10.11992/tis.202106001]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
17
Number of periods:
2022 5
Page number:
960-968
Column:
学术论文—智能系统
Public date:
2022-09-05
- Title:
-
A divide-and-conquer and integration algorithm for pairwise alignment of PPI networks
- Author(s):
-
LIU Xiao1; CHEN Jing1; 2; WANG Zixiang1
-
1. School of Artificial Intelligence and Computer Science, Jiangnan University, Wuxi 214122, China;
2. Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computing Intelligence, Jiangnan University, Wuxi 214122, China
-
- Keywords:
-
PPI network; network alignment; divide-and-conquer; modularization; bipartite graph; eigenvector centrality; degree centrality; complex networks
- CLC:
-
TP393
- DOI:
-
10.11992/tis.202106001
- Abstract:
-
Biological network alignment is an important means of analyzing the evolutionary relationships between different species. It can reveal the conservative function between different species and provide important information for cross-species annotation transfer. Network alignment, like subgraph isomorphism, is an NP-hard problem. In this paper, a new biological network alignment algorithm is proposed, which adopts the divide-and-conquer strategy as a whole. Firstly, module division is executed, and module similarity is calculated according to existing alignment information. The candidate result set is then obtained according to the subalignment of nodes between modules, and the alignment results are finally obtained through hypergraph matching. The collective behavior of the existing alignment information is used to estimate the similarity between modules, greatly improving module matching efficiency. The score function based on paths and nodes ensures the similarity of nodes in the same module. The similarity of nodes between different networks is judged by the nodes themselves and the difference between nodes. The algorithm in this paper performs best in both biological and topological evaluations when compared with the other existing algorithms.