PMCCPMCCPMCC

Search tips
Search criteria 

Advanced

Logo of ploscompComputational BiologyView this ArticleSubmit to PLoSGet E-mail AlertsContact UsPublic Library of Science (PLoS)
 
From:
Published online 2010 April 15. doi: 10.1371/journal.pcbi.1000742

Figure 1

An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.g001.jpg
Schematic of JointCluster algorithm with scaling heuristic.

Clustering tree produced from a simultaneous clustering of two networks An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.e001.jpg and An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.e002.jpg. JointCluster can handle any number of networks, and the scaling heuristic transitions from a sum graph An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.e003.jpg to the smallest of the sparse cuts in the individual graphs An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.e004.jpg in increments of a scale parameter. At scale An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.e005.jpg, the graphs being analysed are An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.e006.jpg and An external file that holds a picture, illustration, etc.
Object name is pcbi.1000742.e007.jpg. Only some steps of the scaling heuristic are shown here for simplicity, and complete description is provided in Methods. Graph-specific clusters are shown as different shaded regions within a larger set of nodes.

Images in this article

  • Figure 1
  • Figure 2
  • Figure 3
  • Figure 4
  • Figure 5
  • Figure 6
Click on the image to see a larger version.