Treemaps for Directed Acyclic Graphs
Gene Ontology information related to the biological role of genes is organized in a hierarchical manner that can be represented by a directed acyclic graph (DAG). Treemaps graphically represent hierarchical information via a two-dimensional rectangular map. They efficiently display large trees in limited screen space. Treemaps have been used to visualize the Gene Ontology by first transforming the DAG into a tree. However this transformation has several undesirable effects such as producing trees with a large number of nodes and scattering the rectangles associated with the duplicates of a node around the screen. In this paper we introduce the problem of visualizing a DAG as a treemap, we present two special cases, and we discuss complexity results.
KeywordsTreemap Directed Acyclic Graph (DAG) Visualization Gene Ontology
- 1.Baehrecke, E., Dang, N., Babaria, K., Shneiderman, B.: Visualization and analysis of microarray and gene ontology data with treemaps. BMC Bioinformatics 5(84) (2004)Google Scholar
- 2.Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of graphs. Prentice - Hall, New Jersey, U.S.A. (1998)Google Scholar
- 5.Bruls, M., Huizing, K., van Wijk, J.J.: Squarified treemaps. In: Proceedings of Joint Eurographics and IEEE TCVG Symposium on Visualization, p. 33. Springer, Heidelberg (2000)Google Scholar
- 8.Hsu, W.-L.: PC-Trees vs. PQ-Trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, p. 207. Springer, Heidelberg (2001)Google Scholar