← Revision 1 as of 2008-07-14 15:59:24 →
Size: 218
Comment:
|
Size: 654
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 8: | Line 8: |
Line 9: | Line 10: |
I have implemented two community structure algorithms, fast-greedy and fast-greedy w/consolidation ratio into a cytoscape plugin 'GLay'. This plugin allow user to partition an input graph into clusters which maximizes intra-cluster edge density and minimizes inter-cluster edge density w.r.t. a random erdos-renyi graph. These clusters may imply biological complexes or pathways. A miniposter demonstrating the GUI is attached below. |
Presenter: Gang Su, Bioinformatics Program, University of Michigan, USA
http://suganglog.blogspot.com/
Title: Normalizing Visualization with Hierarchical Community Structure
Abstract:
I have implemented two community structure algorithms, fast-greedy and fast-greedy w/consolidation ratio into a cytoscape plugin 'GLay'. This plugin allow user to partition an input graph into clusters which maximizes intra-cluster edge density and minimizes inter-cluster edge density w.r.t. a random erdos-renyi graph. These clusters may imply biological complexes or pathways. A miniposter demonstrating the GUI is attached below.