Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
IEEE Software
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
GD '95 Proceedings of the Symposium on Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Dynamic Drawing of Clustered Graphs
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
A hybrid model for drawing dynamic and evolving graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Dynamic graph drawing of sequences of orthogonal and hierarchical graphs
GD'04 Proceedings of the 12th international conference on Graph Drawing
In silica evolution of early metabolism
Artificial Life
Topology-based visualization of transformation pathways in complex chemical systems
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
dPSO-vis: topology-based visualization of discrete particle swarm optimization
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
| Hi-index | 0.00 |
Dynamical models that explain the formation of spatial structures of RNA molecules have reached a complexity that requires novel visualization methods that help to analyze the validity of these models. Here, we focus on the visualization of so-called folding landscapes of a growing RNA molecule. Folding landscapes describe the energy of a molecule as a function of its spatial configuration; thus they are huge and high dimensional. Their most salient features, however, are encapsulated by their so-called barrier tree that reflects the local minima and their connecting saddle points. For each length of the growing RNA chain there exists a folding landscape. We visualize the sequence of folding landscapes by an animation of the corresponding barrier trees. To generate the animation, we adapt the foresight layout with tolerance algorithm for general dynamic graph layout problems. Since it is very general, we give a detailed description of each phase: constructing a supergraph for the trees, layout of that supergraph using a modified DOT algorithm, and presentation techniques for the final animation.