A divide-and-conquer approach to determine the Pareto frontier for optimization of protein engineering experiments

Problem of Domain/Building Block Preservation in the Evolution of Biological Macromolecules and Evolutionary Computation

Structurally and functionally isolated domains in biological macromolecular evolution, both natural and artificial, are largely similar to "schemata", building blocks (BBs), in evolutionary computation (EC). The problem of preserving in subsequent evolutionary searches the already found domains / BBs is well known and quite relevant in biology as well as in EC. Both biology and EC are seeing parallel and independent development of several approaches to identifying and preserving previously identified domains / BBs. First, we notice the similarity of DNA shuffling methods in synthetic biology and multi-parent recombination algorithms in EC. Furthermore, approaches to computer identification of domains in proteins that are being developed in biology can be aligned with BB identification methods in EC. Finally, approaches to chimeric protein libraries optimization in biology can be compared to evolutionary search methods based on probabilistic models in EC. We propose to validate the prospects of mutual exchange of ideas and transfer of algorithms and approaches between evolutionary systems biology and EC in these three principal directions. A crucial aim of this transfer is the design of new advanced experimental techniques capable of solving more complex problems of in vitro evolution.

Resistor: An algorithm for predicting resistance mutations via Pareto optimization over multistate protein design and mutational signatures

Resistance 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 (ΔKa) 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. For validation, we applied Resistor to EGFR and BRAF kinase inhibitors treating lung adenocarcinoma and melanoma. Resistor correctly identified eight clinically significant EGFR resistance mutations, including the erlotinib and gefitinib "gatekeeper" T790M mutation and five known osimertinib resistance mutations. Furthermore, Resistor predictions are consistent with BRAF inhibitor sensitivity data from both retrospective and prospective experiments using KinCon biosensors. Resistor is available in the open-source protein design software OSPREY.

Deimmunization of protein therapeutics - Recent advances in experimental and computational epitope prediction and deletion

Biotherapeutics, and antimicrobial proteins in particular, are of increasing interest for human medicine. An important challenge in the development of such therapeutics is their potential immunogenicity, which can induce production of anti-drug-antibodies, resulting in altered pharmacokinetics, reduced efficacy, and potentially severe anaphylactic or hypersensitivity reactions. For this reason, the development and application of effective deimmunization methods for protein drugs is of utmost importance. Deimmunization may be achieved by unspecific shielding approaches, which include PEGylation, fusion to polypeptides (e.g., XTEN or PAS), reductive methylation, glycosylation, and polysialylation. Alternatively, the identification of epitopes for T cells or B cells and their subsequent deletion through site-directed mutagenesis represent promising deimmunization strategies and can be accomplished through either experimental or computational approaches. This review highlights the most recent advances and current challenges in the deimmunization of protein therapeutics, with a special focus on computational epitope prediction and deletion tools.

DisruPPI: structure-based computational redesign algorithm for protein binding disruption

Motivation

Disruption of protein–protein interactions can mitigate antibody recognition of therapeutic proteins, yield monomeric forms of oligomeric proteins, and elucidate signaling mechanisms, among other applications. While designing affinity-enhancing mutations remains generally quite challenging, both statistically and physically based computational methods can precisely identify affinity-reducing mutations. In order to leverage this ability to design variants of a target protein with disrupted interactions, we developed the DisruPPI protein design method (DISRUpting Protein–Protein Interactions) to optimize combinations of mutations simultaneously for both disruption and stability, so that incorporated disruptive mutations do not inadvertently affect the target protein adversely.

Results

