Biomedical subjects

Hans-Peter Lenhof

Publications and source records attributed to Hans-Peter Lenhof.

3 recordsLinked to original sources

PubMed2002

Lectin-sugar interaction. Calculated versus experimental binding energies.

Although a steadily increasing number of protein--ligand docking experiments have been performed successfully, there are only few studies concerning protein--sugar interactions. In this study, we investigate the interaction of wheat germ agglutinin (WGA) with N-acetylglucosamine and a number of its derivatives and predict the binding free energies using flexible docking techniques. To assess the quality of our predictions, we also determined those binding free energies experimentally in cell-binding studies. 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. Furthermore, we obtained an excellent linear correlation of our predicted binding free energies with both our own data and experimental data from the literature [Monsigny, M., Roche, A.C., Sene, C., Maget Dana, R. & Delmotte, F. (1980) Eur. J. Biochem. 104, 147-153.]. In both cases, predicted energies were within 1.0 kJ x mol(-1) of the experimental value. These results illustrate the usefulness of docking-based methods for the qualitative and quantitative prediction of protein--carbohydrate interactions. The insights gained from such theoretical studies may be used to complement the results from the still scarce crystal structures.

Binding Sites↗

PubMed2002

A combinatorial approach to protein docking with flexible side chains.

Rigid-body docking approaches are not sufficient to predict the structure of a protein complex from the unbound (native) structures of the two proteins. Accounting for side chain flexibility is an important step towards fully flexible protein docking. This work describes an approach that allows conformational flexibility for the side chains while keeping the protein backbone rigid. Starting from candidates created by a rigid-docking algorithm, we demangle the side chains of the docking site, thus creating reasonable approximations of the true complex structure. These structures are ranked with respect to the binding free energy. We present two new techniques for side chain demangling. Both approaches are based on a discrete representation of the side chain conformational space by the use of a rotamer library. This leads to a combinatorial optimization problem. For the solution of this problem, we propose a fast heuristic approach and an exact, albeit slower, method that uses branch-and-cut techniques. As a test set, we use the unbound structures of three proteases and the corresponding protein inhibitors. For each of the examples, the highest-ranking conformation produced was a good approximation of the true complex structure.

Algorithms↗

PubMed2002

Multiple sequence alignment with arbitrary gap costs: computing an optimal solution using polyhedral combinatorics.

Multiple sequence alignment is one of the dominant problems in computational molecular biology. Numerous scoring functions and methods have been proposed, most of which result in NP-hard problems. In this paper we propose for the first time a general formulation for multiple alignment with arbitrary gap-costs based on an integer linear program (ILP). In addition we describe a branch-and-cut algorithm to effectively solve the ILP to optimality. We evaluate the performances of our approach in terms of running time and quality of the alignments using the BAliBase database of reference alignments. The results show that our implementation ranks amongst the best programs developed so far.

Algorithms↗