A system for interactive visual analysis of large graphs using motifs in graph editing and aggregation

VMV 2009 - Proceedings of the Vision, Modeling, and Visualization Workshop 2009

Volumn , Issue , 2009, Pages 331-340

  von Landesberger, Tatiana ^a,b   Görner, Melanie ^b   Rehner, Robert ^b   Schreck, Tobias ^b  

^a FRAUNHOFER IGD   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC ANALYSIS; GRAPH LAYOUT ALGORITHMS; INTERACTIVE VISUAL ANALYSIS; NETWORK STRUCTURES; SUPPORTING ANALYSIS; TRANSPORTATION NETWORK; UNWEIGHTED GRAPHS; VISUALIZATION OF GRAPHS;

ALGORITHMS; ITERATIVE METHODS; VISUALIZATION;

DIRECTED GRAPHS;

EID: 84887546556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A.T. Adai, S.V. Date, S. Wieland, and E.M. Marcotte. Lgl: creatingamapofproteinfunctionwithan algorithm for visualizing very large biological networks. Journal of Molecular Biology, 340(1):179-190, June 2004.
2. D. Archambault, T. Munzner, and D. Auber. Grouseflocks: Steerable exploration of graph hierarchy space. IEEE Transactions on Visualization and Computer Graphics, 14(4):900-913, July 2008.
3. Daniel Archambault, David Auber, and Tamara Munzner. Topolayout: Multilevel graph layout by topological features. IEEE Transactions on Visualization and Computer Graphics, 13(2):305-317, 2007.
4. Daniel Archambault, Tamara Munzner, and David Auber. Tuggraph: Pathpreserving hierarchies for browsing proximity and paths in graphs. In Proceedings IEEE VGTC Pacific Visualization Symposium, pages 113-120, April 2009.
5. D. Auber, Y. Chiricota, F. Jourdan, and G. Melancon. Multiscale visualization of small world networks. IEEE Symposium on Information Visualization, pages 75-81, 2003.
6. Pawel Gajer and Stephen G. Kobourov. Grip: Graph drawing with intelligent placement. In GD'00:Proceedings of the 8th International Symposium on Graph Drawing, pages 222-228, London, UK, 2001. Springer-Verlag.
7. Joshua Grochow and Manolis Kellis. Network motif discovery using subgraph enumeration and symmetry-breaking. Research. In Computational Molecular Biology, pages 92-106, 2007.
8. Paul Holleis, Thomas Zimmermann, and Daniel Gmach. Drawing graphs within graphs. Journal of Graph Algorithms and Applications, 9(1):7-18, Oct. 2005.
9. Weidong Huang, C. Xiaobin Shen Murray, Le Song, Ying Xin Wu, and Lanbo Zheng. Visualisation and analysis of network motifs. In Proceedings. Ninth International Conference on Information Visualisation, 2005., pages 697-702, July 2005.
10. Christian Klukas, Falk Schreiber, and Henning Schwöbbermeyer. Coordinated perspectives and enhanced forcedirected layout for the analysis of network motifs. In Proceedings of Asia-Pacific Symposium on Information Visualisation (APVis 2006), pages 39-48, 2006.
11. G. Kumar and M. Garland. Visual exploration of complex time-varying graphs. IEEE Transactions on Visualization and Computer Graphics, 12(5):805-812, Sept.-Oct. 2006.
12. Jure Leskovec and Christos Faloutsos. Sampling from large graphs. In Proc. of the 12th ACM SIGKDD Int. Conference on Knowledge Discovery and data mining, pages 631-636, 2006.
13. Avi Ma'ayan, Sherry Jenkins, Ryan Webb, Seth Berger, Sudarshan Purushothaman, Noura A. Husn, Jeremy Posner, Tony Flores, and Ravi Iyengar.Snavi: Desktop application for analysis and visualization of largescale signaling networks. BMC Systems Biology, 1(3), 2009.
14. M.Finder and M.Draw. http://www.weizmann.ac.il/mcb/UriAlon/groupNetworkMotifSW.html (accessed 5.6.2009).
15. Joshua O'Madadhain, Danyel Fisher, and Scott White. Java universal graph framework (JUNG) http://jung.sourceforge.net/.
16. Falk Schreiber and Henning Schwöbbermeyer. Mavisto: a tool for the exploration of network motifs. Bioinformatics, 21(17):3572-3574, July 2005.
17. Henning Schwbbermeyer. Analysis of Biological Networks, chapter5, pages 85-112. Wiley Serieson Bioinformatics, Computational Techniques and Engineering. Wiley, 2008.
18. VAST Contest. http://www.cs.umd.edu/hcil/VASTchallenge08/ (accessed 19.6.2009).
19. S. Wernicke and F. Rasche. Fanmod: a tool for fast network motif detection. Bioinformatics, 22(9):1152-1153, 2006.
20. Sebastian Wernicke. Efficient detection of network motifs. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(4):347-359, 2006.