Two existing methods for predicting mutational effects on binding, FoldX and INT5, were demonstrated to be quite precise in selecting disruptive mutations from the SKEMPI and AB-Bind databases of experimentally determined changes in binding free energy. DisruPPI was implemented to use an INT5-based disruption score integrated with an AMBER-based stability assessment and was applied to disrupt protein interactions in a set of different targets representing diverse applications. In retrospective evaluation with three different case studies, comparison of DisruPPI-designed variants to published experimental data showed that DisruPPI was able to identify more diverse interaction-disrupting and stability-preserving variants more efficiently and effectively than previous approaches. In prospective application to an interaction between enhanced green fluorescent protein (EGFP) and a nanobody, DisruPPI was used to design five EGFP variants, all of which were shown to have significantly reduced nanobody binding while maintaining function and thermostability. This demonstrates that DisruPPI may be readily utilized for effective removal of known epitopes of therapeutically relevant proteins.

Availability and implementation

DisruPPI is implemented in the EpiSweep package, freely available under an academic use license.

Supplementary information

Supplementary data are available at Bioinformatics online.

Pareto Optimization of Combinatorial Mutagenesis Libraries

In order to increase the hit rate of discovering diverse, beneficial protein variants via high-throughput screening, we have developed a computational method to optimize combinatorial mutagenesis libraries for overall enrichment in two distinct properties of interest. Given scoring functions for evaluating individual variants, POCoM (Pareto Optimal Combinatorial Mutagenesis) scores entire libraries in terms of averages over their constituent members, and designs optimal libraries as sets of mutations whose combinations make the best trade-offs between average scores. This represents the first general-purpose method to directly design combinatorial libraries for multiple objectives characterizing their constituent members. Despite being rigorous in mapping out the Pareto frontier, it is also very fast even for very large libraries (e.g., designing 30 mutation, billion-member libraries in only hours). We here instantiate POCoM with scores based on a target's protein structure and its homologs' sequences, enabling the design of libraries containing variants balancing these two important yet quite different types of information. We demonstrate POCoM's generality and power in case study applications to green fluorescent protein, cytochrome P450, and β-lactamase. Analysis of the POCoM library designs provides insights into the trade-offs between structure- and sequence-based scores, as well as the impacts of experimental constraints on library designs. POCoM libraries incorporate mutations that have previously been found favorable experimentally, while diversifying the contexts in which these mutations are situated and maintaining overall variant quality.

A robotic multidimensional directed evolution approach applied to fluorescent voltage reporters

We developed a new way to engineer complex proteins toward multidimensional specifications using a simple, yet scalable, directed evolution strategy. By robotically picking mammalian cells that were identified, under a microscope, as expressing proteins that simultaneously exhibit several specific properties, we can screen hundreds of thousands of proteins in a library in just a few hours, evaluating each along multiple performance axes. To demonstrate the power of this approach, we created a genetically encoded fluorescent voltage indicator, simultaneously optimizing its brightness and membrane localization using our microscopy-guided cell-picking strategy. We produced the high-performance opsin-based fluorescent voltage reporter Archon1 and demonstrated its utility by imaging spiking and millivolt-scale subthreshold and synaptic activity in acute mouse brain slices and in larval zebrafish in vivo. We also measured postsynaptic responses downstream of optogenetically controlled neurons in C. elegans.

Computationally-driven identification of antibody epitopes

Understanding where antibodies recognize antigens can help define mechanisms of action and provide insights into progression of immune responses. We investigate the extent to which information about binding specificity implicitly encoded in amino acid sequence can be leveraged to identify antibody epitopes. In computationally-driven epitope localization, possible antibody–antigen binding modes are modeled, and targeted panels of antigen variants are designed to experimentally test these hypotheses. Prospective application of this approach to two antibodies enabled epitope localization using five or fewer variants per antibody, or alternatively, a six-variant panel for both simultaneously. Retrospective analysis of a variety of antibodies and antigens demonstrated an almost 90% success rate with an average of three antigen variants, further supporting the observation that the combination of computational modeling and protein design can reveal key determinants of antibody–antigen binding and enable efficient studies of collections of antibodies identified from polyclonal samples or engineered libraries.

Searching for the Pareto frontier in multi-objective protein design

