Boosting-based ensemble of global network aligners for PPI network alignment

被引:3
|
作者
Menor-Flores, Manuel [1 ]
Vega-Rodriguez, Miguel A. [1 ]
机构
[1] Univ Extremadura, Escuela Politecn, Campus Univ s-n, Caceres 10003, Spain
关键词
Boosting-based ensemble; Boosting and bagging; Machine learning; Protein-protein interaction; Network alignment; PROTEIN-INTERACTION NETWORKS; MAXIMIZING ACCURACY; SEMANTIC SIMILARITY; ALGORITHM; OPTIMIZATION; STRATEGY; DATABASE; YEAST; NODE;
D O I
10.1016/j.eswa.2023.120671
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The number of investigations attempting to align protein-protein interaction (PPI) networks has increased with the growth of studies focused on collecting PPI data. These works aim to identify conserved areas between species that are difficult to differentiate due to speciation. However, there is no standard approach to align PPI networks, and global aligners encounter difficulties in constructing alignments with high biological and structural quality. To address this issue, we propose an innovative ensemble technique that combines the strengths of aligners in the PPI network alignment field while avoiding their weaknesses. This approach reduces the spread of dispersion in so different individual global aligners and contributes to achieving a global standard that produces alignments of higher quality. This is possible thanks to the two branches composing our ensemble that aim to improve alignments in terms of biological or structural quality. In addition to a new heuristic replacing the second-level aligner in the biological quality-focused branch. Our approach achieves alignments of higher quality, as demonstrated through experiments with 10 different scenarios involving real data from 5 species. Our solutions outperform other individual aligners and ensemble techniques, like bagging, in terms of biological and structural quality. Moreover, the time required to perform the ensemble is minimal compared to that of individual aligners.
引用
收藏
页数:16
相关论文
共 50 条
  • [41] Integrative network alignment reveals large regions of global network similarity in yeast and human
    Kuchaiev, Oleksii
    Przulj, Natasa
    BIOINFORMATICS, 2011, 27 (10) : 1390 - 1396
  • [42] ConnectedAlign: a PPI network alignment method for identifying conserved protein complexes across multiple species
    Gao, Jianliang
    Song, Bo
    Hu, Xiaohua
    Yan, Fengxia
    Wang, Jianxin
    BMC BIOINFORMATICS, 2018, 19
  • [43] Orientation algorithm for PPI networks based on network propagation approach
    Zhao, Qiaojun
    Jiao, Xiong
    JOURNAL OF BIOSCIENCES, 2022, 47 (03)
  • [44] Clustering and overlapping modules detection in PPI network based on IBFO
    Lei, Xiujuan
    Wu, Shuang
    Ge, Liang
    Zhang, Aidong
    PROTEOMICS, 2013, 13 (02) : 278 - 290
  • [45] Extreme gradient boosting and deep neural network based ensemble learning approach to forecast hourly solar irradiance
    Kumari, Pratima
    Toshniwal, Durga
    JOURNAL OF CLEANER PRODUCTION, 2021, 279
  • [46] A Novel Disease Gene Prediction Method Based on PPI Network
    Zhao, Junmin
    He, Tingting
    Hu, Xiaohua
    Wang, Yan
    Shen, Xianjun
    Fang, Minghong
    Yuan, Jie
    2014 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2014,
  • [47] Global multiple protein-protein interaction network alignment by combining pairwise network alignments
    Dohrmann, Jakob
    Puchin, Juris
    Singh, Rahul
    BMC BIOINFORMATICS, 2015, 16
  • [48] ConnectedAlign: a PPI network alignment method for identifying conserved protein complexes across multiple species
    Jianliang Gao
    Bo Song
    Xiaohua Hu
    Fengxia Yan
    Jianxin Wang
    BMC Bioinformatics, 19
  • [49] GRANA: Graph convolutional network based network representation learning method for attributed network alignment
    Li, Yao
    Cai, He
    Liu, Huilin
    INFORMATION SCIENCES, 2025, 706
  • [50] DAWN: Domain Generalization Based Network Alignment
    Gao, Shuai
    Zhang, Zhongbao
    Su, Sen
    IEEE TRANSACTIONS ON BIG DATA, 2023, 9 (03) : 878 - 888