{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:07:01Z","timestamp":1775815621189,"version":"3.50.1"},"reference-count":3,"publisher":"Oxford University Press (OUP)","issue":"21","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,11,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: Enumeration of the dense sub-graphs of a graph is of interest in community discovery and membership problems, including dense sub-graphs that overlap each other. Described herein is ODES (Overlapping DEnse Sub-graphs), pthreads parallelized software to extract all overlapping maximal sub-graphs whose densities are greater than or equal to a specified cutoff density of at least 1\/2.<\/jats:p>\n               <jats:p>Availability and Implementation: \u00a0http:\/\/dense.sf.net<\/jats:p>\n               <jats:p>Contact: \u00a0jlong@alaska.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/btq514","type":"journal-article","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T00:18:07Z","timestamp":1284077887000},"page":"2788-2789","source":"Crossref","is-referenced-by-count":8,"title":["ODES: an overlapping dense sub-graph algorithm"],"prefix":"10.1093","volume":"26","author":[{"given":"James","family":"Long","sequence":"first","affiliation":[{"name":"1 International Arctic Research Center and 2Department of Computer Science, University of Alaska Fairbanks, Fairbanks, AK 99775, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Hartman","sequence":"additional","affiliation":[{"name":"1 International Arctic Research Center and 2Department of Computer Science, University of Alaska Fairbanks, Fairbanks, AK 99775, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2010,9,9]]},"reference":[{"key":"2023012507543907300_B1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1093\/bioinformatics\/btl039","article-title":"CFinder: locating cliques and overlapping modules in biological networks","volume":"22","author":"Adamcsek","year":"2006","journal-title":"Bioinformatics"},{"issue":"Suppl. 1","key":"2023012507543907300_B2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1093\/bioinformatics\/bti1049","article-title":"Mining coherent dense subgraphs across massive biological networks for functional discovery","volume":"21","author":"Hu","year":"2005","journal-title":"Bioinformatics (ISMB 2005)"},{"key":"2023012507543907300_B3","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","article-title":"Uncovering the overlapping community structure of complex networks in nature and society","volume":"435","author":"Palla","year":"2005","journal-title":"Nature"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/21\/2788\/48853350\/bioinformatics_26_21_2788.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/21\/2788\/48853350\/bioinformatics_26_21_2788.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T07:55:17Z","timestamp":1674633317000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/26\/21\/2788\/213990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,9]]},"references-count":3,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2010,11,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btq514","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2010,11,1]]},"published":{"date-parts":[[2010,9,9]]}}}