The goal of protein engineering and design is to identify sequences that adopt three-dimensional structures of desired function. Often, this is treated as a single-objective optimization problem, identifying the sequence-structure solution with the lowest computed free energy of folding. However, many design problems are multi-state, multi-specificity, or otherwise require concurrent optimization of multiple objectives. There may be tradeoffs among objectives, where improving one feature requires compromising another. The challenge lies in determining solutions that are part of the Pareto optimal set-designs where no further improvement can be achieved in any of the objectives without degrading one of the others. Pareto optimality problems are found in all areas of study, from economics to engineering to biology, and computational methods have been developed specifically to identify the Pareto frontier. We review progress in multi-objective protein design, the development of Pareto optimization methods, and present a specific case study using multi-objective optimization methods to model the tradeoff between three parameters, stability, specificity, and complexity, of a set of interacting synthetic collagen peptides.

Computationally optimized deimmunization libraries yield highly mutated enzymes with low immunogenicity and enhanced activity

Therapeutic proteins of wide-ranging function hold great promise for treating disease, but immune surveillance of these macromolecules can drive an antidrug immune response that compromises efficacy and even undermines safety. To eliminate widespread T-cell epitopes in any biotherapeutic and thereby mitigate this key source of detrimental immune recognition, we developed a Pareto optimal deimmunization library design algorithm that optimizes protein libraries to account for the simultaneous effects of combinations of mutations on both molecular function and epitope content. Active variants identified by high-throughput screening are thus inherently likely to be deimmunized. Functional screening of an optimized 10-site library (1,536 variants) of P99 β-lactamase (P99βL), a component of ADEPT cancer therapies, revealed that the population possessed high overall fitness, and comprehensive analysis of peptide-MHC II immunoreactivity showed the population possessed lower average immunogenic potential than the wild-type enzyme. Although similar functional screening of an optimized 30-site library (2.15 × 10⁹ variants) revealed reduced population-wide fitness, numerous individual variants were found to have activity and stability better than the wild type despite bearing 13 or more deimmunizing mutations per enzyme. The immunogenic potential of one highly active and stable 14-mutation variant was assessed further using ex vivo cellular immunoassays, and the variant was found to silence T-cell activation in seven of the eight blood donors who responded strongly to wild-type P99βL. In summary, our multiobjective library-design process readily identified large and mutually compatible sets of epitope-deleting mutations and produced highly active but aggressively deimmunized constructs in only one round of library screening.

EpiSweep: Computationally Driven Reengineering of Therapeutic Proteins to Reduce Immunogenicity While Maintaining Function

Therapeutic proteins are yielding ever more advanced and efficacious new drugs, but the biological origins of these highly effective therapeutics render them subject to immune surveillance within the patient's body. When recognized by the immune system as a foreign agent, protein drugs elicit a coordinated response that can manifest a range of clinical complications including rapid drug clearance, loss of functionality and efficacy, delayed infusion-like allergic reactions, more serious anaphylactic shock, and even induced auto-immunity. It is thus often necessary to deimmunize an exogenous protein in order to enable its clinical application; critically, the deimmunization process must also maintain the desired therapeutic activity.To meet the growing need for effective, efficient, and broadly applicable protein deimmunization technologies, we have developed the EpiSweep suite of protein design algorithms. EpiSweep seamlessly integrates computational prediction of immunogenic T cell epitopes with sequence- or structure-based assessment of the impacts of mutations on protein stability and function, in order to select combinations of mutations that make Pareto optimal trade-offs between the competing goals of low immunogenicity and high-level function. The methods are applicable both to the design of individual functionally deimmunized variants as well as the design of combinatorial libraries enriched in functionally deimmunized variants. After validating EpiSweep in a series of retrospective case studies providing comparisons to conventional approaches to T cell epitope deletion, we have experimentally demonstrated it to be highly effective in prospective application to deimmunization of a number of different therapeutic candidates. We conclude that our broadly applicable computational protein design algorithms guide the engineer towards the most promising deimmunized therapeutic candidates, and thereby have the potential to accelerate development of new protein drugs by shortening time frames and improving hit rates.

