{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T04:55:06Z","timestamp":1785905706276,"version":"3.56.0"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Summary: Detecting communities and densely connected groups may contribute to unravel the underlying relationships among the units present in diverse biological networks (e.g. interactomes, coexpression networks, ecological networks). We recently showed that communities can be precisely characterized by maximizing Surprise, a global network parameter. Here, we present SurpriseMe, a tool that integrates the outputs of seven of the best algorithms available to estimate the maximum Surprise value. SurpriseMe also generates distance matrices that allow visualizing the relationships among the solutions generated by the algorithms. We show that the communities present in small- and medium-sized networks, with up to 10 000 nodes, can be easily characterized: on standard PC computers, these analyses take less than an hour. Also, four of the algorithms may rapidly analyze networks with up to 100 000 nodes, given enough memory resources. Because of its performance and simplicity, SurpriseMe is a reference tool for community structure characterization.<\/jats:p><jats:p>Availability and implementation: SurpriseMe is implemented in Perl and C\/C++. It compiles and runs on any UNIX-based operating system, including Linux and Mac OS\/X, using standard libraries. The source code is freely and publicly available under the GPL 3.0 license at http:\/\/github.com\/raldecoa\/SurpriseMe\/releases.<\/jats:p><jats:p>Contact: \u00a0imarin@ibv.csic.es<\/jats:p>","DOI":"10.1093\/bioinformatics\/btt741","type":"journal-article","created":{"date-parts":[[2013,12,21]],"date-time":"2013-12-21T03:17:47Z","timestamp":1387595867000},"page":"1041-1042","source":"Crossref","is-referenced-by-count":18,"title":["SurpriseMe: an integrated tool for network community structure characterization using Surprise maximization"],"prefix":"10.1093","volume":"30","author":[{"given":"Rodrigo","family":"Aldecoa","sequence":"first","affiliation":[{"name":"Instituto de Biomedicina de Valencia, Consejo Superior de Investigaciones Cient\u00edficas (IBV-CSIC), Valencia 46010, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ignacio","family":"Mar\u00edn","sequence":"additional","affiliation":[{"name":"Instituto de Biomedicina de Valencia, Consejo Superior de Investigaciones Cient\u00edficas (IBV-CSIC), Valencia 46010, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2013,12,20]]},"reference":[{"key":"2023012710455035300_btt741-B1","doi-asserted-by":"crossref","first-page":"e11585","DOI":"10.1371\/journal.pone.0011585","article-title":"Jerarca: Efficient analysis of complex networks using hierarchical clustering","volume":"5","author":"Aldecoa","year":"2010","journal-title":"PLoS One"},{"key":"2023012710455035300_btt741-B2","doi-asserted-by":"crossref","first-page":"e24195","DOI":"10.1371\/journal.pone.0024195","article-title":"Deciphering network community structure by surprise","volume":"6","author":"Aldecoa","year":"2011","journal-title":"PLoS One"},{"issue":"2 Pt. 2","key":"2023012710455035300_btt741-B3","doi-asserted-by":"crossref","first-page":"026109","DOI":"10.1103\/PhysRevE.85.026109","article-title":"Closed benchmarks for network community structure characterization","volume":"85","author":"Aldecoa","year":"2012","journal-title":"Phys. Rev. E Stat. Nonlin. Soft Matter Phys."},{"key":"2023012710455035300_btt741-B4","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1038\/srep01060","article-title":"Surprise maximization reveals the community structure of complex networks","volume":"3","author":"Aldecoa","year":"2013","journal-title":"Sci. Rep."},{"key":"2023012710455035300_btt741-B5","doi-asserted-by":"crossref","first-page":"2216","DOI":"10.1038\/srep02216","article-title":"Exploring the limits of community detection strategies in complex networks","volume":"3","author":"Aldecoa","year":"2013","journal-title":"Sci. Rep."},{"key":"2023012710455035300_btt741-B6","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/bioinformatics\/bti021","article-title":"Iterative cluster analysis of protein interaction data","volume":"21","author":"Arnau","year":"2005","journal-title":"Bioinformatics"},{"key":"2023012710455035300_btt741-B7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1038\/nrg1272","article-title":"Network biology: understanding the cell's functional organization","volume":"5","author":"Barab\u00e1si","year":"2004","journal-title":"Nat. Rev. Genet."},{"key":"2023012710455035300_btt741-B8","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1126\/science.1123412","article-title":"Asymmetric coevolutionary networks facilitate biodiversity maintenance","volume":"312","author":"Bascompte","year":"2006","journal-title":"Science"},{"key":"2023012710455035300_btt741-B9","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1038\/nrn2575","article-title":"Complex brain networks: graph theoretical analysis of structural and functional systems","volume":"10","author":"Bullmore","year":"2009","journal-title":"Nat. Rev. Neurosci."},{"key":"2023012710455035300_btt741-B10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1126\/science.1180823","article-title":"The genetic landscape of a cell","volume":"327","author":"Costanzo","year":"2010","journal-title":"Science"},{"key":"2023012710455035300_btt741-B11","doi-asserted-by":"crossref","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","article-title":"Comparing community structure identification","author":"Danon","year":"2005","journal-title":"J. Stat. Mech."},{"key":"2023012710455035300_btt741-B12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u0151s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"2023012710455035300_btt741-B13","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012710455035300_btt741-B14","doi-asserted-by":"crossref","first-page":"3013","DOI":"10.1093\/bioinformatics\/bth351","article-title":"Protein complex prediction via cost-based clustering","volume":"20","author":"King","year":"2004","journal-title":"Bioinformatics"},{"key":"2023012710455035300_btt741-B15","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","article-title":"Comparing clusterings - an information based distance","volume":"98","author":"Meil\u0103","year":"2007","journal-title":"J. Multivariate Anal."},{"key":"2023012710455035300_btt741-B16","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2023012710455035300_btt741-B17","doi-asserted-by":"crossref","first-page":"016110","DOI":"10.1103\/PhysRevE.74.016110","article-title":"Statistical mechanics of community detection","volume":"74","author":"Reichardt","year":"2006","journal-title":"Phys. Rev. E Stat. Nonlin. Soft Matter Phys."},{"key":"2023012710455035300_btt741-B18","doi-asserted-by":"crossref","first-page":"046114","DOI":"10.1103\/PhysRevE.81.046114","article-title":"Local resolution-limit-free Potts model for community detection","volume":"81","author":"Ronhovde","year":"2010","journal-title":"Phys. Rev. E. Stat. Nonlin. Soft Matter Phys."},{"key":"2023012710455035300_btt741-B19","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall","year":"2008","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012710455035300_btt741-B20","doi-asserted-by":"crossref","first-page":"e32210","DOI":"10.1371\/journal.pone.0032210","article-title":"Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit","volume":"7","author":"Schaub","year":"2012","journal-title":"PLoS One"},{"key":"2023012710455035300_btt741-B21","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1038\/82360","article-title":"A network of protein-protein interactions in yeast","volume":"18","author":"Schwikowski","year":"2000","journal-title":"Nat. Biotechnol."},{"key":"2023012710455035300_btt741-B22","doi-asserted-by":"crossref","first-page":"2731","DOI":"10.1093\/molbev\/msr121","article-title":"MEGA5: molecular evolutionary genetics analysis using maximum likelihood, evolutionary distance, and maximum parsimony methods","volume":"28","author":"Tamura","year":"2011","journal-title":"Mol. Biol. Evol."},{"key":"2023012710455035300_btt741-B23","doi-asserted-by":"crossref","first-page":"016114","DOI":"10.1103\/PhysRevE.84.016114","article-title":"Narrow scope for resolution-limit-free community detection","volume":"84","author":"Traag","year":"2011","journal-title":"Phys. Rev. E. Stat. Nonlin. Soft Matter Phys."},{"key":"2023012710455035300_btt741-B24","doi-asserted-by":"crossref","DOI":"10.1515\/9780691188331","volume-title":"Small Worlds: The Dynamics Of Networks Between Order And Randomness","author":"Watts","year":"1999"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/7\/1041\/48921875\/bioinformatics_30_7_1041.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/7\/1041\/48921875\/bioinformatics_30_7_1041.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:28:07Z","timestamp":1746088087000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/30\/7\/1041\/236154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,20]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,4,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btt741","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2014,4,1]]},"published":{"date-parts":[[2013,12,20]]}}}