TY - GEN A1 - Baum, Daniel T1 - Multiple Semi-flexible 3D Superposition of Drug-sized Molecules N2 - In this paper we describe a new algorithm for multiple semi-flexible superpositioning of drug-sized molecules. The algorithm identifies structural similarities of two or more molecules. When comparing a set of molecules on the basis of their three-dimensional structures, one is faced with two main problems. (1) Molecular structures are not fixed but flexible, i.e., a molecule adopts different forms. To address this problem, we consider a set of conformers per molecule. As conformers we use representatives of conformational ensembles, generated by the program ZIBMol. (2) The degree of similarity may vary considerably among the molecules. This problem is addressed by searching for similar substructures present in arbitrary subsets of the given set of molecules. The algorithm requires to preselect a reference molecule. All molecules are compared to this reference molecule. For this pairwise comparison we use a two-step approach. Clique detection on the correspondence graph of the molecular structures is used to generate start transformations, which are then iteratively improved to compute large common substructures. The results of the pairwise comparisons are efficiently merged using binary matching trees. All common substructures that were found, whether they are common to all or only a few molecules, are ranked according to different criteria, such as number of molecules containing the substructure, size of substructure, and geometric fit. For evaluating the geometric fit, we extend a known scoring function by introducing weights which allow to favor potential pharmacophore points. Despite considering the full atomic information for identifying multiple structural similarities, our algorithm is quite fast. Thus it is well suited as an interactive tool for the exploration of structural similarities of drug-sized molecules. T3 - ZIB-Report - 04-52 KW - pharmaceutical drug design KW - multiple superposition KW - semi-flexible alignment KW - clique detection KW - iterative closest point KW - matching tree Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8278 ER - TY - GEN A1 - Baum, Daniel T1 - Finding All Maximal Cliques of a Family of Induced Subgraphs N2 - Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is to find large sets of points satisfying some mutual relationship. This problem can be transformed to the problem of finding all cliques of an undirected graph by mapping each point onto a vertex of the graph and connecting any two vertices by an edge whose corresponding points satisfy our desired relationship. Clique detection has been widely studied and there exist efficient algorithms. In this paper we study a related problem, where all points have a set of binary attributes, each of which is either 0 or 1. This is only a small limitation, since all discrete properties can be mapped onto binary attributes. In our case, we want to find large sets of points not only satisfying some mutual relationship; but, in addition, all points of a set also need to have at least one common attribute with value 1. The problem we described can be mapped onto a set of induced subgraphs, where each subgraph represents a single attribute. For attribute $i$, its associated subgraph contains those vertices corresponding to the points with attribute $i$ set to 1. We introduce the notion of a maximal clique of a family, $\mathcal{G}$, of induced subgraphs of an undirected graph, and show that determining all maximal cliques of $\mathcal{G}$ solves our problem. Furthermore, we present an efficient algorithm to compute all maximal cliques of $\mathcal{G}$. The algorithm we propose is an extension of the widely used Bron-Kerbosch algorithm. T3 - ZIB-Report - 03-53 KW - Bron-Kerbosch algorithm KW - maximal cliques KW - vertex properties KW - family of induced subgraphs KW - backtracking algorithm KW - branch and bound technique KW - re Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7758 ER - TY - GEN A1 - Klindt, Marco A1 - Baum, Daniel A1 - Prohaska, Steffen A1 - Hege, Hans-Christian T1 - iCon.text – a customizable iPad app for kiosk applications in museum exhibitions N2 - We present iCon.text, a kiosk platform for the iPad centered around artefacts, whose content and layout can be tailored without programming skills for specific museum exhibitions. The central metaphor to access information is a virtual postcard with one front and a customizable number of back sides that provide details about exhibits to museum visitors in textual and image form. Back sides can link to others cards. Access to these postcards is possible through one or more navigation views that can be navigated to from a navigation bar. The entry point to the application is designed as a multitouch interactive pile of cards in a playful manner that allows visitors of any age an easy approach to the presentation and interaction metaphor. To directly access a certain postcard, a mosaic view can be uitilized to provide an overview about all available exhibits. A category view groups postcards into themes. Locating artefacts on a zoomable map or exhibition floor plan allows for conveying information about spatial contexts between different objects and their location. Furthermore, contexts can be illustrated with a two stage view comprising an overview and corresponding detail views to provide further insights into the spatial, temporal, and thematic contexts of artefacts. The application scaffolding allows the design of bilingual presentations to support exhibitions with an international audience. The logo of the presenting institution or exhibition can be incorporated to display the the kiosk's corporate design branding and to access an imprint or further informations. Usage is logged into files to provide a basis for extracting statistical information about the usage. The details about the exhibits are presented as images and as such impose no limit to the design choices made by the content provider or exhibition designer. The application (enhanced with a panoramic view) has been integrated successfully into a large special exhibition about the ancient city of Pergamon 2011/2012 at the Pergamon Museum Berlin within the interdisciplinary project "Berlin Sculpture Network". T3 - ZIB-Report - 13-07 KW - HCI KW - Cultural Heritage KW - Kiosk application KW - iPad Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-17731 SN - 1438-0064 ER - TY - THES A1 - Runge, Daniel T1 - Algorithms and Methods for the Visualization of Molecular Surfaces and Interfaces Y1 - 1999 ER - TY - JOUR A1 - Schmidt-Ehrenberg, Johannes A1 - Baum, Daniel A1 - Hege, Hans-Christian T1 - Visually stunning - Molecular conformations JF - The Biochemist Y1 - 2001 VL - 23 IS - 5 SP - 22 EP - 26 ER - TY - CHAP A1 - Schmidt-Ehrenberg, Johannes A1 - Baum, Daniel A1 - Hege, Hans-Christian ED - J. Moorhead, Robert ED - Gross, Markus ED - I. Joy, Kenneth T1 - Visualizing Dynamic Molecular Conformations T2 - Proceedings of IEEE Visualization 2002 Y1 - 2002 U6 - https://doi.org/10.1109/VISUAL.2002.1183780 SP - 235 EP - 242 PB - IEEE Computer Society Press CY - Boston MA, USA ER - TY - GEN A1 - Homberg, Ulrike A1 - Baum, Daniel A1 - Wiebel, Alexander A1 - Prohaska, Steffen A1 - Hege, Hans-Christian T1 - Definition, Extraction, and Validation of Pore Structures in Porous Materials N2 - An intuitive and sparse representation of the void space of porous materials supports the efficient analysis and visualization of interesting qualitative and quantitative parameters of such materials. We introduce definitions of the elements of this void space, here called pore space, based on its distance function, and present methods to extract these elements using the extremal structures of the distance function. The presented methods are implemented by an image processing pipeline that determines pore centers, pore paths and pore constrictions. These pore space elements build a graph that represents the topology of the pore space in a compact way. The representations we derive from μCT image data of realistic soil specimens enable the computation of many statistical parameters and, thus, provide a basis for further visual analysis and application-specific developments. We introduced parts of our pipeline in previous work. In this chapter, we present additional details and compare our results with the analytic computation of the pore space elements for a sphere packing in order to show the correctness of our graph computation. T3 - ZIB-Report - 13-56 Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-42510 SN - 1438-0064 ER - TY - JOUR A1 - Hoch, Hannelore A1 - Wessel, Andreas A1 - Asche, Manfred A1 - Baum, Daniel A1 - Beckmann, Felix A1 - Bräunig, Peter A1 - Ehrig, Karsten A1 - Mühlethaler, Roland A1 - Riesemeier, Heinrich A1 - Staude, Andreas A1 - Stelbrink, Björn A1 - Wachmann, Ekkehard A1 - Weintraub, Phyllis A1 - Wipfler, Benjamin A1 - Wolff, Carsten A1 - Zilch, Mathias T1 - Non-Sexual Abdominal Appendages in Adult Insects Challenge a 300 Million Year Old Bauplan JF - Current Biology Y1 - 2014 U6 - https://doi.org/10.1016/j.cub.2013.11.040 VL - 24 IS - 1 SP - R16 EP - R17 ER - TY - GEN A1 - Lindow, Norbert A1 - Baum, Daniel A1 - Leborgne, Morgan A1 - Hege, Hans-Christian T1 - Interactive Visualization of RNA and DNA Structures N2 - The analysis and visualization of nucleic acids (RNA and DNA) play an increasingly important role due to the growing number of known 3-dimensional structures of such molecules. The great complexity of these structures, in particular, those of RNA, demands interactive visualization to get deeper insights into the relationship between the 2D secondary structure motifs and their 3D tertiary structures. Over the last decades, a lot of research in molecular visualization has focused on the visual exploration of protein structures while nucleic acids have only been marginally addressed. In contrast to proteins, which are composed of amino acids, the ingredients of nucleic acids are nucleotides. They form structuring patterns that differ from those of proteins and, hence, also require different visualization and exploration techniques. In order to support interactive exploration of nucleic acids, the computation of secondary structure motifs as well as their visualization in 2D and 3D must be fast. Therefore, in this paper, we focus on the performance of both the computation and visualization of nucleic acid structure. For the first time, we present a ray casting-based visualization of RNA and DNA secondary and tertiary structures, which enables real-time visualization of even large molecular dynamics trajectories. Furthermore, we provide a detailed description of all important aspects to visualize nucleic acid secondary and tertiary structures. With this, we close an important gap in molecular visualization. T3 - ZIB-Report - 18-33 KW - ribonucleic acids KW - DNA KW - RNA KW - secondary & tertiary structures KW - interactive rendering KW - ray casting KW - brushing & linking Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-69704 SN - 1438-0064 ER - TY - JOUR A1 - Lindow, Norbert A1 - Baum, Daniel A1 - Leborgne, Morgan A1 - Hege, Hans-Christian T1 - Interactive Visualization of RNA and DNA Structures JF - IEEE Transactions on Visualization and Computer Graphics N2 - The analysis and visualization of nucleic acids (RNA and DNA) is playing an increasingly important role due to their fundamental importance for all forms of life and the growing number of known 3D structures of such molecules. The great complexity of these structures, in particular, those of RNA, demands interactive visualization to get deeper insights into the relationship between the 2D secondary structure motifs and their 3D tertiary structures. Over the last decades, a lot of research in molecular visualization has focused on the visual exploration of protein structures while nucleic acids have only been marginally addressed. In contrast to proteins, which are composed of amino acids, the ingredients of nucleic acids are nucleotides. They form structuring patterns that differ from those of proteins and, hence, also require different visualization and exploration techniques. In order to support interactive exploration of nucleic acids, the computation of secondary structure motifs as well as their visualization in 2D and 3D must be fast. Therefore, in this paper, we focus on the performance of both the computation and visualization of nucleic acid structure. We present a ray casting-based visualization of RNA and DNA secondary and tertiary structures, which enables for the first time real-time visualization of even large molecular dynamics trajectories. Furthermore, we provide a detailed description of all important aspects to visualize nucleic acid secondary and tertiary structures. With this, we close an important gap in molecular visualization. Y1 - 2019 U6 - https://doi.org/10.1109/TVCG.2018.2864507 VL - 25 IS - 1 SP - 967 EP - 976 ER -