Computationally driven antibody engineering enables simultaneous humanization and thermostabilization

Humanization reduces the immunogenicity risk of therapeutic antibodies of non-human origin. Thermostabilization can be critical for clinical development and application of therapeutic antibodies. Here, we show that the computational antibody redesign method Computationally Driven Antibody Humanization (CoDAH) enables these two goals to be accomplished simultaneously and seamlessly. A panel of CoDAH designs for the murine parent of cetuximab, a chimeric anti-EGFR antibody, exhibited both substantially improved thermostabilities and substantially higher levels of humanness, while retaining binding activity near the parental level. The consistently high quality of the turnkey CoDAH designs, over a whole panel of variants, suggests that the computationally directed approach encapsulates key determinants of antibody structure and function.

Design and engineering of deimmunized biotherapeutics

Therapeutic proteins are powerful next-generation drugs able to effectively treat diverse and devastating diseases, but the development and use of biotherapeutics entails unique challenges and risks. In particular, protein drugs are subject to immune surveillance in the human body, and ensuing antidrug immune responses can cause a wide range of problems including altered pharmacokinetics, loss of efficacy, and even life-threating complications. Here we review recent progress in technologies for engineering deimmunized biotherapeutics, placing particular emphasis on deletion of immunogenic antibody and T cell epitopes via experimentally or computationally guided mutagenesis.

Depletion of T cell epitopes in lysostaphin mitigates anti-drug antibody response and enhances antibacterial efficacy in vivo

The enzyme lysostaphin possesses potent anti-staphylococcal activity and represents a promising antibacterial drug candidate; however, its immunogenicity poses a barrier to clinical translation. Here, structure-based biomolecular design enabled widespread depletion of lysostaphin DRB1(∗)0401 restricted T cell epitopes, and resulting deimmunized variants exhibited striking reductions in anti-drug antibody responses upon administration to humanized HLA-transgenic mice. This reduced immunogenicity translated into improved efficacy in the form of protection against repeated challenges with methicillin-resistant Staphylococcus aureus (MRSA). In contrast, while wild-type lysostaphin was efficacious against the initial MRSA infection, it failed to clear subsequent bacterial challenges that were coincident with escalating anti-drug antibody titers. These results extend the existing deimmunization literature, in which reduced immunogenicity and retained efficacy are assessed independently of each other. By correlating in vivo efficacy with longitudinal measures of anti-drug antibody development, we provide the first direct evidence that T cell epitope depletion manifests enhanced biotherapeutic efficacy.

Design of Specific Peptide-Protein Recognition

Selective targeting of protein-protein interactions in the cell is of great interest in biological research. Computational structure-based design of peptides to bind protein interaction interfaces could provide a potential means of generating such reagents. However, to avoid perturbing off-target interactions, methods that explicitly account for interaction specificity are needed. Further, as peptides often retain considerable flexibility upon association, their binding reaction is computationally demanding to model-a stark limitation for structure-based design. Here we present a protocol for designing peptides that selectively target a given peptide-binding domain, relative to a pre-specified set of possibly related domains. We recently used the method to design peptides that discriminate with high selectivity between two closely related PDZ domains. The framework accounts for the flexibility of the peptide in the binding site, but is efficient enough to quickly analyze trade-offs between affinity and selectivity, enabling the identification of optimal peptides.

Antibody humanization by structure-based computational protein design

