BioAlign: An Accurate Global PPI Network Alignment Algorithm

被引:3
|
作者
Ayub, Umair [1 ,2 ]
Naveed, Hammad [1 ,2 ]
机构
[1] Natl Univ Comp & Emerging Sci, FAST Sch Comp, Lahore, Pakistan
[2] Natl Univ Comp & Emerging Sci, Dept Comp, Computat Biol Res Lab, Islamabad, Pakistan
来源
EVOLUTIONARY BIOINFORMATICS | 2022年 / 18卷
关键词
Network meta-analysis; computational biology; semantics; SEMANTIC SIMILARITY; FUNCTIONAL SIMILARITY;
D O I
10.1177/11769343221110658
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Motivation: The advancement of high-throughput PPI profiling techniques results in generating a large amount of PPI data. The alignment of the PPI networks uncovers the relationship between the species that can help understand the biological systems. The comparative study reveals the conserved biological interactions of the proteins across the species. It can also help study the biological pathways and signal networks of the cells. Although several network alignment algorithms are developed to study and compare the PPI data, the development of the aligner that aligns the PPI networks with high biological similarity and coverage is still challenging. Results: This paper presents a novel global network alignment algorithm, BioAlign, that incorporates a significant amount of biological information. Existing studies use global sequence and/or 3D-structure similarity to align the PPI networks. In contrast, BioAlign uses the local sequence similarity, predicted secondary structure motifs, and remote homology in addition to global sequence and 3D-structure similarity. The extra sources of biological information help BioAlign to align the proteins with high biological similarity. BioAlign produces significantly better results in terms of AFS and Coverage (6-32 and 7-34 with respect to MF and BP, respectively) than the existing algorithms. BioAlign aligns a much larger number of proteins that have high biological similarities as compared to the existing aligners. BioAlign helps in studying the functionally similar protein pairs across the species.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Boosting-based ensemble of global network aligners for PPI network alignment
    Menor-Flores, Manuel
    Vega-Rodriguez, Miguel A.
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 230
  • [2] SAlign-a structure aware method for global PPI network alignment
    Ayub, Umair
    Haider, Imran
    Naveed, Hammad
    BMC BIOINFORMATICS, 2020, 21 (01)
  • [3] GSLAlign: community detection and local PPI network alignment
    Ayub, Umair
    Naveed, Hammad
    JOURNAL OF BIOMOLECULAR STRUCTURE & DYNAMICS, 2024, : 4174 - 4182
  • [4] MPGM: Scalable and Accurate Multiple Network Alignment
    Kazemi, Ehsan
    Grossglauser, Matthias
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2020, 17 (06) : 2040 - 2052
  • [5] Pairwise Versus Multiple Global Network Alignment
    Vijayan, Vipin
    Gu, Shawn
    Krebs, Eric T.
    Meng, Lei
    Milenkovic, Tijana
    IEEE ACCESS, 2020, 8 (08): : 41961 - 41974
  • [6] Alignment of PPI Networks Using Semantic Similarity for Conserved Protein Complex Prediction
    Shui, Yong
    Cho, Young-Rae
    IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2016, 15 (04) : 380 - 389
  • [7] Pairwise Biological Network Alignment Based on Discrete Bat Algorithm
    Chen, Jing
    Zhang, Ying
    Xia, Jin-Fang
    COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE, 2021, 2021
  • [8] Identifying Essential Proteins in Dynamic PPI Network with Improved FOA
    Lei, X.
    Wang, S.
    Pan, L.
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2018, 13 (03) : 365 - 382
  • [9] A Steady State Genetic Algorithm for Multiple Sequence Alignment
    Pramanik, Sabari
    Setua, S. K.
    2014 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2014, : 1095 - 1099
  • [10] A Novel Computational Approach for Global Alignment for Multiple Biological Networks
    Djeddi, Warith Eddine
    Ben Yahia, Sadok
    Nguifo, Engelbert Mephu
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2018, 15 (06) : 2060 - 2066