High-throughput methods for detecting protein-protein in-teractions (PPI) have given researchers an initial global picture of protein interactions on a genomic scale. These interactions connect proteins into a large protein interaction network (PIN). However, both the size of the data sets and the noise in the data pose big challenges in effectively analyzing the data. In this paper, we investigate the problem of protein complex detection, i.e., finding biologically meaningful subsets of proteins, from the noisy protein interaction data. We identify the difficulties and propose a "seed-refine" approach, including a novel subgraph quality measure, an appropriate heuristics for finding good seeds and a novel subgraph refinement method. Our method considers the properties of protein complexes and the noisy interaction data. Experiments show the effectiveness of our method. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Pei, P., & Zhang, A. (2006). Towards detecting protein complexes from protein interaction data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 734–741). Springer Verlag. https://doi.org/10.1007/11758525_99
Mendeley helps you to discover research relevant for your work.