Antibodies derived from non-human sources must be modified for therapeutic use so as to mitigate undesirable immune responses. While complementarity-determining region (CDR) grafting-based humanization techniques have been successfully applied in many cases, it remains challenging to maintain the desired stability and antigen binding affinity upon grafting. We developed an alternative humanization approach called CoDAH ("Computationally-Driven Antibody Humanization") in which computational protein design methods directly select sets of amino acids to incorporate from human germline sequences to increase humanness while maintaining structural stability. Retrospective studies show that CoDAH is able to identify variants deemed beneficial according to both humanness and structural stability criteria, even for targets lacking crystal structures. Prospective application to TZ47, a murine anti-human B7H6 antibody, demonstrates the approach. Four diverse humanized variants were designed, and all possible unique VH/VL combinations were produced as full-length IgG1 antibodies. Soluble and cell surface expressed antigen binding assays showed that 75% (6 of 8) of the computationally designed VH/VL variants were successfully expressed and competed with the murine TZ47 for binding to B7H6 antigen. Furthermore, 4 of the 6 bound with an estimated KD within an order of magnitude of the original TZ47 antibody. In contrast, a traditional CDR-grafted variant could not be expressed. These results suggest that the computational protein design approach described here can be used to efficiently generate functional humanized antibodies and provide humanized templates for further affinity maturation.

Protein deimmunization via structure-based design enables efficient epitope deletion at high mutational loads

Anti-drug immune responses are a unique risk factor for biotherapeutics, and undesired immunogenicity can alter pharmacokinetics, compromise drug efficacy, and in some cases even threaten patient safety. To fully capitalize on the promise of biotherapeutics, more efficient and generally applicable protein deimmunization tools are needed. Mutagenic deletion of a protein's T cell epitopes is one powerful strategy to engineer immunotolerance, but deimmunizing mutations must maintain protein structure and function. Here, EpiSweep, a structure-based protein design and deimmunization algorithm, has been used to produce a panel of seven beta-lactamase drug candidates having 27-47% reductions in predicted epitope content. Despite bearing eight mutations each, all seven engineered enzymes maintained good stability and activity. At the same time, the variants exhibited dramatically reduced interaction with human class II major histocompatibility complex proteins, key regulators of anti-drug immune responses. When compared to 8-mutation designs generated with a sequence-based deimmunization algorithm, the structure-based designs retained greater thermostability and possessed fewer high affinity epitopes, the dominant drivers of anti-biotherapeutic immune responses. These experimental results validate the first structure-based deimmunization algorithm capable of mapping optimal biotherapeutic design space. By designing optimal mutations that reduce immunogenic potential while imparting favorable intramolecular interactions, broadly distributed epitopes may be simultaneously targeted using high mutational loads.

Structure-based redesign of lysostaphin yields potent antistaphylococcal enzymes that evade immune cell surveillance

Staphylococcus aureus infections exert a tremendous burden on the health-care system, and the threat of drug-resistant strains continues to grow. The bacteriolytic enzyme lysostaphin is a potent antistaphylococcal agent with proven efficacy against both drug-sensitive and drug-resistant strains; however, the enzyme's own bacterial origins cause undesirable immunogenicity and pose a barrier to clinical translation. Here, we deimmunized lysostaphin using a computationally guided process that optimizes sets of mutations to delete immunogenic T cell epitopes without disrupting protein function. In vitro analyses showed the methods to be both efficient and effective, producing seven different deimmunized designs exhibiting high function and reduced immunogenic potential. Two deimmunized candidates elicited greatly suppressed proliferative responses in splenocytes from humanized mice, while at the same time the variants maintained wild-type efficacy in a staphylococcal pneumonia model. Overall, the deimmunized enzymes represent promising leads in the battle against S. aureus.

Synthetic biology for the directed evolution of protein biocatalysts: navigating sequence space intelligently

