Essential proteins in cancer networks: a graph-based perspective using Dijkstra’s algorithm
摘要
Identifying essential proteins within cancer-related PPI networks is a significant challenge due to the heterogeneity and complexity of cancer diseases. Identifying these proteins is crucial for developing effective therapeutic strategies and understanding cancer biology. This study introduces a novel graph-based approach to identify essential cancer proteins within PPI networks, focusing on breast, lung, colorectal, and ovarian cancers. The proposed methodology involves a multi-step process beginning with identifying and preprocessing common genes associated with breast, colorectal, lung, and ovarian cancers. The PPI networks are constructed using these common genes. The PPI networks are analyzed to find the shortest paths using centrality measures. Centrality measures, particularly betweenness centrality, prioritize proteins with the highest impact on cancer progression. Betweenness centrality is used as a threshold to exclude nonessential proteins. The identified proteins are validated and categorized into cancer-related pathways through permutation and enrichment tests. The proposed approach successfully identified 64 essential proteins across breast, lung, colorectal, and ovarian cancers. These proteins were categorized into 14 cancer-related pathways, including cell cycle regulation, Wnt/