Xu, Kai and Williams, Rohan and Hong, Seok-Hee and Liu, Qing and Zhang, Ji (2010) Semi-bipartite graph visualization for gene ontology networks. In: GD 2009: 17th International Symposium on Graph Drawing , 22-25 Sep 2009, Chicago, United States.
Metadata
| HTML Citation | EndNote | Dublin Core | Reference Manager |
Full text available as:
| PDF (Author's Version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 285Kb | |
| PDF (Published Version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 215Kb | |
| PDF (Documentation) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 760Kb |
Official URL: http://www.springerlink.com/content/y41046p205475457/fulltext.pdf
Identification Number or DOI: doi: 10.1007/978-3-642-11805-0_24
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, and are well received by domain users.
Archive Staff Only: edit this record