The amino acid sequence of a protein affects both its structure and its function. Thus, the ability to modify the sequence, and hence the structure and activity, of individual proteins in a systematic way, opens up many opportunities, both scientifically and (as we focus on here) for exploitation in biocatalysis. Modern methods of synthetic biology, whereby increasingly large sequences of DNA can be synthesised de novo, allow an unprecedented ability to engineer proteins with novel functions. However, the number of possible proteins is far too large to test individually, so we need means for navigating the 'search space' of possible protein sequences efficiently and reliably in order to find desirable activities and other properties. Enzymologists distinguish binding (Kd) and catalytic (kcat) steps. In a similar way, judicious strategies have blended design (for binding, specificity and active site modelling) with the more empirical methods of classical directed evolution (DE) for improving kcat (where natural evolution rarely seeks the highest values), especially with regard to residues distant from the active site and where the functional linkages underpinning enzyme dynamics are both unknown and hard to predict. Epistasis (where the 'best' amino acid at one site depends on that or those at others) is a notable feature of directed evolution. The aim of this review is to highlight some of the approaches that are being developed to allow us to use directed evolution to improve enzyme properties, often dramatically. We note that directed evolution differs in a number of ways from natural evolution, including in particular the available mechanisms and the likely selection pressures. Thus, we stress the opportunities afforded by techniques that enable one to map sequence to (structure and) activity in silico, as an effective means of modelling and exploring protein landscapes. Because known landscapes may be assessed and reasoned about as a whole, simultaneously, this offers opportunities for protein improvement not readily available to natural evolution on rapid timescales. Intelligent landscape navigation, informed by sequence-activity relationships and coupled to the emerging methods of synthetic biology, offers scope for the development of novel biocatalysts that are both highly active and robust.

Structure-based design of combinatorial mutagenesis libraries

The development of protein variants with improved properties (thermostability, binding affinity, catalytic activity, etc.) has greatly benefited from the application of high-throughput screens evaluating large, diverse combinatorial libraries. At the same time, since only a very limited portion of sequence space can be experimentally constructed and tested, an attractive possibility is to use computational protein design to focus libraries on a productive portion of the space. We present a general-purpose method, called "Structure-based Optimization of Combinatorial Mutagenesis" (SOCoM), which can optimize arbitrarily large combinatorial mutagenesis libraries directly based on structural energies of their constituents. SOCoM chooses both positions and substitutions, employing a combinatorial optimization framework based on library-averaged energy potentials in order to avoid explicitly modeling every variant in every possible library. In case study applications to green fluorescent protein, β-lactamase, and lipase A, SOCoM optimizes relatively small, focused libraries whose variants achieve energies comparable to or better than previous library design efforts, as well as larger libraries (previously not designable by structure-based methods) whose variants cover greater diversity while still maintaining substantially better energies than would be achieved by representative random library approaches. By allowing the creation of large-scale combinatorial libraries based on structural calculations, SOCoM promises to increase the scope of applicability of computational protein design and improve the hit rate of discovering beneficial variants. While designs presented here focus on variant stability (predicted by total energy), SOCoM can readily incorporate other structure-based assessments, such as the energy gap between alternative conformational or bound states.

Mapping the Pareto optimal design space for a functionally deimmunized biotherapeutic candidate

The immunogenicity of biotherapeutics can bottleneck development pipelines and poses a barrier to widespread clinical application. As a result, there is a growing need for improved deimmunization technologies. We have recently described algorithms that simultaneously optimize proteins for both reduced T cell epitope content and high-level function. In silico analysis of this dual objective design space reveals that there is no single global optimum with respect to protein deimmunization. Instead, mutagenic epitope deletion yields a spectrum of designs that exhibit tradeoffs between immunogenic potential and molecular function. The leading edge of this design space is the Pareto frontier, i.e. the undominated variants for which no other single design exhibits better performance in both criteria. Here, the Pareto frontier of a therapeutic enzyme has been designed, constructed, and evaluated experimentally. Various measures of protein performance were found to map a functional sequence space that correlated well with computational predictions. These results represent the first systematic and rigorous assessment of the functional penalty that must be paid for pursuing progressively more deimmunized biotherapeutic candidates. Given this capacity to rapidly assess and design for tradeoffs between protein immunogenicity and functionality, these algorithms may prove useful in augmenting, accelerating, and de-risking experimental deimmunization efforts.

