Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
On the consecutive ones property
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
ACM Transactions on Graphics (TOG)
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
Visualization of functional aspects of microRNA regulatory networks using the gene ontology
ISBMDA'06 Proceedings of the 7th international conference on Biological and Medical Data Analysis
Bounds on the number of slicing, mosaic, and general floorplans
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Graph Drawing
| Hi-index | 0.00 |
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.