title: ODES: an overlapping dense sub-graph algorithm.
abstract: CONCLUSIONS
  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.
  
  
  METHODS
  http://dense.sf.net
authors.affiliation: International Arctic Research Center and Department of Computer Science, University of Alaska-Fairbanks, AK 99775, USA. jlong@alaska.edu
authors.forename: James
authors.initials: J
authors.lastname: Long
authors.forename: Chris
authors.initials: C
authors.lastname: Hartman
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods; D003196:Computer Graphics; D012333:RNA, Messenger / Q000235:genetics*; D012984:Software
chemical_list: D012333:RNA, Messenger