ODES: an overlapping dense sub-graph algorithm.
Where this comes from
- Record sourced from PubMed, PMID 20829442.
- Also identified by DOI 10.1093/bioinformatics/btq514.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. http://dense.sf.net
Medical subject headings
- Algorithms
- RNA, Messenger
- Software