Semi-bipartite Graph Visualization for Gene Ontology Networks

Abstract. In this paper we propose three layout algorithms for semibipartite 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.

• Type: Conference
• Year: 2009
• Where: GD
• Authors: Kai Xu 0003, Rohan Williams, Seok-Hee Hong, Qing Liu, Ji Zhang
• Keywords: Computer Graphics, GD 2009, Semibipartite Graphs—bipartite Graphs, Total Edge Length, five Real-world Datasets