EUVIMEDEUVIMED entdecken
Übersichtsarbeit

A Review on Efficient and Scalable Graph‐Based Clustering Algorithms for Protein Complex Identification in PPI Networks

Sabyasachi Patra iD, Tushar Ranjan Sahoo

Proteins: Structure, Function, and Bioinformatics · 2026

DOI: 10.1002/prot.70026 ↗

Kurz gefasst

Übersichtsarbeit in der Zeitschrift Proteins: Structure, Function, and Bioinformatics, 2026. Verfasst von Sabyasachi Patra und 1 weiteren Autor:innen. Beteiligte Einrichtung: CSE, IIIT Bhubaneswar, Bhubaneswar, India. Hauptthemen laut MEDLINE: Algorithms, Computational Biology, Protein Interaction Mapping, Protein Interaction Maps. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 143 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Network clustering is employed in bioinformatics and data mining studies to investigate the structural and functional properties of protein–protein interaction (PPI) networks. In multiple studies over the past two decades, network clustering has proven valuable for uncovering functional modules and elucidating the functions of previously undiscovered proteins. Protein complexes are vital cellular components that play a crucial role in generating biological activity. Experimental techniques have inherent limitations in inferring protein complexes. Given these constraints, numerous computational methods have emerged over the past decade for predicting protein complexes. Typically, these methods take the input PPI data and generate predicted protein complexes as output subnetworks. Most of these methods have shown encouraging outcomes in predicting protein complexes. Prediction is challenging for sparse, small, and overlapping complexes. New strategies should include explicit knowledge about the biological characteristics of proteins to increase performance. Furthermore, specific issues should be considered more effectively in the future while developing new complex prediction algorithms. The bioinformatics community has developed various techniques for clustering PPI networks, which we identified, analyzed, and compared in this paper. This review evaluates various graph clustering algorithms for protein complex identification, facilitating the benchmarking of existing methods, identifying limitations, motivating the development of novel computational tools, and ultimately improving biological insight and therapeutic progress. Through the assessment of strengths and limitations, researchers may develop efficient and scalable algorithms designed explicitly for biological data, integrating graph‐based methodologies with machine learning and deep learning approaches. This study is an invaluable tool for new researchers in the area to recognize upcoming trends, including dynamic PPI networks and temporal complex identification.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsComputational BiologyProtein Interaction MappingProtein Interaction MapsProteinsCluster AnalysisHumansData MiningDatabases, ProteinClustering Algorithms

Stichwörter der Autor:innen

PPI networkcluster densityclusteringgraphprotein complex

Substanzen

Proteins

Autor:innen und Institutionen

  • CSE, IIIT Bhubaneswar, Bhubaneswar, India.

ORCID-Profile: Sabyasachi Patra

Zitieren

APA

Patra, S., & Sahoo, T. R. (2026). A Review on Efficient and Scalable Graph‐Based Clustering Algorithms for Protein Complex Identification in PPI Networks. Proteins: Structure, Function, and Bioinformatics. https://doi.org/10.1002/prot.70026

Vancouver

Patra S, Sahoo TR. A Review on Efficient and Scalable Graph‐Based Clustering Algorithms for Protein Complex Identification in PPI Networks. Proteins: Structure, Function, and Bioinformatics. 2026. doi:10.1002/prot.70026

BibTeX
@article{Patra2026,
  author = {Patra, Sabyasachi and Sahoo, Tushar Ranjan},
  title = {A Review on Efficient and Scalable Graph‐Based Clustering Algorithms for Protein Complex Identification in PPI Networks},
  journal = {Proteins: Structure, Function, and Bioinformatics},
  year = {2026},
  doi = {10.1002/prot.70026}
}
Kostenlos starten →