@misc{MayEisenhardtSchmidtEhrenbergetal.2003, author = {May, Andreas and Eisenhardt, Steffen and Schmidt-Ehrenberg, Johannes and Cordes, Frank}, title = {Rigid body docking for Virtual Screening}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7690}, number = {03-47}, year = {2003}, abstract = {A recently developed algorithm allows Rigid Body Docking of ligands to proteins, regardless of the accessibility and location of the binding site. The Docking procedure is divided into three subsequent optimization phases, two of which utilize rigid body dynamics. The last one is applied with the ligand already positioned inside the binding pocket and accounts for full flexibility. Initially, a combination of geometrical and force-field based methods is used as a Coarse Docking strategy, considering only Lennard-Jones interactions between the target and pharmaceutically relevant atoms or functional groups. The protein is subjected to a Hot Spot Analysis, which reveals points of high affinity in the protein environment towards these groups. The hot spots are distributed into different subsets according to their group affiliation. The ligand is described as a complementary point set, consisting of the same subsets. Both sets are matched in \$\mathrm{I\!R}^{3}\$, by superimposing members of the same subsets. In the first instance, steric inhibition is nearly neglected, preventing the system's trajectory from trapping in local minima and thus from finding false positive solutions. Hence the exact location of the binding site can be determined fast and reliably without any additional information. Subsequently, errors resulting from approximations are minimized via finetuning, this time considering both Lennard-Jones and Coulomb forces. Finally, the potential energy of the whole complex is minimized. In a first evaluation, results are rated by a reduced scoring function considering only noncovalent interaction energies. Exemplary Screening results will be given for specific ligands.}, language = {en} } @misc{BoitCordes2003, author = {Boit, Alice and Cordes, Frank}, title = {RNA 3D-Modeling}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7708}, number = {03-48}, year = {2003}, abstract = {This article presents a new computational approach to the three-dimensional (3D) modeling of ribonucleic acid (RNA) sequences with unknown spatial structure. The main concept is a mapping of the query sequence onto the 3D structures of a suitable template RNA molecule. This technique called \textit{threading} has originally been developed for the modeling of protein 3D structures. The application to RNA systems bridges the information gap between the growing mass of RNA sequence data and the relatively limited number of available 3D structures. The new RNA threading method is demonstrated on a tRNA model system because sufficient representative 3D structures have experimentally been elucidated and deposited in the public databases. Nevertheless, the method is in principle transferable on all other RNA species. Algorithms are developed that decompose these template structures into their secondary structure elements and gather this information in a specific template database. The best template is chosen with public alignment and secondary structure prediction tools which are integrated in the RNA modeling module. The structural information gathered from the template and the best alignment is combined to establish a comprehensive 3D model of the query sequence. A range of complete tRNA structures has successfully been modeled with the RNA threading method. The prototype module visualizes the models and provides convenient access to the proposed 3D structures. Therefore, the method could give new insight into a variety of RNA systems which in the recent years have become increasingly important as potential new pharmaceutical agents.}, language = {en} } @misc{DeuflhardSchuetteCordesetal.1999, author = {Deuflhard, Peter and Sch{\"u}tte, Christof and Cordes, Frank and M{\"u}ller-Kurth, L.}, title = {Konformationsdynamik. Mathematischer Entwurf hochspezifischer Biomolek{\"u}le}, publisher = {In: D. H{\"o}mberg (ed.), 8. Veranstaltungsreihe Forschungspolitische Dialoge in Berlin: Angewandte Mathematik - die verborgene Schl{\"u}sseltechnologie, 30. April 1999, Konrad-Zuse-Zentrum Berlin, pp. 30-34}, year = {1999}, language = {en} } @article{CordesPreissnerSteinke2003, author = {Cordes, Frank and Preissner, Robert and Steinke, Thomas}, title = {How Does a Protein Work?}, volume = {18}, journal = {BioTOPics J. of Biotechnology Berlin-Brandenburg}, number = {2}, pages = {4 -- 5}, year = {2003}, language = {en} } @inproceedings{WendeCordesSteinke2014, author = {Wende, Florian and Cordes, Frank and Steinke, Thomas}, title = {Concurrent Kernel Execution on Xeon Phi within Parallel Heterogeneous Workloads}, volume = {8632}, booktitle = {Euro-Par 2014: Parallel Processing. 20th International Conference, Porto, Portugal, August 25-29, 2014, Proceedings}, doi = {10.1007/978-3-319-09873-9_66}, pages = {788 -- 799}, year = {2014}, language = {en} } @inproceedings{NoackWendeSteinkeetal.2014, author = {Noack, Matthias and Wende, Florian and Steinke, Thomas and Cordes, Frank}, title = {A Unified Programming Model for Intra- and Inter-Node Offloading on Xeon Phi Clusters}, booktitle = {SC '14: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. SC14, November 16-21, 2014, New Orleans, Louisiana, USA}, doi = {10.1109/SC.2014.22}, year = {2014}, abstract = {Standard offload programming models for the Xeon Phi, e.g. Intel LEO and OpenMP 4.0, are restricted to a single compute node and hence a limited number of coprocessors. Scaling applications across a Xeon Phi cluster/supercomputer thus requires hybrid programming approaches, usually MPI+X. In this work, we present a framework based on heterogeneous active messages (HAM-Offload) that provides the means to offload work to local and remote (co)processors using a unified offload API. Since HAM-Offload provides similar primitives as current local offload frameworks, existing applications can be easily ported to overcome the single-node limitation while keeping the convenient offload programming model. We demonstrate the effectiveness of the framework by using it to enable a real-world application from the field of molecular dynamics to use multiple local and remote Xeon Phis. The evaluation shows good scaling behavior. Compared with LEO, performance is equal for large offloads and significantly better for small offloads.}, language = {en} } @misc{WendeSteinkeCordes2014, author = {Wende, Florian and Steinke, Thomas and Cordes, Frank}, title = {Multi-threaded Kernel Offloading to GPGPU Using Hyper-Q on Kepler Architecture}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-50362}, year = {2014}, abstract = {Small-scale computations usually cannot fully utilize the compute capabilities of modern GPGPUs. With the Fermi GPU architecture Nvidia introduced the concurrent kernel execution feature allowing up to 16 GPU kernels to execute simultaneously on a shared GPU device for a better utilization of the respective resources. Insufficient scheduling capabilities in this respect, however, can significantly reduce the theoretical concurrency level. With the Kepler GPU architecture Nvidia addresses this issue by introducing the Hyper-Q feature with 32 hardware managed work queues for concurrent kernel execution. We investigate the Hyper-Q feature within heterogeneous workloads with multiple concurrent host threads or processes offloading computations to the GPU each. By means of a synthetic benchmark kernel and a hybrid parallel CPU-GPU real-world application, we evaluate the performance obtained with Hyper-Q on GPU and compare it against a kernel reordering mechanism introduced by the authors for the Fermi architecture.}, language = {en} } @misc{FischerSchuetteDeuflhardetal.2001, author = {Fischer, Alexander and Sch{\"u}tte, Christof and Deuflhard, Peter and Cordes, Frank}, title = {Hierarchical Uncoupling-Coupling of Metastable Conformations}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6296}, number = {01-03}, year = {2001}, abstract = {Uncoupling-coupling Monte Carlo (UCMC) combines uncoupling techniques for finite Markov chains with Markov chain Monte Carlo methodology. UCMC aims at avoiding the typical metastable or trapping behavior of Monte Carlo techniques. From the viewpoint of Monte Carlo, a slowly converging long-time Markov chain is replaced by a limited number of rapidly mixing short-time ones. Therefore, the state space of the chain has to be hierarchically decomposed into its metastable conformations. This is done by means of combining the technique of conformation analysis as recently introduced by the authors, and appropriate annealing strategies. We present a detailed examination of the uncoupling-coupling procedure which uncovers its theoretical background, and illustrates the hierarchical algorithmic approach. Furthermore, application of the UCMC algorithm to the \$n\$-pentane molecule allows us to discuss the effect of its crucial steps in a typical molecular scenario.}, language = {en} } @misc{GalliatDeuflhardRoitzschetal.2000, author = {Galliat, Tobias and Deuflhard, Peter and Roitzsch, Rainer and Cordes, Frank}, title = {Automatic Identification of Metastable Conformations via Self-Organized Neural Networks}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6197}, number = {00-51}, year = {2000}, abstract = {As has been shown recently, the identification of metastable chemical conformations leads to a Perron cluster eigenvalue problem for a reversible Markov operator. Naive discretization of this operator would suffer from combinatorial explosion. As a first remedy, a pre-identification of essential degrees of freedom out of the set of torsion angles had been applied up to now. The present paper suggests a different approach based on neural networks: its idea is to discretize the Markov operator via self-organizing (box) maps. The thus obtained box discretization then serves as a prerequisite for the subsequent Perron cluster analysis. Moreover, this approach also permits exploitation of additional structure within embedded simulations. As it turns out, the new method is fully automatic and efficient also in the treatment of biomolecules. This is exemplified by numerical results.}, language = {en} } @misc{MeyerMollCordesetal.2006, author = {Meyer, Holger and Moll, Sebastian and Cordes, Frank and Weber, Marcus}, title = {ConFlow? A new space-based Application for complete Conformational Analysis of Molecules}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-9258}, number = {06-31}, year = {2006}, abstract = {Biochemical interactions are determined by the 3D-structure of the involved components - thus the identification of conformations is a key for many applications in rational drug design. {\sf ConFlow} is a new multilevel approach to conformational analysis with main focus on completeness in investigation of conformational space. In contrast to known conformational analysis, the starting point for design is a space-based description of conformational areas. A tight integration of sampling and analysis leads to an identification of conformational areas simultaneously during sampling. An incremental decomposition of high-dimensional conformational space is used to guide the analysis. A new concept for the description of conformations and their path connected components based on convex hulls and {\em Hypercubes}is developed. The first results of the {\sf ConFlow} application constitute a 'proof of concept' and are further more highly encouraging. In comparison to conventional industrial applications, {\sf ConFlow} achieves higher accuracy and a specified degree of completeness with comparable effort.}, language = {en} }