{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T23:05:57Z","timestamp":1783983957571,"version":"3.55.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T00:00:00Z","timestamp":1779235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T00:00:00Z","timestamp":1783987200000},"content-version":"vor","delay-in-days":55,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01-HG006139"],"award-info":[{"award-number":["R01-HG006139"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Background<\/jats:title>\n                    <jats:p>Many networks contain node and edge data in the form of node-specific covariates and edge weights, respectively. Established methods for investigating graph structure often rely on dichotimizing edge data. This simplification motivates the development of techniques for multivariate analysis. In the context of biological networks, such as in gene co-expression analysis, flexible tools and models are needed to interrogate data for enrichment and differential interactions. We present Multigraph Estimation Models (mGEM) as flexible alternatives to correlation-based methods for analyzing co-occurrence and co-expression data.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Methods<\/jats:title>\n                    <jats:p>The mGEM approach interprets non-negative integer-valued edge weights as multiple edges in a multigraph and models the expected number of edges between nodes through a propensity-based relation. Overdispersion and node-specific attributes are treated under a unified parametric framework by changing distributional assumptions and reparameterization, respectively. By providing a background model for comparison, we are able to compute residuals that, in turn, are used to rank associations between nodes using mutual ranks and identify dependent components.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Conclusions<\/jats:title>\n                    <jats:p>\n                      We consider several simulated and real data examples including a classic nematode neural network, a manually-added co-authorship network derived from Google Scholar, and\n                      <jats:italic>Saccharomyces cerevisiae<\/jats:italic>\n                      co-expression data from RNA-seq experiments. These examples illustrate how our models can be used in exploratory data analysis to generate potentially interesting hypotheses. For example, our co-authorship analysis extracts known collaborations between universities and reveals connections between fields of interest. In analyzing co-expression data, mGEM posits several gene modules that share similarities with correlation-based analyses yet exhibit greater diversity in terms of co-expression propensities.\n                    <\/jats:p>\n                  <\/jats:sec>","DOI":"10.1186\/s12859-026-06467-3","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T06:55:21Z","timestamp":1779260121000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["mGEM: multigraph estimation models for pattern analysis"],"prefix":"10.1186","volume":"27","author":[{"given":"Alfonso","family":"Landeros","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dhwani","family":"Krishnan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenneth","family":"Lange","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mary","family":"Sehl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,20]]},"reference":[{"issue":"373","key":"6467_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/01621459.1981.10477598","volume":"76","author":"PW Holland","year":"1981","unstructured":"Holland PW, Leinhardt S. An exponential family of probability distributions for directed graphs. J Am Stat Assoc. 1981;76(373):33\u201350.https:\/\/doi.org\/10.1080\/01621459.1981.10477598.","journal-title":"J Am Stat Assoc"},{"issue":"395","key":"6467_CR2","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","volume":"81","author":"O Frank","year":"1986","unstructured":"Frank O, Strauss D. Markov Graphs. J Am Stat Assoc. 1986;81(395):832\u201342.https:\/\/doi.org\/10.1080\/01621459.1986.10478342.","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"6467_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"W Paul","year":"1983","unstructured":"Paul W, Laskey HKB, Leinhardt S. Stochastic blockmodels First steps. Soc Netw. 1983;5(2):109\u201337.https:\/\/doi.org\/10.1016\/0378-8733(83)90021-7.","journal-title":"Soc Netw"},{"issue":"397","key":"6467_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1080\/01621459.1987.10478385","volume":"82","author":"YJ Wang","year":"1987","unstructured":"Wang YJ, Wong GY. Stochastic blockmodels for directed graphs. J Am Stat Assoc. 1987;82(397):8\u201319.https:\/\/doi.org\/10.1080\/01621459.1987.10478385.","journal-title":"J Am Stat Assoc"},{"key":"6467_CR5","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1214\/12-EJS696","volume":"6","author":"PN Krivitsky","year":"2012","unstructured":"Krivitsky PN. Exponential-family random graph models for valued networks. Electronic J Stat. 2012;6:1100\u201328.https:\/\/doi.org\/10.1214\/12-EJS696.","journal-title":"Electronic J Stat"},{"key":"6467_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v105.i06","volume":"105","author":"PN Krivitsky","year":"2023","unstructured":"Krivitsky PN, Hunter DR, Morris M, Klumb C. Ergm 4: new features for analyzing exponential-family random graph models. J Stat Softw. 2023;105:1\u201344.https:\/\/doi.org\/10.18637\/jss.v105.i06.","journal-title":"J Stat Softw"},{"issue":"2","key":"6467_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1093\/comnet\/cnu026","volume":"3","author":"C Aicher","year":"2015","unstructured":"Aicher C, Jacobs AZ, Clauset A. Learning latent block structure in weighted networks. J Complex Netw. 2015;3(2):221\u201348.https:\/\/doi.org\/10.1093\/comnet\/cnu026.","journal-title":"J Complex Netw"},{"issue":"16","key":"6467_CR8","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1093\/bioinformatics\/btq309","volume":"26","author":"JMO Ranola","year":"2010","unstructured":"Ranola JMO, Ahn S, Sehl M, Smith DJ, Lange K. A Poisson model for random multigraphs. Bioinformatics. 2010;26(16):2004\u201311.https:\/\/doi.org\/10.1093\/bioinformatics\/btq309.","journal-title":"Bioinformatics"},{"issue":"5","key":"6467_CR9","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1007\/s10260-021-00596-0","volume":"30","author":"T Shafie","year":"2021","unstructured":"Shafie T, Schoch D. Multiplexity analysis of networks using multigraph representations. Stat Methods Appl. 2021;30(5):1425\u201344.https:\/\/doi.org\/10.1007\/s10260-021-00596-0.","journal-title":"Stat Methods Appl"},{"issue":"1","key":"6467_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1752-0509-7-21","volume":"7","author":"JM Ranola","year":"2013","unstructured":"Ranola JM, Langfelder P, Lange K, Horvath S. Cluster and propensity based approximation of a network. BMC Syst Biol. 2013;7(1):21.","journal-title":"BMC Syst Biol"},{"key":"6467_CR11","doi-asserted-by":"crossref","unstructured":"Lange, K. MM Optimization Algorithms. volume 147. SIAM; 2016.","DOI":"10.1137\/1.9781611974409"},{"issue":"1","key":"6467_CR12","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1038\/s41467-018-03751-6","volume":"9","author":"A Lachmann","year":"2018","unstructured":"Lachmann A, Torre D, Keenan AB, Jagodnik KM, Lee HJ, Wang L, et al. Massive mining of publicly available rna-seq data from human and mouse. Nat Commun. 2018;9(1):1366.","journal-title":"Nat Commun"},{"issue":"1165","key":"6467_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1098\/rstb.1986.0056","volume":"314","author":"JG White","year":"1986","unstructured":"White JG, Southgate E, Thomson JN, Brenner S. The structure of the nervous system of the nematode Caenorhabditis elegans. Philosophical Transactions of the Royal Society of London. Series B Biological Sci. 1986;314(1165):1\u2013340.https:\/\/doi.org\/10.1098\/rstb.1986.0056.","journal-title":"Series B Biological Sci"},{"issue":"1","key":"6467_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-022-00460-4","volume":"7","author":"G Kalhor","year":"2022","unstructured":"Kalhor G, Sarijalou AA, Sadr NS, Bahrak B. A new insight to the analysis of co-authorship in Google Scholar. Appl Netw Sci. 2022;7(1):1\u201317.https:\/\/doi.org\/10.1007\/s41109-022-00460-4.","journal-title":"Appl Netw Sci"},{"issue":"4","key":"6467_CR15","doi-asserted-by":"publisher","first-page":"2005","DOI":"10.1214\/09-AOS762","volume":"38","author":"LD Brown","year":"2010","unstructured":"Brown LD, Cai TT, Zhou HH. Nonparametric regression in exponential families. Ann Stat. 2010;38(4):2005\u201346.https:\/\/doi.org\/10.1214\/09-AOS762.","journal-title":"Ann Stat"},{"issue":"5","key":"6467_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1093\/dnares\/dsp016","volume":"16","author":"T Obayashi","year":"2009","unstructured":"Obayashi T, Kinoshita K. Rank of correlation coefficient as a comparable measure for biological significance of gene coexpression. DNA Res. 2009;16(5):249\u201360.https:\/\/doi.org\/10.1093\/dnares\/dsp016.","journal-title":"DNA Res"},{"issue":"D1","key":"6467_CR17","doi-asserted-by":"publisher","first-page":"D145","DOI":"10.1093\/nar\/gkac1031","volume":"51","author":"P Raina","year":"2023","unstructured":"Raina P, Guinea R, Chatsirisupachai K, Lopes I, Farooq Z, Guinea C, et al. Genefriends: gene co-expression databases and tools for humans and model organisms. Nucleic Acids Res. 2023;51(D1):D145\u201358.","journal-title":"Nucleic Acids Res"},{"issue":"D1","key":"6467_CR18","doi-asserted-by":"publisher","first-page":"D1124","DOI":"10.1093\/nar\/gku1042","volume":"43","author":"S van Dam","year":"2015","unstructured":"van Dam S, Craig T, de Magalh\u00e3es JP. Genefriends: a human rna-seq-based gene and transcript co-expression database. Nucleic Acids Res. 2015;43(D1):D1124\u201332.","journal-title":"Nucleic Acids Res"},{"issue":"W1","key":"6467_CR19","doi-asserted-by":"publisher","first-page":"W216","DOI":"10.1093\/nar\/gkac194","volume":"50","author":"BT Sherman","year":"2022","unstructured":"Sherman BT, Hao M, Qiu J, Jiao X, Baseler MW, Lane HC, et al. David: a web server for functional enrichment analysis and functional annotation of gene lists (2021 update). Nucleic Acids Res. 2022;50(W1):W216\u201321.https:\/\/doi.org\/10.1093\/nar\/gkac194.","journal-title":"Nucleic Acids Res"},{"issue":"12","key":"6467_CR20","doi-asserted-by":"publisher","first-page":"4723","DOI":"10.1073\/pnas.0506806103","volume":"103","author":"BL Chen","year":"2006","unstructured":"Chen BL, Hall DH, Chklovskii DB. Wiring optimization can relate neuronal structure and function. Proc Natl Acad Sci. 2006;103(12):4723\u20138.https:\/\/doi.org\/10.1073\/pnas.0506806103.","journal-title":"Proc Natl Acad Sci"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-026-06467-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-026-06467-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-026-06467-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T22:28:35Z","timestamp":1783981715000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s12859-026-06467-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,20]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["6467"],"URL":"https:\/\/doi.org\/10.1186\/s12859-026-06467-3","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,20]]},"assertion":[{"value":"7 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"148"}}