@article{SchmidtEhrenbergBaumHege2001, author = {Schmidt-Ehrenberg, Johannes and Baum, Daniel and Hege, Hans-Christian}, title = {Visually stunning - Molecular conformations}, series = {The Biochemist}, volume = {23}, journal = {The Biochemist}, number = {5}, pages = {22 -- 26}, year = {2001}, language = {en} } @inproceedings{SchmidtEhrenbergBaumHege2002, author = {Schmidt-Ehrenberg, Johannes and Baum, Daniel and Hege, Hans-Christian}, title = {Visualizing Dynamic Molecular Conformations}, series = {Proceedings of IEEE Visualization 2002}, booktitle = {Proceedings of IEEE Visualization 2002}, editor = {J. Moorhead, Robert and Gross, Markus and I. Joy, Kenneth}, publisher = {IEEE Computer Society Press}, address = {Boston MA, USA}, doi = {10.1109/VISUAL.2002.1183780}, pages = {235 -- 242}, year = {2002}, language = {en} } @misc{Baum, author = {Baum, Daniel}, title = {Finding All Maximal Cliques of a Family of Induced Subgraphs}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7758}, number = {03-53}, abstract = {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.}, language = {en} } @misc{Baum, author = {Baum, Daniel}, title = {Multiple Semi-flexible 3D Superposition of Drug-sized Molecules}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8278}, number = {04-52}, abstract = {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.}, language = {en} } @inproceedings{Baum2005, author = {Baum, Daniel}, title = {Multiple semi-flexible 3D superposition of drug-sized molecules}, series = {Computational Life Sciences: First International Symposium, CompLife 2005}, volume = {3695}, booktitle = {Computational Life Sciences: First International Symposium, CompLife 2005}, publisher = {Springer}, address = {Konstanz, Germany}, doi = {10.1007/11560500_18}, pages = {198 -- 207}, year = {2005}, language = {en} } @inproceedings{BaumHege2006, author = {Baum, Daniel and Hege, Hans-Christian}, title = {A Point-matching based algorithm for 3D surface alignment of drug-sized molecules}, series = {Computational Life Sciences II, Second International Symposium, CompLife 2006, Cambridge (UK), Sept. 2006}, volume = {4216}, booktitle = {Computational Life Sciences II, Second International Symposium, CompLife 2006, Cambridge (UK), Sept. 2006}, publisher = {Springer}, doi = {10.1007/11875741_18}, pages = {183 -- 193}, year = {2006}, language = {en} } @phdthesis{Baum2007, author = {Baum, Daniel}, title = {A Point-Based Algorithm for Multiple 3D Surface Alignment of Drug-Sized Molecules}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:188-fudissthesis000000002759-2}, school = {Freie Universit{\"a}t Berlin}, year = {2007}, abstract = {One crucial step in virtual drug design is the identification of new lead structures with respect to a pharmacological target molecule. The search for new lead structures is often done with the help of a pharmacophore, which carries the essential structural as well as physico-chemical properties that a molecule needs to have in order to bind to the target molecule. In the absence of the target molecule, such a pharmacophore can be established by comparison of a set of active compounds. In order to identify their common features,a multiple alignment of all or most of the active compounds is necessary. Moreover, since the "outer shape" of the molecules plays a major role in the interaction between drug and target, an alignment algorithm aiming at the identification of common binding properties needs to consider the molecule's "outer shape", which can be approximated by the solvent excluded surface. In this thesis, we present a new approach to molecular surface alignment based on a discrete representation of shape as well as physico-chemical properties by points distributed on the solvent excluded surface. We propose a new method to distribute points regularly on a surface w.r.t. a smoothly varying point density given on that surface. Since the point distribution algorithm is not restricted to molecular surfaces, it might also be of interest for other applications. For the computation of pairwise surface alignments, we extend an existing point matching scheme to surface points, and we develop an efficient data structure speeding up the computation by a factor of three. Moreover, we present an approach to compute multiple alignments from pairwise alignments, which is able to handle a large number of surface points. All algorithms are evaluated on two sets of molecules: eight thermolysin inhibitors and seven HIV-1 protease inhibitors. Finally, we compare the results obtained from surface alignment with the results obtained by applying an atom alignment approach.}, language = {en} } @article{LindowBaumProhaskaetal.2010, author = {Lindow, Norbert and Baum, Daniel and Prohaska, Steffen and Hege, Hans-Christian}, title = {Accelerated Visualization of Dynamic Molecular Surfaces}, series = {Comput. Graph. Forum}, volume = {29}, journal = {Comput. Graph. Forum}, doi = {10.1111/j.1467-8659.2009.01693.x}, pages = {943 -- 952}, year = {2010}, language = {en} } @article{LindowBaumHege2011, author = {Lindow, Norbert and Baum, Daniel and Hege, Hans-Christian}, title = {Voronoi-Based Extraction and Visualization of Molecular Paths}, series = {IEEE Transactions on Visualization and Computer Graphics}, volume = {17}, journal = {IEEE Transactions on Visualization and Computer Graphics}, number = {12}, doi = {10.1109/TVCG.2011.259}, pages = {2025 -- 2034}, year = {2011}, language = {en} } @inproceedings{HombergBaumProhaska2011, author = {Homberg, Ulrike and Baum, Daniel and Prohaska, Steffen}, title = {Describing and Analyzing the Dual Structures of Porous Media}, series = {Proc. 3D-Microstructure Meeting}, booktitle = {Proc. 3D-Microstructure Meeting}, editor = {M{\"u}cklich, Frank and Slussallek, Philipp and Schladitz, Katja}, pages = {24 -- 25}, year = {2011}, language = {en} }