TY - GEN
T1 - Semi-bipartite graph visualization for gene ontology networks
AU - Xu, Kai
AU - Williams, Rohan
AU - Hong, Seok Hee
AU - Liu, Qing
AU - Zhang, Ji
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77951594175&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-11805-0_24
DO - 10.1007/978-3-642-11805-0_24
M3 - Conference contribution
SN - 3642118046
SN - 9783642118043
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 244
EP - 255
BT - Graph Drawing - 17th International Symposium, GD 2009, Revised Papers
T2 - 17th International Symposium on Graph Drawing, GD 2009
Y2 - 22 September 2009 through 25 September 2009
ER -