Protein complex prediction via bottleneck-based graph partitioning

Authors:
Jaegyoon Ahn;Dae Hyun Lee;Youngmi Yoon;Yunku Yeu;Sanghyun Park
Affiliations:
Yonsei University, Seoul, South Korea;Yonsei University, Seoul, South Korea;Gachon University, Seongnam-si, South Korea;Yonsei University, Seoul, South Korea;Yonsei University, Seoul, South Korea
Venue:
Proceedings of the ACM sixth international workshop on Data and text mining in biomedical informatics
Year:
2012

Citing 3
Cited 1

CFinder: locating cliques and overlapping modules in biological networks

Bioinformatics
Complex discovery from weighted PPI networks

Bioinformatics
Markov clustering of protein interaction networks with improved balance and scalability

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology

DTMBIO 2012: international workshop on data and text mining in biomedical informatics

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Detecting protein complexes is one of essential and fundamental tasks in understanding various biological functions or processes. Therefore, precise identification of protein complexes is indispensible. For more precise detection of protein complexes, we propose a novel data structure which employs bottleneck proteins as partitioning points for detecting the protein complexes. The partitioning process allows overlapping between resulting protein complexes. We applied our algorithm to several PPI (Protein-Protein Interaction) networks of Saccharomyces cerevisiae and Homo sapiens, and validated our results using public databases of protein complexes. Our algorithm resulted in overlapping protein complexes with significantly improved F1 score, which comes from higher precision.