PubMed Health⌕ Search

Biomedical subjects

Philipp Heuser

Publications and source records attributed to Philipp Heuser.

3 recordsLinked to original sources

Optimised amino acid specific weighting factors for unbound protein docking.

BACKGROUND: One of the most challenging aspects of protein-protein docking is the inclusion of flexibility into the docking procedure. We developed a postfilter where the grid-representation of proteins for docking is extended by an optimised weighting factor for each amino acid. RESULTS: For up to 86% of the evaluated complexes a near-native structure was within the top 5% of the ranked prediction output. The weighting factors obtained by the optimisation procedure correlate to a certain extent with the flexibility of the amino acids, their hydrophobicity and with their propensity to be in the interface. CONCLUSION: Use of the optimised amino acid specific parameters yields a strong increase of near-native structures on the first ranks of the prediction.

Algorithms↗

Refinement of unbound protein docking studies using biological knowledge.

In this work we present two methods for the reranking of protein-protein docking studies. One scoring method searches the InterDom database for domains that are available in the proteins to be docked and evaluates the interaction of these domains in other complexes of known structure. The second one analyzes the interface of each proposed conformation with regard to the conservation of Phe, Met, and Trp and their polar neighbor residues. The special relevance of these residues is based on a publication by Ma et al. (Proc Natl Acad Sci USA 2003;100:5772-5777), who compared the conservation of all residues in the interface region to the conservation on the rest of the protein's surface. The scoring functions were tested on 30 unbound docking test cases. The evaluation of the methods is based on the ability to rerank the output of a Fast Fourier Transformation (FFT) docking. Both were able to improve the ranking of the docking output. The best improvement was achieved for enzyme-inhibitor examples. Especially the domain-based scoring function was successful and able to place a near-native solution on one of the first six ranks for 13 of 17 (76%) enzyme-inhibitor complexes [in 53% (nine complexes) even on the first rank]. The method evaluating residue conservation allowed us to increase the number of good solutions within the first 100 ranks out of approximately 9000 in 82% of the 17 enzyme-inhibitor test cases, and for seven (41%) out of 17 enzyme-inhibitor complexes, a near native solution was placed within the first seven ranks.

Binding Sites↗

Efficient methods for filtering and ranking fragments for the prediction of structurally variable regions in proteins.

The prediction of protein 3D structures close to insertions and deletions or, more generally, loop prediction, is still one of the major challenges in homology modeling projects. In this article, we developed ranking criteria and selection filters to improve knowledge-based loop predictions. These criteria were developed and optimized for a test data set containing 678 insertions and deletions. The examples are, in principle, predictable from the used loop database with an RMSD < 1 A and represent realistic modeling situations. Four noncorrelated criteria for the selection of fragments are evaluated. A fast prefilter compares the distance between the anchor groups in the template protein with the stems of the fragments. The RMSD of the anchor groups is used for fitting and ranking of the selected loop candidates. After fitting, repulsive close contacts of loop candidates with the template protein are used for filtering, and fragments with backbone torsion angles, which are unfavorable according to a knowledge-based potential, are eliminated. By the combined application of these filter criteria to the test set, it was possible to increase the percentage of predictions with a global RMSD < 1 A to over 50% among the first five ranks, with average global RMSD values for the first rank candidate that are between 1.3 and 2.2 A for different loop lengths. Compared to other examples described in the literature, our large numbers of test cases are not self-predictions, where loops are placed in a protein after a peptide loop has been cut out, but are attempts to predict structural changes that occur in evolution when a protein is affected by insertions and deletions.

Algorithms↗