H
Hans-Peter Lenhof
Researcher at Saarland University
Publications - 170
Citations - 6982
Hans-Peter Lenhof is an academic researcher from Saarland University. The author has contributed to research in topics: Cancer & Macromolecular docking. The author has an hindex of 44, co-authored 164 publications receiving 6046 citations. Previous affiliations of Hans-Peter Lenhof include Max Planck Society.
Papers
More filters
Journal ArticleDOI
Genome-wide MicroRNA Expression Profiles in COPD: Early Predictors for Cancer Development.
Andreas Keller,Tobias Fehlmann,Nicole Ludwig,Mustafa Kahraman,Thomas Laufer,Christina Backes,Claus Vogelmeier,Caroline Diener,Frank Biertz,Christian Herr,Rudolf A. Jörres,Hans-Peter Lenhof,Eckart Meese,Robert Bals +13 more
TL;DR: Several miRNAs in blood of COPD patients, which could serve as candidates for biomarkers to help identify patients at risk of developing cancer, are identified.
Journal ArticleDOI
BiNA: a visual analytics tool for biological network data.
Andreas Gerasch,Daniel Faber,Jan Küntzer,Peter Niermann,Oliver Kohlbacher,Hans-Peter Lenhof,Michael Kaufmann +6 more
TL;DR: BiNA - the Biological Network Analyzer is a flexible open-source software for analyzing and visualizing biological networks and provides powerful functionalities for visual analyses of high-throughput omics data in the context of networks, in particular for the differential analysis and the analysis of time series data.
Journal ArticleDOI
A minimally invasive multiple marker approach allows highly efficient detection of meningioma tumors.
Andreas Keller,Nicole Ludwig,Nicole Comtesse,Andreas Hildebrandt,Eckart Meese,Hans-Peter Lenhof +5 more
TL;DR: This study proves that the inclusion of non-specific antigens, detected not only in tumor but also in normal sera, increases the performance significantly, since non- Specific Antigens contribute additional diagnostic information.
Journal ArticleDOI
Lectin-sugar interaction. Calculated versus experimental binding energies.
TL;DR: The predicted binding site, ligand orientation, and details of the binding mode are in perfect agreement with the known crystal structure of WGA with a sialoglycopeptide and illustrate the usefulness of docking-based methods for the qualitative and quantitative prediction of protein--carbohydrate interactions.
Journal ArticleDOI
Sequential and parallel algorithms for the k closest pairs problem
Hans-Peter Lenhof,Michiel Smid +1 more
TL;DR: A new and simpler proof is given of Salowe’s theorem, i.e., a sequential algorithm is given that computes the k closest pairs in the set S in O(n log n+k) time, using O-dimensional space, and is, therefore, optimal.