{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:31Z","timestamp":1750306711355,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,9,20]],"date-time":"2014-09-20T00:00:00Z","timestamp":1411171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000152","name":"Division of Molecular and Cellular Biosciences","doi-asserted-by":"publisher","award":["MCB 0630250, DGE 0841423"],"award-info":[{"award-number":["MCB 0630250, DGE 0841423"]}],"id":[{"id":"10.13039\/100000152","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000082","name":"Division of Graduate Education","doi-asserted-by":"publisher","award":["MCB 0630250, DGE 0841423"],"award-info":[{"award-number":["MCB 0630250, DGE 0841423"]}],"id":[{"id":"10.13039\/100000082","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,9,20]]},"DOI":"10.1145\/2649387.2649416","type":"proceedings-article","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T15:29:22Z","timestamp":1414164562000},"page":"390-399","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Large highly connected clusters in protein-protein interaction networks"],"prefix":"10.1145","author":[{"given":"Suzanne Renick","family":"Gallagher","sequence":"first","affiliation":[{"name":"University of Colorado, Boulder, CO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debra S.","family":"Goldberg","sequence":"additional","affiliation":[{"name":"University of Colorado, Boulder, CO"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,9,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl039"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1002-991"},{"key":"e_1_3_2_1_3_1","first-page":"4","article-title":"An automated method for finding molecular complexes in large protein interaction networks","author":"Bader G.","year":"2003","unstructured":"G. Bader and C. Hogue . An automated method for finding molecular complexes in large protein interaction networks . BMC Bioinformatics , 4 , 2003 . G. Bader and C. Hogue. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics, 4, 2003.","journal-title":"BMC Bioinformatics"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp498"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/978-3-540-39884-4_3","volume-title":"Innovative Internet Community Systems","author":"Brinkmeier M.","year":"2003","unstructured":"M. Brinkmeier . Communities in graphs . In Innovative Internet Community Systems , volume 2877 of Lecture Notes in Computer Science , pages 20 -- 35 . Springer-Verlag Berlin , 2003 . M. Brinkmeier. Communities in graphs. In Innovative Internet Community Systems, volume 2877 of Lecture Notes in Computer Science, pages 20--35. Springer-Verlag Berlin, 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2011.66"},{"key":"e_1_3_2_1_7_1","volume-title":"Pacific Symposium on Biocomputing, 11: 231--242","author":"Chu W.","year":"2006","unstructured":"W. Chu Identifying protein complexes in high-throughput protein interaction screens using an infinite latent feature model . Pacific Symposium on Biocomputing, 11: 231--242 , 2006 . W. Chu et al. Identifying protein complexes in high-throughput protein interaction screens using an infinite latent feature model. Pacific Symposium on Biocomputing, 11:231--242, 2006."},{"key":"e_1_3_2_1_8_1","volume-title":"An algorithm for finding functional modules and protein complexes in protein-protein interaction networks. J Biomed Biotechnol","author":"Cui G.","year":"2008","unstructured":"G. Cui An algorithm for finding functional modules and protein complexes in protein-protein interaction networks. J Biomed Biotechnol , 2008 . G. Cui et al. An algorithm for finding functional modules and protein complexes in protein-protein interaction networks. J Biomed Biotechnol, 2008."},{"key":"e_1_3_2_1_9_1","first-page":"50","volume-title":"Graph Theory","author":"Diestel R.","year":"1997","unstructured":"R. Diestel . Graph Theory , pages 50 -- 55 . Graduate Texts in Mathematics. Springer , second edition, 1997 . R. Diestel. Graph Theory, pages 50--55. Graduate Texts in Mathematics. Springer, second edition, 1997."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2012.6374369"},{"key":"e_1_3_2_1_11_1","volume-title":"A new cluster algorithm for graphs. Technical report","author":"Dongen S.","year":"1998","unstructured":"S. Dongen . A new cluster algorithm for graphs. Technical report , Amsterdam, The Netherlands, The Netherlands , 1998 . S. Dongen. A new cluster algorithm for graphs. Technical report, Amsterdam, The Netherlands, The Netherlands, 1998."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.04.024"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1022"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183907.1183912"},{"key":"e_1_3_2_1_15_1","volume-title":"Characterization of known protein complexes using k-connectivity and other topological measures. F1000Research, 2:172","author":"Gallagher S.","year":"2013","unstructured":"S. Gallagher and D. Goldberg . Characterization of known protein complexes using k-connectivity and other topological measures. F1000Research, 2:172 , 2013 . S. Gallagher and D. Goldberg. Characterization of known protein complexes using k-connectivity and other topological measures. F1000Research, 2:172, 2013."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2506583.2506635"},{"key":"e_1_3_2_1_17_1","volume-title":"Sep 16","author":"Habibi M.","year":"2010","unstructured":"M. Habibi Protein complex prediction based on k-connected subgraphs in protein interaction network. BMC Systems Biology, 4 , Sep 16 2010 . M. Habibi et al. Protein complex prediction based on k-connected subgraphs in protein interaction network. BMC Systems Biology, 4, Sep 16 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00142-3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1055"},{"key":"e_1_3_2_1_20_1","volume-title":"Sep 25","author":"Li M.","year":"2008","unstructured":"M. Li Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinformatics, 9 , Sep 25 2008 . M. Li et al. Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinformatics, 9, Sep 25 2008."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp311"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02993903"},{"key":"e_1_3_2_1_23_1","first-page":"215","volume-title":"The Many Facets of Graph Theory (Proc. Conf., Western Mich","author":"Matula D. W.","year":"1968","unstructured":"D. W. Matula . The cohesive strength of graphs . In The Many Facets of Graph Theory (Proc. Conf., Western Mich . Univ., Kalamazoo, Mich. , 1968 ), pages 215 -- 221 . Springer, Berlin, 1969. D. W. Matula. The cohesive strength of graphs. In The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich., 1968), pages 215--221. Springer, Berlin, 1969."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0122040"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj148"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0505482102"},{"key":"e_1_3_2_1_28_1","unstructured":"R. Milo etal On the uniform generation of random graphs with prescribed degree sequences. http:\/\/arxiv.org\/abs\/cond-mat\/0312028\/ 2004.  R. Milo et al. On the uniform generation of random graphs with prescribed degree sequences. http:\/\/arxiv.org\/abs\/cond-mat\/0312028\/ 2004."},{"key":"e_1_3_2_1_29_1","volume-title":"Mar 18","author":"Nepusz T.","year":"2012","unstructured":"T. Nepusz Detecting overlapping protein complexes in protein-protein interaction networks. Nature Methods, 9 , Mar 18 2012 . T. Nepusz et al. Detecting overlapping protein complexes in protein-protein interaction networks. Nature Methods, 9, Mar 18 2012."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/prot.10505"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth114"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(00)00026-5"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkp914"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2032324100"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj109"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"e_1_3_2_1_37_1","first-page":"231","article-title":"A note on graphs without k-connected subgraphs","volume":"67","author":"Yuster R.","year":"2003","unstructured":"R. Yuster . A note on graphs without k-connected subgraphs . Ars Combinatoria , 67 : 231 -- 235 , Apr 2003 . R. Yuster. A note on graphs without k-connected subgraphs. Ars Combinatoria, 67:231--235, Apr 2003.","journal-title":"Ars Combinatoria"},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations","author":"Zotenko E.","year":"2006","unstructured":"E. Zotenko Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations . Algorithms for Molecular Biology , 1 , 2006 . E. Zotenko et al. Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations. Algorithms for Molecular Biology, 1, 2006.","journal-title":"Algorithms for Molecular Biology"}],"event":{"name":"BCB '14: ACM-BCB '14","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"location":"Newport Beach California","acronym":"BCB '14"},"container-title":["Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2649387.2649416","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2649387.2649416","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:18Z","timestamp":1750231158000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2649387.2649416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,20]]},"references-count":38,"alternative-id":["10.1145\/2649387.2649416","10.1145\/2649387"],"URL":"https:\/\/doi.org\/10.1145\/2649387.2649416","relation":{},"subject":[],"published":{"date-parts":[[2014,9,20]]},"assertion":[{"value":"2014-09-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}