| ODES: an overlapping dense sub-graph algorithm. | |
| | |
MedLine Citation:
|
PMID: 20829442 Owner: NLM Status: In-Process |
Abstract/OtherAbstract:
|
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. Availability and Implementation: http://dense.sf.net |
| | |
Authors:
|
James Long; Chris Hartman |
Publication Detail:
|
Type: Journal Article Date: 2010-09-09 |
Journal Detail:
|
Title: Bioinformatics (Oxford, England) Volume: 26 ISSN: 1367-4811 ISO Abbreviation: Bioinformatics Publication Date: 2010 Nov |
Date Detail:
|
Created Date: 2010-10-22 Completed Date: - Revised Date: - |
Medline Journal Info:
|
Nlm Unique ID: 9808944 Medline TA: Bioinformatics Country: England |
Other Details:
|
Languages: eng Pagination: 2788-9 Citation Subset: IM |
Affiliation:
|
International Arctic Research Center and Department of Computer Science, University of Alaska-Fairbanks, AK 99775, USA. jlong@alaska.edu |
Export Citation:
|
APA/MLA Format Download EndNote Download BibTex |
| MeSH Terms | |
Descriptor/Qualifier:
|
|
From MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine
Previous Document: Absence of high-risk human papillomavirus (HPV) detection in endocervical adenocarcinoma with gastri...
Next Document: SBML2TikZ: supporting the SBML render extension in LaTeX.