{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T06:05:00Z","timestamp":1722924300981},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"S1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2010,1]]},"abstract":"Abstract<\/jats:title>\n \n Background<\/jats:title>\n As the size of the known human interactome grows, biologists increasingly rely on computational tools to identify patterns that represent protein complexes and pathways. Previous studies have shown that densely connected network components frequently correspond to community structure and functionally related modules. In this work, we present a novel method to identify densely connected and bipartite network modules based on a log odds score for shared neighbours.<\/jats:p>\n <\/jats:sec>\n \n Results<\/jats:title>\n To evaluate the performance of our method (NeMo), we compare it to other widely used tools for community detection including kMetis, MCODE, and spectral clustering. We test these methods on a collection of synthetically constructed networks and the set of MIPS human complexes. We apply our method to the CXC chemokine pathway and find a high scoring functional module of 12 disconnected phospholipase isoforms.<\/jats:p>\n <\/jats:sec>\n \n Conclusion<\/jats:title>\n We present a novel method that combines a unique neighbour-sharing score with hierarchical agglomerative clustering to identify diverse network communities. The approach is unique in that we identify both dense network and dense bipartite network structures in a single approach. Our results suggest that the performance of NeMo is better than or competitive with leading approaches on both real and synthetic datasets. We minimize model complexity and generalization error in the Bayesian spirit by integrating out nuisance parameters. An implementation of our method is freely available for download as a plugin to Cytoscape through our website and through Cytoscape itself.<\/jats:p>\n <\/jats:sec>","DOI":"10.1186\/1471-2105-11-s1-s61","type":"journal-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T07:18:16Z","timestamp":1263885496000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":96,"title":["NeMo: Network Module identification in Cytoscape"],"prefix":"10.1186","volume":"11","author":[{"given":"Corban G","family":"Rivera","sequence":"first","affiliation":[]},{"given":"Rachit","family":"Vakil","sequence":"additional","affiliation":[]},{"given":"Joel S","family":"Bader","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,18]]},"reference":[{"issue":"19","key":"4011_CR1","doi-asserted-by":"publisher","first-page":"6959","DOI":"10.1073\/pnas.0708078105","volume":"105","author":"MP Stumpf","year":"2008","unstructured":"Stumpf MP, Thorne T, de Silva E, Stewart R, An HJ, Lappe M, Wiuf C: Estimating the size of the human interactome. Proc Natl Acad Sci USA 2008, 105(19):6959\u20136964. 10.1073\/pnas.0708078105","journal-title":"Proc Natl Acad Sci USA"},{"issue":"11","key":"4011_CR2","doi-asserted-by":"publisher","first-page":"e214","DOI":"10.1371\/journal.pcbi.0030214","volume":"3","author":"H Huang","year":"2007","unstructured":"Huang H, Jedynak BM, Bader JS: Where have all the interactions gone? Estimating the coverage of two-hybrid protein interaction maps. PLoS Comput Biol 2007, 3(11):e214. 10.1371\/journal.pcbi.0030214","journal-title":"PLoS Comput Biol"},{"issue":"3","key":"4011_CR3","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1093\/bioinformatics\/btn640","volume":"25","author":"H Huang","year":"2009","unstructured":"Huang H, Bader JS: Precision and recall estimates for two-hybrid screens. Bioinformatics 2009, 25(3):372\u2013378. 10.1093\/bioinformatics\/btn640","journal-title":"Bioinformatics"},{"issue":"11","key":"4011_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/gb-2006-7-11-120","volume":"7","author":"GT Hart","year":"2006","unstructured":"Hart GT, Ramani AK, Marcotte EM: How complete are current yeast and human protein-interaction networks? Genome Biol 2006, 7(11):120. 10.1186\/gb-2006-7-11-120","journal-title":"Genome Biol"},{"issue":"3","key":"4011_CR5","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/72.377977","volume":"6","author":"A Jagota","year":"1995","unstructured":"Jagota A: Approximating maximum clique with a Hopfield network. IEEE Trans Neural Netw 1995, 6(3):724\u2013735. 10.1109\/72.377977","journal-title":"IEEE Trans Neural Netw"},{"issue":"11","key":"4011_CR6","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1101\/gr.1239303","volume":"13","author":"P Shannon","year":"2003","unstructured":"Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, Ramage D, Amin N, Schwikowski B, Ideker T: Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res 2003, 13(11):2498\u20132504. 10.1101\/gr.1239303","journal-title":"Genome Res"},{"key":"4011_CR7","first-page":"10","volume-title":"Parallel and Distributed Processing Symposium, 2006 IPDPS 2006 20th International: 2006","author":"A Abou-Rjeili","year":"2006","unstructured":"Abou-Rjeili A, Karypis G: Multilevel algorithms for partitioning power-law graphs. Parallel and Distributed Processing Symposium, 2006 IPDPS 2006 20th International: 2006 2006, 10."},{"issue":"1","key":"4011_CR8","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V: Multilevel k-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing 1998, 48(1):96\u2013129. 10.1006\/jpdc.1997.1404","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4011_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1007352.1007372","volume-title":"STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing: 2004","author":"D Spielman","year":"2004","unstructured":"Spielman D, Teng S-H: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing: 2004. ACM Press; 2004:81\u201390. full_text"},{"issue":"1","key":"4011_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.cam.2006.04.026","volume":"204","author":"D Higham","year":"2007","unstructured":"Higham D, Kalna G, Kibble M: Spectral clustering and its use in bioinformatics. Journal of Computational and Applied Mathematics 2007, 204(1):25\u201337. 10.1016\/j.cam.2006.04.026","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"3","key":"4011_CR11","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ: Finding community structure in networks using the eigenvectors of matrices. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics) 2006, 74(3):036104.","journal-title":"Physical Review E (Statistical, Nonlinear, and Soft Matter Physics)"},{"issue":"6 Pt 2","key":"4011_CR12","doi-asserted-by":"publisher","first-page":"066102","DOI":"10.1103\/PhysRevE.76.066102","volume":"76","author":"MJ Barber","year":"2007","unstructured":"Barber MJ: Modularity and community detection in bipartite networks. Phys Rev E Stat Nonlin Soft Matter Phys 2007, 76(6 Pt 2):066102.","journal-title":"Phys Rev E Stat Nonlin Soft Matter Phys"},{"issue":"12","key":"4011_CR13","doi-asserted-by":"publisher","first-page":"1991","DOI":"10.1101\/gr.077693.108","volume":"18","author":"Y Qi","year":"2008","unstructured":"Qi Y, Suhail Y, Lin YY, Boeke JD, Bader JS: Finding friends and enemies in an enemies-only network: a graph diffusion kernel for predicting novel genetic interactions and co-complex membership from yeast genetic interactions. Genome Res 2008, 18(12):1991\u20132004. 10.1101\/gr.077693.108","journal-title":"Genome Res"},{"key":"4011_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1186\/1471-2105-10-283","volume":"10","author":"K Macropol","year":"2009","unstructured":"Macropol K, Can T, Singh AK: RRW: repeated random walks on genome-scale protein networks for local cluster discovery. BMC Bioinformatics 2009, 10: 283. 10.1186\/1471-2105-10-283","journal-title":"BMC Bioinformatics"},{"key":"4011_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1186\/1471-2105-10-297","volume":"10","author":"K Voevodski","year":"2009","unstructured":"Voevodski K, Teng SH, Xia Y: Finding local communities in protein networks. BMC Bioinformatics 2009, 10: 297. 10.1186\/1471-2105-10-297","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"4011_CR16","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D Karger","year":"1996","unstructured":"Karger D, Stein C: A new approach to the minimum cut problem. J ACM 1996, 43(4):601\u2013640. 10.1145\/234533.234534","journal-title":"J ACM"},{"key":"4011_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-74839-7_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"U Brandes","year":"2007","unstructured":"Brandes U, Delling D, Gaertler M, G\u00f6rke R, Hoefer M, Nikoloski Z, Wagner D: On Finding Graph Clusterings with Maximum Modularity. Graph-Theoretic Concepts in Computer Science 2007, 121\u2013132. full_text"},{"key":"4011_CR18","volume-title":"Community detection algorithms: a comparative analysis","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S: Community detection algorithms: a comparative analysis. 2009."},{"issue":"1","key":"4011_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barthelemy M: Resolution limit in community detection. Proc Natl Acad Sci USA 2007, 104(1):36\u201341. 10.1073\/pnas.0605965104","journal-title":"Proc Natl Acad Sci USA"},{"key":"4011_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.118703","volume-title":"Physical Review Letters","author":"EA Leicht","year":"2008","unstructured":"Leicht EA, Newman MEJ: Community Structure in Directed Networks. Physical Review Letters 2008., 100(11): 10.1103\/PhysRevLett.100.118703"},{"key":"4011_CR21","volume-title":"Proceedings of the National Academy of Sciences","author":"F Chung","year":"2007","unstructured":"Chung F: The heat kernel as the pagerank of a graph. Proceedings of the National Academy of Sciences 2007."},{"issue":"24","key":"4011_CR22","doi-asserted-by":"publisher","first-page":"3106","DOI":"10.1093\/bioinformatics\/btl533","volume":"22","author":"J Yoon","year":"2006","unstructured":"Yoon J, Blumer A, Lee K: An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality. Bioinformatics 2006, 22(24):3106\u20133108. 10.1093\/bioinformatics\/btl533","journal-title":"Bioinformatics"},{"key":"4011_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11871637_36","volume":"4213","author":"D Ucar","year":"2006","unstructured":"Ucar D, Asur S, Catalyurek U, Parthasarathy S: Improving functional modularity in protein-protein interactions graphs using hub-induced subgraphs. Lecture Notes in Computer Science 2006, 4213: 371\u2013371. full_text","journal-title":"Lecture Notes in Computer Science"},{"key":"4011_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader GD, Hogue CW: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 2003, 4: 2. 10.1186\/1471-2105-4-2","journal-title":"BMC Bioinformatics"},{"key":"4011_CR25","volume-title":"Detecting the overlapping and hierarchical community structure of complex networks","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S, Kertesz J: Detecting the overlapping and hierarchical community structure of complex networks. 2009."},{"key":"4011_CR26","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1186\/1471-2105-7-207","volume":"7","author":"M Altaf-Ul-Amin","year":"2006","unstructured":"Altaf-Ul-Amin M, Shinbo Y, Mihara K, Kurokawa K, Kanaya S: Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinformatics 2006, 7: 207. 10.1186\/1471-2105-7-207","journal-title":"BMC Bioinformatics"},{"key":"4011_CR27","volume-title":"Finding community structure in very large networks","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C: Finding community structure in very large networks. 2004."},{"issue":"21","key":"4011_CR28","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin V, Mirny LA: Protein complexes and functional modules in molecular networks. Proc Natl Acad Sci USA 2003, 100(21):12123\u201312128. 10.1073\/pnas.2032324100","journal-title":"Proc Natl Acad Sci USA"},{"issue":"2","key":"4011_CR29","doi-asserted-by":"publisher","first-page":"026109","DOI":"10.1103\/PhysRevE.78.026109","volume":"78","author":"J Kumpula","year":"2008","unstructured":"Kumpula J, Kivel\u00e4 M, Kaski K, Saram\u00e4ki J: Sequential algorithm for fast clique percolation. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics) 2008, 78(2):026109.","journal-title":"Physical Review E (Statistical, Nonlinear, and Soft Matter Physics)"},{"issue":"11","key":"4011_CR30","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TPAMI.2007.1115","volume":"29","author":"IS Dhillon","year":"2007","unstructured":"Dhillon IS, Guan Y, Kulis B: Weighted graph cuts without eigenvectors a multilevel approach. IEEE Trans Pattern Anal Mach Intell 2007, 29(11):1944\u20131957. 10.1109\/TPAMI.2007.1115","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"4011_CR31","doi-asserted-by":"publisher","first-page":"38002","DOI":"10.1209\/0295-5075\/87\/38002","volume":"87","author":"XS Zhang","year":"2009","unstructured":"Zhang XS, Wang RS, Wang Y, Wang J, Qiu Y, Wang L, Chen L: Modularity optimization in community detection of complex networks. EPL (Europhysics Letters) 2009, 87(3):38002. 10.1209\/0295-5075\/87\/38002","journal-title":"EPL (Europhysics Letters)"},{"key":"4011_CR32","first-page":"D646","volume-title":"Nucleic Acids Res","author":"A Ruepp","year":"2008","unstructured":"Ruepp A, Brauner B, Dunger-Kaltenbach I, Frishman G, Montrone C, Stransky M, Waegele B, Schmidt T, Doudieu ON, Stumpflen V, et al.: CORUM: the comprehensive resource of mammalian protein complexes. Nucleic Acids Res 2008, (36 Database):D646\u2013650."},{"issue":"6","key":"4011_CR33","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1093\/bioinformatics\/bti115","volume":"21","author":"P Pagel","year":"2005","unstructured":"Pagel P, Kovac S, Oesterheld M, Brauner B, Dunger-Kaltenbach I, Frishman G, Montrone C, Mark P, Stumpflen V, Mewes HW, et al.: The MIPS mammalian protein-protein interaction database. Bioinformatics 2005, 21(6):832\u2013834. 10.1093\/bioinformatics\/bti115","journal-title":"Bioinformatics"},{"key":"4011_CR34","doi-asserted-by":"publisher","first-page":"D566","DOI":"10.1093\/nar\/gkl859","volume-title":"Nucleic Acids Res","author":"M Jayapandian","year":"2007","unstructured":"Jayapandian M, Chapman A, Tarcea VG, Yu C, Elkiss A, Ianni A, Liu B, Nandi A, Santos C, Andrews P, et al.: Michigan Molecular Interactions (MiMI): putting the jigsaw puzzle together. Nucleic Acids Res 2007, (35 Database):D566\u2013571. 10.1093\/nar\/gkl859"},{"issue":"8","key":"4011_CR35","doi-asserted-by":"publisher","first-page":"e804","DOI":"10.1371\/journal.pone.0000804","volume":"2","author":"T Liu","year":"2007","unstructured":"Liu T, Papagiannakopoulos T, Puskar K, Qi S, Santiago F, Clay W, Lao K, Lee Y, Nelson SF, Kornblum HI, et al.: Detection of a microRNA signal in an in vivo expression set of mRNAs. PLoS One 2007, 2(8):e804. 10.1371\/journal.pone.0000804","journal-title":"PLoS One"},{"issue":"2","key":"4011_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF03033243","volume":"10","author":"BE Leonard","year":"2006","unstructured":"Leonard BE, Myint A: Inflammation and depression: is there a causal connection with dementia? Neurotox Res 2006, 10(2):149\u2013160. 10.1007\/BF03033243","journal-title":"Neurotox Res"},{"issue":"5","key":"4011_CR37","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1188\/08.ONF.802-807","volume":"35","author":"JS Myers","year":"2008","unstructured":"Myers JS: Proinflammatory cytokines and sickness behavior: implications for depression and cancer-related symptoms. Oncol Nurs Forum 2008, 35(5):802\u2013807. 10.1188\/08.ONF.802-807","journal-title":"Oncol Nurs Forum"},{"key":"4011_CR38","unstructured":"The Bader Lab[http:\/\/www.baderzone.org]"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-11-S1-S61.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T04:30:00Z","timestamp":1630470600000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-11-S1-S61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":38,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["4011"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-11-s1-s61","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]},"assertion":[{"value":"18 January 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S61"}}