scispace - formally typeset
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
Proceedings ArticleDOI

New contact measures for the protein docking problem

TL;DR: A parallel distributed algorithm for the rigid-body protein docking problem based on a new fitness fuJ1ction for evaluating the surface mat, which was an approximation of the real conformation.
Journal ArticleDOI

Using persistent data structures for adding range restrictions to searching problems

TL;DR: In this article, a technique generale is proposed to transform a structure of donnees partiellement persistant in solving a problem of recherche decomposable, en a structure for le meme problem mais soumis a des contraintes supplementaires.
Journal ArticleDOI

Modulation of intracellular calcium signaling by microRNA-34a-5p.

TL;DR: It is shown that miR-34a-5p, a small non-coding RNA that is deregulated in many common diseases, is a regulator of store-operated Ca2+ entry (SOCE) and calcineurin signaling and a possible future approach to manipulate immune cells for clinical interventions.
Proceedings ArticleDOI

Measuring properties of molecular surfaces using ray casting

TL;DR: A very general and highly efficient approach for the accurate computation of molecular geometric properties, which is applicable to arbitrary molecular surface models, and relies on a high performance ray casting framework that can be easily adapted to the computation of further quantities of interest at interactive speed.

Phylogenetics from paralogs

TL;DR: The novel method introduced here relies on solving three intertwined NP-hard optimization problems: the cograph editing problem, the maximum consistent triple set problem, and the least resolved tree problem to demonstrate that plausible phylogenetic trees can be inferred from paralogy information only.