Open access
Jul 2026
CENTRALITY-BASED GRAPH PRUNING AND GAT-PSO FOR THE MAXIMUM CLIQUE PROBLEM IN PROTEIN-PROTEIN INTERACTION NETWORKS
Results validate the proposed framework as a robust, scalable pre-processing solution for accelerating exact clique detection in massive PPINs and confirm that the retained modules align with established biological pathways.
Gilland Fausta Putra Achyar, Annisa, Heru Cahya Rustamaji et al.
· Journal of Mathematics and S... · 0 citations