Protein therapeutics have created a revolution in disease therapy, providing improved outcomes for prevalent illnesses and conditions while at the same time yielding treatments for diseases that were previously intractable. However, this powerful class of drugs is subject to their own unique challenges and risk factors. In particular, the biological origins of therapeutic proteins predispose them towards eliciting a detrimental immune response from the patient's own body. Therefore, fully capitalizing on the medicinal reservoir of natural and engineered proteins will require efficient, effective, and broadly applicable deimmunization technologies. We have developed deimmunization algorithms that simultaneously optimize therapeutic candidates for both low immunogenicity and high-level activity and stability. Here, we combine computational modeling and experimental analysis to show that the process of protein deimmunization manifests inherent tradeoffs between immunogenic potential and biomolecular function. Our experimental results demonstrate that dual objective optimization allows us to assess and design for these tradeoffs, thereby enabling facile construction of deimmunized variants that span a broad range of immunogenicity and functionality performance parameters. Thus, we can rapidly map the design space for deimmunized drug candidates, and we can use this information to guide selection of engineered proteins that are most likely to meet performance benchmarks for a given clinical application.

Structure-guided deimmunization of therapeutic proteins

Therapeutic proteins continue to yield revolutionary new treatments for a growing spectrum of human disease, but the development of these powerful drugs requires solving a unique set of challenges. For instance, it is increasingly apparent that mitigating potential anti-therapeutic immune responses, driven by molecular recognition of a therapeutic protein's peptide fragments, may be best accomplished early in the drug development process. One may eliminate immunogenic peptide fragments by mutating the cognate amino acid sequences, but deimmunizing mutations are constrained by the need for a folded, stable, and functional protein structure. These two concerns may be competing, as the mutations that are best at reducing immunogenicity often involve amino acids that are substantially different physicochemically. We develop a novel approach, called EpiSweep, that simultaneously optimizes both concerns. Our algorithm identifies sets of mutations making such Pareto optimal trade-offs between structure and immunogenicity, embodied by a molecular mechanics energy function and a T-cell epitope predictor, respectively. EpiSweep integrates structure-based protein design, sequence-based protein deimmunization, and algorithms for finding the Pareto frontier of a design space. While structure-based protein design is NP-hard, we employ integer programming techniques that are efficient in practice. Furthermore, EpiSweep only invokes the optimizer once per identified Pareto optimal design. We show that EpiSweep designs of regions of the therapeutics erythropoietin and staphylokinase are predicted to outperform previous experimental efforts. We also demonstrate EpiSweep's capacity for deimmunization of the entire proteins, case analyses involving dozens of predicted epitopes, and tens of thousands of unique side-chain interactions. Ultimately, Epi-Sweep is a powerful protein design tool that guides the protein engineer toward the most promising immunotolerant biotherapeutic candidates.

Structure-based redesign of proteins for minimal T-cell epitope content

The protein universe displays a wealth of therapeutically relevant activities, but T-cell driven immune responses to non-"self" biological agents present a major impediment to harnessing the full diversity of these molecular functions. Mutagenic T-cell epitope deletion seeks to mitigate the immune response, but can typically address only a small number of epitopes. Here, we pursue a "bottom-up" approach that redesigns an entire protein to remain native-like but contain few if any immunogenic epitopes. We do so by extending the Rosetta flexible-backbone protein design software with an epitope scoring mechanism and appropriate constraints. The method is benchmarked with a diverse panel of proteins and applied to three targets of therapeutic interest. We show that the deimmunized designs indeed have minimal predicted epitope content and are native-like in terms of various quality measures, and moreover that they display levels of native sequence recovery comparable to those of non-deimmunized designs.

Probing the mutational interplay between primary and promiscuous protein functions: a computational-experimental approach

