T Lengauer | Search PubMed

PubMed1995

Time-efficient docking of flexible ligands into active sites of proteins.

We present an algorithm for placing flexible molecules in active sites of proteins. The two major goals in the development of our docking program, called FLEXX, are the explicit exploitation of molecular flexibility of the ligand and the development of a model of the docking process that includes the physico-chemical properties of the molecules. The algorithm consists of three phases: The selection of a base fragment, the placement of the base fragment in the active site, and the incremental construction of the ligand inside the active site. Except for the selection of the base fragment, the algorithm runs without manual intervention. The algorithm is tested by reproducing 11 receptor-ligand complexes known from X-ray crystallography. In all cases, the algorithm predicts a placement of the ligand which is similar to the crystal structure (about 1.5 A RMS deviation or less) in a few minutes on a workstation, assuming that the receptor is given in the bound conformation.

Algorithms↗

PubMed1995

Recursive dynamic programming for adaptive sequence and structure alignment.

We propose a new alignment procedure that is capable of aligning protein sequences and structures in a unified manner. Recursive dynamic programming (RDP) is a hierarchical method which, on each level of the hierarchy, identifies locally optimal solutions and assembles them into partial alignments of sequences and/or structures. In contrast to classical dynamic programming, RDP can also handle alignment problems that use objective functions not obeying the principle of prefix optimality, e.g. scoring schemes derived from energy potentials of mean force. For such alignment problems, RDP aims at computing solutions that are near-optimal with respect to the involved cost function and biologically meaningful at the same time. Towards this goal, RDP maintains a dynamic balance between different factors governing alignment fitness such as evolutionary relationships and structural preferences. As in the RDP method gaps are not scored explicitly, the problematic assignment of gap cost parameters is circumvented. In order to evaluate the RDP approach we analyse whether known and accepted multiple alignments based on structural information can be reproduced with the RDP method. For this purpose, we consider the family of ferredoxins as our prime example. Our experiments show that, if properly tuned, the RDP method can outperform methods based on classical sequence alignment algorithms as well as methods that take purely structural information into account.

Amino Acid Sequence↗