Semi-bipartite graph visualization for gene ontology networks

Authors:
Kai Xu;Rohan Williams;Seok-Hee Hong;Qing Liu;Ji Zhang
Affiliations:
CSIRO, Australia;Australian National University, Australia;School of Information Technologies, University of Sydney, Australia;CSIRO, Australia;The University of Southern Queensland, Australia
Venue:
GD'09 Proceedings of the 17th international conference on Graph Drawing
Year:
2009

Citing 12
Cited 0

Tree visualization with tree-maps: 2-d space-filling approach

ACM Transactions on Graphics (TOG)
An open graph visualization system and its applications to software engineering

Software—Practice & Experience - Special issue on discrete algorithm engineering
Drawing graphs: methods and models

Drawing graphs: methods and models
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering
Which Aesthetic has the Greatest Effect on Human Understanding?

GD '97 Proceedings of the 5th International Symposium on Graph Drawing
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings

Discrete & Computational Geometry
Ontologizing gene-expression microarray data: characterizing clusters with Gene Ontology

Bioinformatics
BiNGO: a Cytoscape plugin to assess overrepresentation of Gene Ontology categories in Biological Networks

Bioinformatics
Ontological analysis of gene expression data: current tools, limitations, and open problems

Bioinformatics
Ontology visualization methods—a survey

ACM Computing Surveys (CSUR)
GEOMI: GEOmetry for maximum insight

GD'05 Proceedings of the 13th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose three layout algorithms for semi-bipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis. We also introduce a method that effectively reduces visual complexity by removing less informative nodes. The drawing quality and running time are evaluated with five real-world datasets, and the results show significant reduction in crossing number and total edge length. All the proposed methods are available in visualization package GEOMI [1], and are well received by domain users.