A gene module identification algorithm and its applications to identify gene modules and key genes of hepatocellular carcinoma

Yan Zhang, Zhengkui Lin, Xiaofeng Lin, Xue Zhang, Qian Zhao, Yeqing SunScientific 2021 · DOI

Abstract

Identifying functional gene modules is essential for understanding the molecular mechanisms of complex diseases like hepatocellular carcinoma (HCC). This paper presents GCNA-Kpca, a novel hybrid algorithm that integrates network topology from the Newman algorithm with iterative refinement via a modified K-means framework. By optimizing modularity and allowing for iterative cluster reassignment, GCNA-Kpca overcomes the limitations of traditional hierarchical methods like WGCNA. Our results demonstrate that GCNA-Kpca achieves significantly lower error rates and higher biological significance. When applied to HCC data, the algorithm identified 10 key biomarkers, including NOP56 and NOP58, which are reported here for the first time in the context of liver cancer.

Introduction

In systems biology, genes operate within coordinated modules rather than in isolation. Accurately identifying these modules is a prerequisite for discovering reliable biomarkers and therapeutic targets. While Weighted Gene Co-expression Network Analysis (WGCNA) is widely used, it suffers from two major flaws: a lack of explicit modularity optimization and the "irreversibility" of hierarchical clustering, where initial gene assignments cannot be corrected even if they fit better elsewhere after further analysis.

Methods: The GCNA-Kpca Algorithm

The proposed GCNA-Kpca algorithm bridges network science and machine learning through a three-stage workflow:

  1. Network Construction: A Gene Co-expression Network (GCN) is built using Pearson correlation coefficients.
  2. Initial Partitioning: The Newman algorithm—a community detection method—identifies initial modules based on network topology, determining the optimal number of clusters ($K$) and their initial centers.
  3. Iterative Refinement: A modified K-means framework refines these clusters. Unlike standard K-means, this approach uses a correlation-based distance metric ($1 - |cor(g, C)|$) and employs Principal Component Analysis (PCA) to calculate "Module Eigengenes" as cluster centers, ensuring they represent the dominant expression pattern.
Figure 1: Research workflow for gene module and key gene identification using the GCNA-Kpca algorithm.

Results and Discussion

The performance of GCNA-Kpca was evaluated against seven other algorithms using HCC expression profiles from TCGA and GEO datasets.

Comparative Performance

GCNA-Kpca significantly outperformed existing methods across all metrics. It achieved an error rate of 0.06, a substantial improvement over WGCNA (0.29) and the standalone Newman algorithm (0.25). Furthermore, as shown in Figure 3, the biological significance score (Sig) for GCNA-Kpca reached 956.52, nearly double that of WGCNA (499.40), indicating that the identified modules are more functionally coherent.

Figure 3: Comparison of biological significance (Sig) across different gene clustering algorithms, highlighting the superior performance of GCNA-Kpca.

Identification of Key Biomarkers

The algorithm identified 10 key genes in HCC: CDC20, CCNB1, EIF4A3, H2AFX, NOP56, RFC4, NOP58, AURKA, PCNA, and FEN1. Notably, NOP56 and NOP58—nucleolar proteins involved in ribosome biogenesis—were identified as novel HCC biomarkers. Survival analysis confirmed that these 10 genes possess high prognostic significance, suggesting their potential as clinical biomarkers for liver cancer.

Conclusion

The GCNA-Kpca algorithm provides a robust framework for gene module identification by combining the structural insights of community detection with the iterative precision of K-means. Its success in identifying novel biomarkers for HCC highlights its potential for broader application in cancer research. Future work will focus on experimental validation of NOP56 and NOP58 and extending the algorithm to multi-omic data.

Summary updated

Abstract

To further improve the effect of gene modules identification, combining the Newman algorithm in community detection and K-means algorithm framework, a new method of gene module identification, GCNA-Kpca algorithm, was proposed. The core idea of the algorithm was to build a gene co-expression network (GCN) based on gene expression data firstly; Then the Newman algorithm was used to initially identify gene modules based on the topology of GCN, and the number of clusters and clustering centers were determined; Finally the number of clusters and clustering centers were input into the K-means algorithm framework, and the secondary clustering was performed based on the gene expression profile to obtain the final gene modules. The algorithm took into account the role of modularity in the clustering process, and could find the optimal membership module for each gene through multiple iterations. Experimental results showed that the algorithm proposed in this paper had the best performance in error rate, biological significance and CNN classification indicators (Precision, Recall and F-score). The gene module obtained by GCNA-Kpca was used for the task of key gene identification, and these key genes had the highest prognostic significance. Moreover, GCNA-Kpca algorithm was used to identify 10 key genes in hepatocellular carcinoma (HCC): CDC20, CCNB1, EIF4A3, H2AFX, NOP56, RFC4, NOP58, AURKA, PCNA, and FEN1. According to the validation, it was reasonable to speculate that these 10 key genes could be biomarkers for HCC. And NOP56 and NOP58 are key genes for HCC that we discovered for the first time.
BibTeX
@inproceedings{zhang2021gene,
  author = {Yan Zhang and Zhengkui Lin and Xiaofeng Lin and Xue Zhang and Qian Zhao and Yeqing Sun},
  title = {{A gene module identification algorithm and its applications to identify gene modules and key genes of hepatocellular carcinoma}},
  booktitle = {Scientific},
  year = {2021},
  doi = {10.1038/s41598-021-84837-y},
}
Figure