D-peptides, the mirror image of canonical L-peptides, offer numerous biological advantages that make them effective therapeutics. This article details how to use DexDesign, the newest OSPREY-based algorithm, for designing these D-peptides . OSPREY physics-based models precisely mimic energy-equivariant reflection operations, enabling the generation of D-peptide scaffolds from L-peptide templates.
View Article and Find Full Text PDFProtein Eng Des Sel
January 2024
With over 270 unique occurrences in the human genome, peptide-recognizing PDZ domains play a central role in modulating polarization, signaling, and trafficking pathways. Mutations in PDZ domains lead to diseases such as cancer and cystic fibrosis, making PDZ domains attractive targets for therapeutic intervention. D-peptide inhibitors offer unique advantages as therapeutics, including increased metabolic stability and low immunogenicity.
View Article and Find Full Text PDFWith over 270 unique occurrences in the human genome, peptide-recognizing PDZ domains play a central role in modulating polarization, signaling, and trafficking pathways. Mutations in PDZ domains lead to diseases such as cancer and cystic fibrosis, making PDZ domains attractive targets for therapeutic intervention. D-peptide inhibitors offer unique advantages as therapeutics, including increased metabolic stability and low immunogenicity.
View Article and Find Full Text PDFWe report an Osprey-based computational protocol to prospectively identify oncogenic mutations that act via disruption of molecular interactions. It is applicable to analyse both protein-protein and protein-DNA interfaces and it is validated on a dataset of clinically relevant mutations. In addition, it is used to predict previously uncharacterised patient mutations in CDK6 and p16 genes, which are experimentally confirmed to impair complex formation.
View Article and Find Full Text PDFBroadly neutralizing antibodies (bNAbs) against HIV can reduce viral transmission in humans, but an effective therapeutic will require unusually high breadth and potency of neutralization. We employ the OSPREY computational protein design software to engineer variants of two apex-directed bNAbs, PGT145 and PG9RSH, resulting in increases in potency of over 100-fold against some viruses. The top designed variants improve neutralization breadth from 39% to 54% at clinically relevant concentrations (IC < 1 μg/mL) and improve median potency (IC) by up to 4-fold over a cross-clade panel of 208 strains.
View Article and Find Full Text PDFthanatin has been reported as a potent antimicrobial peptide with antibacterial and antifungal activity. Its antibiotic activity has been most thoroughly characterized against and shown to interfere with multiple pathways, such as the lipopolysaccharide transport (LPT) pathway comprised of seven different Lpt proteins. Thanatin binds to LptA and LptD, thus disrupting the LPT complex formation and inhibiting cell wall synthesis and microbial growth.
View Article and Find Full Text PDFProspective predictions of drug-resistant protein mutants could improve the design of therapeutics less prone to resistance. Here, we describe RESISTOR, an algorithm that uses structure- and sequence-based criteria to predict resistance mutations. We demonstrate the process of using RESISTOR to predict ERK2 mutants likely to arise in melanoma ablating the efficacy of the ERK1/2 inhibitor SCH779284.
View Article and Find Full Text PDFResistance to pharmacological treatments is a major public health challenge. Here, we introduce Resistor-a structure- and sequence-based algorithm that prospectively predicts resistance mutations for drug design. Resistor computes the Pareto frontier of four resistance-causing criteria: the change in binding affinity (ΔK) of the (1) drug and (2) endogenous ligand upon a protein's mutation; (3) the probability a mutation will occur based on empirically derived mutational signatures; and (4) the cardinality of mutations comprising a hotspot.
View Article and Find Full Text PDFComputational, in silico prediction of resistance-conferring escape mutations could accelerate the design of therapeutics less prone to resistance. This article describes how to use the Resistor algorithm to predict escape mutations. Resistor employs Pareto optimization on four resistance-conferring criteria-positive and negative design, mutational probability, and hotspot cardinality-to assign a Pareto rank to each prospective mutant.
View Article and Find Full Text PDFAntimicrobial resistance presents a significant health care crisis. The mutation F98Y in Staphylococcus aureus dihydrofolate reductase (SaDHFR) confers resistance to the clinically important antifolate trimethoprim (TMP). Propargyl-linked antifolates (PLAs), next generation DHFR inhibitors, are much more resilient than TMP against this F98Y variant, yet this F98Y substitution still reduces efficacy of these agents.
View Article and Find Full Text PDFThe K* algorithm provably approximates partition functions for a set of states (e.g., protein, ligand, and protein-ligand complex) to a user-specified accuracy ε.
View Article and Find Full Text PDFProtein design algorithms that model continuous sidechain flexibility and conformational ensembles better approximate the and behavior of proteins. The previous state of the art, iMinDEE-*-*, computes provable -approximations to partition functions of protein states (e.g.
View Article and Find Full Text PDFThe CFTR-associated ligand PDZ domain (CALP) binds to the cystic fibrosis transmembrane conductance regulator (CFTR) and mediates lysosomal degradation of mature CFTR. Inhibition of this interaction has been explored as a therapeutic avenue for cystic fibrosis. Previously, we reported the ensemble-based computational design of a novel peptide inhibitor of CALP, which resulted in the most binding-efficient inhibitor to date.
View Article and Find Full Text PDFThe spread of plasmid borne resistance enzymes in clinical isolates is rendering trimethoprim and iclaprim, both inhibitors of dihydrofolate reductase (DHFR), ineffective. Continued exploitation of these targets will require compounds that can broadly inhibit these resistance-conferring isoforms. Using a structure-based approach, we have developed a novel class of ionized nonclassical antifolates (INCAs) that capture the molecular interactions that have been exclusive to classical antifolates.
View Article and Find Full Text PDFWe present osprey 3.0, a new and greatly improved release of the osprey protein design software. Osprey 3.
View Article and Find Full Text PDFThe flexibility of biological macromolecules is an important structural determinant of function. Unfortunately, the correlations between different motional modes are poorly captured by discrete ensemble representations. Here, we present new ways to both represent and visualize correlated interdomain motions.
View Article and Find Full Text PDFComputational protein design (CPD) algorithms that compute binding affinity, K, search for sequences with an energetically favorable free energy of binding. Recent work shows that three principles improve the biological accuracy of CPD: ensemble-based design, continuous flexibility of backbone and side-chain conformations, and provable guarantees of accuracy with respect to the input. However, previous methods that use all three design principles are single-sequence (SS) algorithms, which are very costly: linear in the number of sequences and thus exponential in the number of simultaneously mutable residues.
View Article and Find Full Text PDFMotivation: When proteins mutate or bind to ligands, their backbones often move significantly, especially in loop regions. Computational protein design algorithms must model these motions in order to accurately optimize protein stability and binding affinity. However, methods for backbone conformational search in design have been much more limited than for sidechain conformational search.
View Article and Find Full Text PDFProtein design algorithms enumerate a combinatorial number of candidate structures to compute the Global Minimum Energy Conformation (GMEC). To efficiently find the GMEC, protein design algorithms must methodically reduce the conformational search space. By applying distance and energy cutoffs, the protein system to be designed can thus be represented using a sparse residue interaction graph, where the number of interacting residue pairs is less than all pairs of mutable residues, and the corresponding GMEC is called the sparse GMEC.
View Article and Find Full Text PDFDrug resistance in protein targets is an increasingly common phenomenon that reduces the efficacy of both existing and new antibiotics. However, knowledge of future resistance mutations during pre-clinical phases of drug development would enable the design of novel antibiotics that are robust against not only known resistant mutants, but also against those that have not yet been clinically observed. Computational structure-based protein design (CSPD) is a transformative field that enables the prediction of protein sequences with desired biochemical properties such as binding affinity and specificity to a target.
View Article and Find Full Text PDFComputational structure-based protein design (CSPD) is an important problem in computational biology, which aims to design or improve a prescribed protein function based on a protein structure template. It provides a practical tool for real-world protein engineering applications. A popular CSPD method that guarantees to find the global minimum energy solution (GMEC) is to combine both dead-end elimination (DEE) and A* tree search algorithms.
View Article and Find Full Text PDFMost protein design algorithms search over discrete conformations and an energy function that is residue-pairwise, that is, a sum of terms that depend on the sequence and conformation of at most two residues. Although modeling of continuous flexibility and of non-residue-pairwise energies significantly increases the accuracy of protein design, previous methods to model these phenomena add a significant asymptotic cost to design calculations. We now remove this cost by modeling continuous flexibility and non-residue-pairwise energies in a form suitable for direct input to highly efficient, discrete combinatorial optimization algorithms such as DEE/A* or branch-width minimization.
View Article and Find Full Text PDFFinding the global minimum energy conformation (GMEC) of a huge combinatorial search space is the key challenge in computational protein design (CPD) problems. Traditional algorithms lack a scalable and efficient distributed design scheme, preventing researchers from taking full advantage of current cloud infrastructures. We design cloud OSPREY (cOSPREY), an extension to a widely used protein design software OSPREY, to allow the original design framework to scale to the commercial cloud infrastructures.
View Article and Find Full Text PDF© LitMetric 2025. All rights reserved.