Semi-bipartite graph visualization for gene ontology networks

Xu, Kai ORCID logoORCID:, Williams, Rohan, Hong, Seok-Hee, Liu, Qing and Zhang, Ji (2010) Semi-bipartite graph visualization for gene ontology networks. In: Graph drawing : 17th International Symposium (GD 2009) Revised Papers. Springer, pp. 244-255. . [Book Section] (doi:10.1007/978-3-642-11805-0_24)


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.

Item Type: Book Section
Additional Information: Chicago, IL, USA, September 22-25, 2009.
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 11160
Useful Links:
Depositing User: Teddy ~
Date Deposited: 03 Jul 2013 16:04
Last Modified: 13 Oct 2016 14:27

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.