Search PubMed⌕ Search

Biomedical subjects

C M Stultz

Publications and source records attributed to C M Stultz.

4 recordsLinked to original sources

Dynamic ligand design and combinatorial optimization: designing inhibitors to endothiapepsin.

The dynamic ligand design (DLD) algorithm, an automated method for the creation of novel ligands, links up small functional groups that have been placed in energetically favorable positions in the binding site of a target molecule. The positions and orientations of the small functional groups can be determined using the multi-copy simultaneous search approach (MCSS) or experimental data. In this work the original DLD methodology is extended by using a modified version of the pseudo-potential energy function. A novel simulated annealing protocol is presented for optimizing the pseudo-potential energy of ligands in the binding site; the protocol is expected to be applicable to other optimization problems. The utility of the method is illustrated by designing an inhibitor for endothiapepsin. The binding affinity of the inhibitor is assessed using a thermodynamic cycle that decomposes the binding free energy into a sum of translational, rotational, configurational, hydrophobic, and electrostatic contributions. The calculations suggest that the designed molecule will bind endothiapepsin with high affinity.

Algorithms↗

MCSS functionality maps for a flexible protein.

The Multiple Copy Simultaneous Search (MCSS) methodology for finding energetically favorable positions and orientations of small functional groups in a binding site is extended to include flexibility of the target. This makes possible the finding of novel minima not present in a fixed structure and so extends the diversity of inhibitors that can be constructed starting with the MCSS procedure. Quenched molecular dynamics is used to generate energetically favorable positions and orientations of the functional groups in the field of a flexible protein. The method is applied to the viral protein HIV-1 protease with methanol and methyl ammonium as a test case. If the protein is quenched with many copies of functional groups randomly distributed in the binding site, the resulting minima have ligand-protein interaction energies that are, on average, less favorable than those obtained with standard MCSS. This is a consequence of the renormalized potential function employed in the Locally Enhanced Sampling (LES) approximation. However, local optimizations of existing MCSS minima with a flexible protein results in lower energy minima in regions of the protein that are of particular interest. Their use in constructing a consensus protein model for ligand design is discussed.

Algorithms↗

Protein classification by stochastic modeling and optimal filtering of amino-acid sequences.

The prediction of a protein's tertiary structural class from its amino-acid sequence is formulated as a signal-processing problem. The amino-acid sequence is treated as a "time series" of symbols containing signals that determine the protein's structural class. A methodology is described for building detailed stochastic signal models for recognized structural classes of single-domain proteins. We solve the problem of determining that model, from a set of candidates, which is the most probable generator of a protein's entire amino-acid sequence. The solution employs a nonlinear, optimal filtering algorithm, which is suited for implementation on parallel computer architectures. Previous approaches have only been able to classify correctly 80% of single-domain proteins within three very broad structural types, while our approach achieves this level across twelve much more detailed classes.

Amino Acid Sequence↗

Structural analysis based on state-space modeling.

A new method has been developed to compute the probability that each amino acid in a protein sequence is in a particular secondary structural element. Each of these probabilities is computed using the entire sequence and a set of predefined structural class models. This set of structural classes is patterned after Jane Richardson's taxonomy for the domains of globular proteins. For each structural class considered, a mathematical model is constructed to represent constraints on the pattern of secondary structural elements characteristic of that class. These are stochastic models having discrete state spaces (referred to as hidden Markov models by researchers in signal processing and automatic speech recognition). Each model is a mathematical generator of amino acid sequences; the sequence under consideration is modeled as having been generated by one model in the set of candidates. The probability that each model generated the given sequence is computed using a filtering algorithm. The protein is then classified as belonging to the structural class having the most probable model. The secondary structure of the sequence is then analyzed using a "smoothing" algorithm that is optimal for that structural class model. For each residue position in the sequence, the smoother computes the probability that the residue is contained within each of the defined secondary structural elements of the model. This method has two important advantages: (1) the probability of each residue being in each of the modeled secondary structural elements is computed using the totality of the amino acid sequence, and (2) these probabilities are consistent with prior knowledge of realizable domain folds as encoded in each model. As an example of the method's utility, we present its application to flavodoxin, a prototypical alpha/beta protein having a central beta-sheet, and to thioredoxin, which belongs to a similar structural class but shares no significant sequence similarity.

Flavodoxin↗