Detecting temporal protein complexes based on Neighbor Closeness and time course protein interaction networks

The detection of temporal protein complexes would be a great aid in furthering our knowledge of the dynamic features and molecular mechanism in cell life activities. Inspired by the idea of that the tighter a protein's neighbors inside a module connect, the greater the possibility that the protein belongs to the module, we propose a novel clustering algorithm CNC (Clustering based on Neighbor Closeness) and apply it to the time course protein interaction networks (TCPINs) to detect temporal protein complexes. Our novel algorithm has better performance on identifying protein complexes than five state-of-the-art algorithms-Hunter, MCODE, CFinder, SPICI, and ClusterONE-in terms of matching degree and accuracy metric, meanwhile it obtains many protein complexes with strong biological significance.

[1]  Peng Jiang,et al.  SPICi: a fast clustering algorithm for large biological networks , 2010, Bioinform..

[2]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.

[3]  Haiyuan Yu,et al.  Detecting overlapping protein complexes in protein-protein interaction networks , 2012, Nature Methods.

[4]  Alexander Rives,et al.  Modular organization of cellular networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Zelmina Lubovac,et al.  Combining functional and topological properties to identify core modules in protein interaction networks , 2006, Proteins.

[6]  Jacques van Helden,et al.  Evaluation of clustering algorithms for protein-protein interaction networks , 2006, BMC Bioinformatics.

[7]  Chun-Yu Lin,et al.  Module organization and variance in protein-protein interaction networks , 2015, Scientific Reports.

[8]  Lan V. Zhang,et al.  Evidence for dynamically organized modularity in the yeast protein–protein interaction network , 2004, Nature.

[9]  Yanan Li,et al.  An integrated approach to identify protein complex based on best neighbor and modularity increment , 2013, 2013 IEEE International Conference on Bioinformatics and Biomedicine.

[10]  Chung-Yen Lin,et al.  A hub-attachment based method to detect functional modules from confidence-scored protein interactions and expression profiles , 2010, BMC Bioinformatics.

[11]  P. Bork,et al.  Dynamic Complex Formation During the Yeast Cell Cycle , 2005, Science.

[12]  Yi Pan,et al.  Towards the identification of protein complexes and functional modules by integrating PPI network and gene expression data , 2012, BMC Bioinformatics.

[13]  Roded Sharan,et al.  Associating Genes and Protein Complexes with Disease via Network Propagation , 2010, PLoS Comput. Biol..

[14]  See-Kiong Ng,et al.  Discovering protein complexes in dense reliable neighborhoods of protein interaction networks. , 2007, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

[15]  Chen-Ching Lin,et al.  Dynamic protein interaction modules in human hepatocellular carcinoma progression , 2013, BMC Systems Biology.

[16]  Tao Jiang,et al.  A max-flow based approach to the identification of protein complexes using protein interaction and microarray data. , 2008, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

[17]  Yi Pan,et al.  A comparison of the functional modules identified from time course and static PPI network data , 2011, BMC Bioinformatics.

[18]  Illés J. Farkas,et al.  CFinder: locating cliques and overlapping modules in biological networks , 2006, Bioinform..