Name
Abstract | ||
|---|---|---|
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). Space lling visualizations, such as the treemaps, have the capacity to display thousands of items legibly in limited space via a two-dimensional rectangular map. Treemaps have been used to visualize the Gene Ontology by rst transforming the DAG into a tree. However this transformation has several undesirable eects such as producing trees with a large number of nodes and scattering the rectangles associated with the duplicates of a node around the display rectangle. In this paper we introduce the problem of visualizing a DAG with space lling techniques without converting it to a tree rst, we present two special cases of the problem, and we discuss complexity issues. |
Year | Venue | Keywords |
|---|---|---|
2009 | J. Graph Algorithms Appl. | directed acyclic graph |
Field | DocType | Volume |
Acyclic dependencies principle,Discrete mathematics,Combinatorics,Transitive reduction,Tree (graph theory),Topological sorting,Directed graph,Directed acyclic graph,Moral graph,Mathematics,Graph (abstract data type) | Journal | 13 |
Issue | Citations | PageRank |
3 | 3 | 0.40 |
References | Authors | |
15 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vassilis Tsiaras | 1 | 27 | 6.75 |
| Sofia Triantafilou | 2 | 23 | 3.44 |
| Ioannis G. Tollis | 3 | 1240 | 162.75 |