Protein promiscuity is of considerable interest due its role in adaptive metabolic plasticity, its fundamental connection with molecular evolution and also because of its biotechnological applications. Current views on the relation between primary and promiscuous protein activities stem largely from laboratory evolution experiments aimed at increasing promiscuous activity levels. Here, on the other hand, we attempt to assess the main features of the simultaneous modulation of the primary and promiscuous functions during the course of natural evolution. The computational/experimental approach we propose for this task involves the following steps: a function-targeted, statistical coupling analysis of evolutionary data is used to determine a set of positions likely linked to the recruitment of a promiscuous activity for a new function; a combinatorial library of mutations on this set of positions is prepared and screened for both, the primary and the promiscuous activities; a partial-least-squares reconstruction of the full combinatorial space is carried out; finally, an approximation to the Pareto set of variants with optimal primary/promiscuous activities is derived. Application of the approach to the emergence of folding catalysis in thioredoxin scaffolds reveals an unanticipated scenario: diverse patterns of primary/promiscuous activity modulation are possible, including a moderate (but likely significant in a biological context) simultaneous enhancement of both activities. We show that this scenario can be most simply explained on the basis of the conformational diversity hypothesis, although alternative interpretations cannot be ruled out. Overall, the results reported may help clarify the mechanisms of the evolution of new functions. From a different viewpoint, the partial-least-squares-reconstruction/Pareto-set-prediction approach we have introduced provides the computational basis for an efficient directed-evolution protocol aimed at the simultaneous enhancement of several protein features and should therefore open new possibilities in the engineering of multi-functional enzymes.

Interpretations of evolutionary processes at the molecular level have been determined to a significant extent by the concept of “trade-off”, the idea that improving a given feature of a protein molecule by mutation will likely bring about deterioration in other features. For instance, if a protein is able to carry out two different molecular tasks based on the same functional site (competing tasks), optimization for one task could be naively expected to impair its performance for the other task. In this work, we report a computational/experimental approach to assess the potential patterns of modulation of two competing molecular tasks in the course of natural evolution. Contrary to the naïve expectation, we find that diverse modulation patterns are possible, including the simultaneous optimization of the two tasks. We show, however, that this simultaneous optimization is not in conflict with the trade-offs expected for two competing tasks: using the language of the theory of economic efficiency, trade-offs are realized in the Pareto set of optimal variants for the two tasks, while most protein variants do not belong to such Pareto set. That is, most protein variants are not Pareto-efficient and can potentially be improved in terms of several features.

Algorithms for optimizing cross-overs in DNA shuffling

BACKGROUND

DNA shuffling generates combinatorial libraries of chimeric genes by stochastically recombining parent genes. The resulting libraries are subjected to large-scale genetic selection or screening to identify those chimeras with favorable properties (e.g., enhanced stability or enzymatic activity). While DNA shuffling has been applied quite successfully, it is limited by its homology-dependent, stochastic nature. Consequently, it is used only with parents of sufficient overall sequence identity, and provides no control over the resulting chimeric library.

RESULTS

This paper presents efficient methods to extend the scope of DNA shuffling to handle significantly more diverse parents and to generate more predictable, optimized libraries. Our CODNS (cross-over optimization for DNA shuffling) approach employs polynomial-time dynamic programming algorithms to select codons for the parental amino acids, allowing for zero or a fixed number of conservative substitutions. We first present efficient algorithms to optimize the local sequence identity or the nearest-neighbor approximation of the change in free energy upon annealing, objectives that were previously optimized by computationally-expensive integer programming methods. We then present efficient algorithms for more powerful objectives that seek to localize and enhance the frequency of recombination by producing "runs" of common nucleotides either overall or according to the sequence diversity of the resulting chimeras. We demonstrate the effectiveness of CODNS in choosing codons and allocating substitutions to promote recombination between parents targeted in earlier studies: two GAR transformylases (41% amino acid sequence identity), two very distantly related DNA polymerases, Pol X and β (15%), and beta-lactamases of varying identity (26-47%).

CONCLUSIONS

Our methods provide the protein engineer with a new approach to DNA shuffling that supports substantially more diverse parents, is more deterministic, and generates more predictable and more diverse chimeric libraries.