Assessment of flexible backbone protein design methods for sequence library prediction in the therapeutic antibody Herceptin-HER2 interface

Predicting binding affinity changes from long-distance mutations using molecular dynamics simulations and Rosetta

Computationally modeling how mutations affect protein-protein binding not only helps uncover the biophysics of protein interfaces, but also enables the redesign and optimization of protein interactions. Traditional high-throughput methods for estimating binding free energy changes are currently limited to mutations directly at the interface due to difficulties in accurately modeling how long-distance mutations propagate their effects through the protein structure. However, the modeling and design of such mutations is of substantial interest as it allows for greater control and flexibility in protein design applications. We have developed a method that combines high-throughput Rosetta-based side-chain optimization with conformational sampling using classical molecular dynamics simulations, finding significant improvements in our ability to accurately predict long-distance mutational perturbations to protein binding. Our approach uses an analytical framework grounded in alchemical free energy calculations while enabling exploration of a vastly larger sequence space. When comparing to experimental data, we find that our method can predict internal long-distance mutational perturbations with a level of accuracy similar to that of traditional methods in predicting the effects of mutations at the protein-protein interface. This work represents a new and generalizable approach to optimize protein free energy landscapes for desired biological functions.

Generation of bright monomeric red fluorescent proteins via computational design of enhanced chromophore packing

Red fluorescent proteins (RFPs) have found widespread application in chemical and biological research due to their longer emission wavelengths. Here, we use computational protein design to increase the quantum yield and thereby brightness of a dim monomeric RFP (mRojoA, quantum yield = 0.02) by optimizing chromophore packing with aliphatic residues, which we hypothesized would reduce torsional motions causing non-radiative decay. Experimental characterization of the top 10 designed sequences yielded mSandy1 (λ em = 609 nm, quantum yield = 0.26), a variant with equivalent brightness to mCherry, a widely used RFP. We next used directed evolution to further increase brightness, resulting in mSandy2 (λ em = 606 nm, quantum yield = 0.35), the brightest Discosoma sp. derived monomeric RFP with an emission maximum above 600 nm reported to date. Crystallographic analysis of mSandy2 showed that the chromophore p-hydroxybenzylidene moiety is sandwiched between the side chains of Leu63 and Ile197, a structural motif that has not previously been observed in RFPs, and confirms that aliphatic packing leads to chromophore rigidification. Our results demonstrate that computational protein design can be used to generate bright monomeric RFPs, which can serve as templates for the evolution of novel far-red fluorescent proteins.

IsAb: a computational protocol for antibody design

The design of therapeutic antibodies has attracted a large amount of attention over the years. Antibodies are widely used to treat many diseases due to their high efficiency and low risk of adverse events. However, the experimental methods of antibody design are time-consuming and expensive. Although computational antibody design techniques have had significant advances in the past years, there are still some challenges that need to be solved, such as the flexibility of antigen structure, the lack of antibody structural data and the absence of standard antibody design protocol. In the present work, we elaborated on an in silico antibody design protocol for users to easily perform computer-aided antibody design. First, the Rosetta web server will be applied to generate the 3D structure of query antibodies if there is no structural information available. Then, two-step docking will be used to identify the binding pose of an antibody-antigen complex when the binding information is unknown. ClusPro is the first method to be used to conduct the global docking, and SnugDock is applied for the local docking. Sequentially, based on the predicted binding poses, in silico alanine scanning will be used to predict the potential hotspots (or key residues). Finally, computational affinity maturation protocol will be used to modify the structure of antibodies to theoretically increase their affinity and stability, which will be further validated by the bioassays in the future. As a proof of concept, we redesigned antibody D44.1 and compared it with previously reported data in order to validate IsAb protocol. To further illustrate our proposed protocol, we used cemiplimab antibody, a PD-1 checkpoint inhibitor, as an example to showcase a step-by-step tutorial.

Ensemble-based enzyme design can recapitulate the effects of laboratory directed evolution in silico

The creation of artificial enzymes is a key objective of computational protein design. Although de novo enzymes have been successfully designed, these exhibit low catalytic efficiencies, requiring directed evolution to improve activity. Here, we use room-temperature X-ray crystallography to study changes in the conformational ensemble during evolution of the designed Kemp eliminase HG3 (k_cat/K_M 146 M⁻¹s⁻¹). We observe that catalytic residues are increasingly rigidified, the active site becomes better pre-organized, and its entrance is widened. Based on these observations, we engineer HG4, an efficient biocatalyst (k_cat/K_M 103,000 M⁻¹s⁻¹) containing key first and second-shell mutations found during evolution. HG4 structures reveal that its active site is pre-organized and rigidified for efficient catalysis. Our results show how directed evolution circumvents challenges inherent to enzyme design by shifting conformational ensembles to favor catalytically-productive sub-states, and suggest improvements to the design methodology that incorporate ensemble modeling of crystallographic data.

Kemp eliminases are artificial enzymes that catalyze the concerted deprotonation and ring-opening of benzisoxazoles. Here, the authors use room-temperature X-ray crystallography to investigate changes to the conformational ensemble of the Kemp eliminase HG3 along a directed evolutionary trajectory, and develop an experimentally guided, ensemble-based computational enzyme design procedure.

Computational design of a modular protein sense-response system

Sensing and responding to signals is a fundamental ability of living systems, but despite substantial progress in the computational design of new protein structures, there is no general approach for engineering arbitrary new protein sensors. Here, we describe a generalizable computational strategy for designing sensor-actuator proteins by building binding sites de novo into heterodimeric protein-protein interfaces and coupling ligand sensing to modular actuation through split reporters. Using this approach, we designed protein sensors that respond to farnesyl pyrophosphate, a metabolic intermediate in the production of valuable compounds. The sensors are functional in vitro and in cells, and the crystal structure of the engineered binding site closely matches the design model. Our computational design strategy opens broad avenues to link biological outputs to new signals.

Antibody Structure and Function: The Basis for Engineering Therapeutics

Antibodies and antibody-derived macromolecules have established themselves as the mainstay in protein-based therapeutic molecules (biologics). Our knowledge of the structure–function relationships of antibodies provides a platform for protein engineering that has been exploited to generate a wide range of biologics for a host of therapeutic indications. In this review, our basic understanding of the antibody structure is described along with how that knowledge has leveraged the engineering of antibody and antibody-related therapeutics having the appropriate antigen affinity, effector function, and biophysical properties. The platforms examined include the development of antibodies, antibody fragments, bispecific antibody, and antibody fusion products, whose efficacy and manufacturability can be improved via humanization, affinity modulation, and stability enhancement. We also review the design and selection of binding arms, and avidity modulation. Different strategies of preparing bispecific and multispecific molecules for an array of therapeutic applications are included.

Comparison of Rosetta flexible-backbone computational protein design methods on binding interactions

Computational design of binding sites in proteins remains difficult, in part due to limitations in our current ability to sample backbone conformations that enable precise and accurate geometric positioning of side chains during sequence design. Here we present a benchmark framework for comparison between flexible-backbone design methods applied to binding interactions. We quantify the ability of different flexible backbone design methods in the widely used protein design software Rosetta to recapitulate observed protein sequence profiles assumed to represent functional protein/protein and protein/small molecule binding interactions. The CoupledMoves method, which combines backbone flexibility and sequence exploration into a single acceptance step during the sampling trajectory, better recapitulates observed sequence profiles than the BackrubEnsemble and FastDesign methods, which separate backbone flexibility and sequence design into separate acceptance steps during the sampling trajectory. Flexible-backbone design with the CoupledMoves method is a powerful strategy for reducing sequence space to generate targeted libraries for experimental screening and selection.

Combining Rosetta with molecular dynamics (MD): A benchmark of the MD-based ensemble protein design

Computational protein design is a set of procedures for computing amino acid sequences that will fold into a specified structure. Rosetta Design, a commonly used software for protein design, allows for the effective identification of sequences compatible with a given backbone structure, while molecular dynamics (MD) simulations can thoroughly sample near-native conformations. We benchmarked a procedure in which Rosetta design is started on MD-derived structural ensembles and showed that such a combined approach generates 20-30% more diverse sequences than currently available methods with only a slight increase in computation time. Importantly, the increase in diversity is achieved without a loss in the quality of the designed sequences assessed by their resemblance to natural sequences. We demonstrate that the MD-based procedure is also applicable to de novo design tasks started from backbone structures without any sequence information. In addition, we implemented a protocol that can be used to assess the stability of designed models and to select the best candidates for experimental validation. In sum our results demonstrate that the MD ensemble-based flexible backbone design can be a viable method for protein design, especially for tasks that require a large pool of diverse sequences.

Antibody Affinity Maturation by Computational Design

The immune systems protect our bodies from foreign molecules or antigens, where antibodies play important roles. Antibodies evolve over time upon antigen encounter by somatically mutating their genome sequences. The end result is a series of antibodies that display higher affinities and specificities to specific antigens. This process is called affinity maturation. Recent improvements in computer hardware and modeling algorithms now enable the rational design of protein structures and functions, and several works on computer-aided antibody design have been published. In this chapter, we briefly describe computational methods for antibody affinity maturation, focusing on methods for sampling antibody conformations and for scoring designed antibody variants. We also discuss lessons learned from the successful computer-aided design of antibodies.

Formation of multimeric antibodies for self-delivery of active monomers

Proteins and peptides have been used as drugs for almost a century. Technological advances in the past 30 years have enabled the production of pure, stable proteins in vast amounts. In contrast, administration of proteins based on their native active conformation (and thus necessitating the use of subcutaneous injections) has remained solely unchanged. The therapeutic anti-HER2 humanized monoclonal immunoglobulin (IgG) Trastuzumab (Herceptin) is a first line of the treatment for breast cancer. Chicken IgY is a commercially important polyclonal antibody (Ab). These Abs were examined for their ability to self-assemble and form ordered aggregates, by several biophysical methods. Atomic force microscopy analyses revealed the formation of multimeric nanostructures. The biological activity of multimeric IgG or IgY particles was retained and restored, in a dilution/time-dependent manner. IgG activity was confirmed by a binding assay using HER2 + human breast cancer cell line, SKBR3, while IgY activity was confirmed by ELISA assay using the VP2 antigen. Competition assay with native Herceptin antibodies demonstrated that the binding availability of the multimer formulation remained unaffected. Under long incubation periods, IgG multimers retained five times more activity than native IgG. In conclusion, the multimeric antibody formulations can serve as a storage depositories and sustained-release particles. These two important characteristics make this formulation promising for future novel administration protocols and altogether bring to light a different conceptual approach for the future use of therapeutic proteins as self-delivery entities rather than conjugated/encapsulated to other bio-compounds.

Multistate Computational Protein Design with Backbone Ensembles

The ability of computational protein design (CPD) to identify protein sequences possessing desired characteristics in vast sequence spaces makes it a highly valuable tool in the protein engineering toolbox. CPD calculations are typically performed using a single-state design (SSD) approach in which amino-acid sequences are optimized on a single protein structure. Although SSD has been successfully applied to the design of numerous protein functions and folds, the approach can lead to the incorrect rejection of desirable sequences because of the combined use of a fixed protein backbone template and a set of rigid rotamers. This fixed backbone approximation can be addressed by using multistate design (MSD) with backbone ensembles. MSD improves the quality of predicted sequences by using ensembles approximating conformational flexibility as input templates instead of a single fixed protein structure. In this chapter, we present a step-by-step guide to the implementation and analysis of MSD calculations with backbone ensembles. Specifically, we describe ensemble generation with the PertMin protocol, execution of MSD calculations for recapitulation of Streptococcal protein G domain β1 mutant stability, and analysis of computational predictions by sequence binning. Furthermore, we provide a comparison between MSD and SSD calculation results and discuss the benefits of multistate approaches to CPD.

Pushing the Backbone in Protein-Protein Docking

Conformational changes of proteins that occur upon binding typically confound computational docking algorithms. In this study, we test computational methods to capture protein backbone conformational change related to binding. To address how well existing algorithms can sample bound-like backbones, we query seven techniques including Monte Carlo-based sampling, molecular dynamics, and normal mode analysis. All methods tested rarely sample near-bound states from the unbound conformation. Nevertheless, the direction of the predicted motions overlap with the actual conformational change. We next forced the backbone from the unbound toward the bound conformation to create a family of docking energy landscapes. Seventy percent of docking targets succeed when the unbound backbones is pushed to within 0.6 Å of the bound. Current methods can capture an average of 22% of unbound-bound transitions through conformer selection methods and another 57% through induced-fit methodologies, delineating a stubborn gap (21%) in backbone motion not covered by any current approach.

Algorithms for protein design

Computational structure-based protein design programs are becoming an increasingly important tool in molecular biology. These programs compute protein sequences that are predicted to fold to a target structure and perform a desired function. The success of a program's predictions largely relies on two components: first, the input biophysical model, and second, the algorithm that computes the best sequence(s) and structure(s) according to the biophysical model. Improving both the model and the algorithm in tandem is essential to improving the success rate of current programs, and here we review recent developments in algorithms for protein design, emphasizing how novel algorithms enable the use of more accurate biophysical models. We conclude with a list of algorithmic challenges in computational protein design that we believe will be especially important for the design of therapeutic proteins and protein assemblies.

Computationally Designed Bispecific Antibodies using Negative State Repertoires

A challenge in the structure-based design of specificity is modeling the negative states, i.e., the complexes that you do not want to form. This is a difficult problem because mutations predicted to destabilize the negative state might be accommodated by small conformational rearrangements. To overcome this challenge, we employ an iterative strategy that cycles between sequence design and protein docking in order to build up an ensemble of alternative negative state conformations for use in specificity prediction. We have applied our technique to the design of heterodimeric CH3 interfaces in the Fc region of antibodies. Combining computationally and rationally designed mutations produced unique designs with heterodimer purities greater than 90%. Asymmetric Fc crystallization was able to resolve the interface mutations; the heterodimer structures confirmed that the interfaces formed as designed. With these CH3 mutations, and those made at the heavy-/light-chain interface, we demonstrate one-step synthesis of four fully IgG-bispecific antibodies.

AB-Bind: Antibody binding mutational database for computational affinity predictions

Antibodies (Abs) are a crucial component of the immune system and are often used as diagnostic and therapeutic agents. The need for high-affinity and high-specificity antibodies in research and medicine is driving the development of computational tools for accelerating antibody design and discovery. We report a diverse set of antibody binding data with accompanying structures that can be used to evaluate methods for modeling antibody interactions. Our Antibody-Bind (AB-Bind) database includes 1101 mutants with experimentally determined changes in binding free energies (ΔΔG) across 32 complexes. Using the AB-Bind data set, we evaluated the performance of protein scoring potentials in their ability to predict changes in binding free energies upon mutagenesis. Numerical correlations between computed and observed ΔΔG values were low (r = 0.16-0.45), but the potentials exhibited predictive power for classifying variants as improved vs weakened binders. Performance was evaluated using the area under the curve (AUC) for receiver operator characteristic (ROC) curves; the highest AUC values for 527 mutants with |ΔΔG| > 1.0 kcal/mol were 0.81, 0.87, and 0.88 using STATIUM, FoldX, and Discovery Studio scoring potentials, respectively. Some methods could also enrich for variants with improved binding affinity; FoldX and Discovery Studio were able to correctly rank 42% and 30%, respectively, of the 80 most improved binders (those with ΔΔG < -1.0 kcal/mol) in the top 5% of the database. This modest predictive performance has value but demonstrates the continuing need to develop and improve protein energy functions for affinity prediction.

Protein backbone ensemble generation explores the local structural space of unseen natural homologs

MOTIVATION

Mutations in homologous proteins affect changes in the backbone conformation that involve a complex interplay of forces which are difficult to predict. Protein design algorithms need to anticipate these backbone changes in order to accurately calculate the energy of the structure given an amino acid sequence, without knowledge of the final, designed sequence. This is related to the problem of predicting small changes in the backbone between highly similar sequences.

RESULTS

We explored the ability of the Rosetta suite of protein design tools to move the backbone from its position in one structure (template) to its position in a close homologous structure (target) as a function of the diversity of a backbone ensemble constructed using the template structure, the percent sequence identity between the template and target, and the size of local zone being considered in the ensemble. We describe a pareto front in the likelihood of moving the backbone toward the target as a function of ensemble diversity and zone size. The equations and protocols presented here will be useful for protein design.

AVAILABILITY AND IMPLEMENTATION

PyRosetta scripts available at www.bioinfo.rpi.edu/bystrc/downloads.html#ensemble

CONTACT

bystrc@rpi.edu.

Fast gap-free enumeration of conformations and sequences for protein design

Despite significant successes in structure-based computational protein design in recent years, protein design algorithms must be improved to increase the biological accuracy of new designs. Protein design algorithms search through an exponential number of protein conformations, protein ensembles, and amino acid sequences in an attempt to find globally optimal structures with a desired biological function. To improve the biological accuracy of protein designs, it is necessary to increase both the amount of protein flexibility allowed during the search and the overall size of the design, while guaranteeing that the lowest-energy structures and sequences are found. DEE/A*-based algorithms are the most prevalent provable algorithms in the field of protein design and can provably enumerate a gap-free list of low-energy protein conformations, which is necessary for ensemble-based algorithms that predict protein binding. We present two classes of algorithmic improvements to the A* algorithm that greatly increase the efficiency of A*. First, we analyze the effect of ordering the expansion of mutable residue positions within the A* tree and present a dynamic residue ordering that reduces the number of A* nodes that must be visited during the search. Second, we propose new methods to improve the conformational bounds used to estimate the energies of partial conformations during the A* search. The residue ordering techniques and improved bounds can be combined for additional increases in A* efficiency. Our enhancements enable all A*-based methods to more fully search protein conformation space, which will ultimately improve the accuracy of complex biomedically relevant designs.

Optimization of rotamers prior to template minimization improves stability predictions made by computational protein design

Computational protein design (CPD) predictions are highly dependent on the structure of the input template used. However, it is unclear how small differences in template geometry translate to large differences in stability prediction accuracy. Herein, we explored how structural changes to the input template affect the outcome of stability predictions by CPD. To do this, we prepared alternate templates by Rotamer Optimization followed by energy Minimization (ROM) and used them to recapitulate the stability of 84 protein G domain β1 mutant sequences. In the ROM process, side-chain rotamers for wild-type (WT) or mutant sequences are optimized on crystal or nuclear magnetic resonance (NMR) structures prior to template minimization, resulting in alternate structures termed ROM templates. We show that use of ROM templates prepared from sequences known to be stable results predominantly in improved prediction accuracy compared to using the minimized crystal or NMR structures. Conversely, ROM templates prepared from sequences that are less stable than the WT reduce prediction accuracy by increasing the number of false positives. These observed changes in prediction outcomes are attributed to differences in side-chain contacts made by rotamers in ROM templates. Finally, we show that ROM templates prepared from sequences that are unfolded or that adopt a nonnative fold result in the selective enrichment of sequences that are also unfolded or that adopt a nonnative fold, respectively. Our results demonstrate the existence of a rotamer bias caused by the input template that can be harnessed to skew predictions toward sequences displaying desired characteristics.

Discovery of substrates for a SET domain lysine methyltransferase predicted by multistate computational protein design

Characterization of lysine methylation has proven challenging despite its importance in biological processes such as gene transcription, protein turnover, and cytoskeletal organization. In contrast to other key posttranslational modifications, current proteomics techniques have thus far shown limited success at characterizing methyl-lysine residues across the cellular landscape. To complement current biochemical characterization methods, we developed a multistate computational protein design procedure to probe the substrate specificity of the protein lysine methyltransferase SMYD2. Modeling of substrate-bound SMYD2 identified residues important for substrate recognition and predicted amino acids necessary for methylation. Peptide- and protein- based substrate libraries confirmed that SMYD2 activity is dictated by the motif [LFM]-1-K(∗)-[AFYMSHRK]+1-[LYK]+2 around the target lysine K(∗). Comprehensive motif-based searches and mutational analysis further established four additional substrates of SMYD2. Our methodology paves the way to systematically predict and validate posttranslational modification sites while simultaneously pairing them with their associated enzymes.

A flexible docking approach for prediction of T cell receptor-peptide-MHC complexes

T cell receptors (TCRs) are immune proteins that specifically bind to antigenic molecules, which are often foreign peptides presented by major histocompatibility complex proteins (pMHCs), playing a key role in the cellular immune response. To advance our understanding and modeling of this dynamic immunological event, we assembled a protein-protein docking benchmark consisting of 20 structures of crystallized TCR/pMHC complexes for which unbound structures exist for both TCR and pMHC. We used our benchmark to compare predictive performance using several flexible and rigid backbone TCR/pMHC docking protocols. Our flexible TCR docking algorithm, TCRFlexDock, improved predictive success over the fixed backbone protocol, leading to near-native predictions for 80% of the TCR/pMHC cases among the top 10 models, and 100% of the cases in the top 30 models. We then applied TCRFlexDock to predict the two distinct docking modes recently described for a single TCR bound to two different antigens, and tested several protein modeling scoring functions for prediction of TCR/pMHC binding affinities. This algorithm and benchmark should enable future efforts to predict, and design of uncharacterized TCR/pMHC complexes.

Computationally designed libraries for rapid enzyme stabilization

The ability to engineer enzymes and other proteins to any desired stability would have wide-ranging applications. Here, we demonstrate that computational design of a library with chemically diverse stabilizing mutations allows the engineering of drastically stabilized and fully functional variants of the mesostable enzyme limonene epoxide hydrolase. First, point mutations were selected if they significantly improved the predicted free energy of protein folding. Disulfide bonds were designed using sampling of backbone conformational space, which tripled the number of experimentally stabilizing disulfide bridges. Next, orthogonal in silico screening steps were used to remove chemically unreasonable mutations and mutations that are predicted to increase protein flexibility. The resulting library of 64 variants was experimentally screened, which revealed 21 (pairs of) stabilizing mutations located both in relatively rigid and in flexible areas of the enzyme. Finally, combining 10-12 of these confirmed mutations resulted in multi-site mutants with an increase in apparent melting temperature from 50 to 85°C, enhanced catalytic activity, preserved regioselectivity and a >250-fold longer half-life. The developed Framework for Rapid Enzyme Stabilization by Computational libraries (FRESCO) requires far less screening than conventional directed evolution.

Computational protein design quantifies structural constraints on amino acid covariation

Amino acid covariation, where the identities of amino acids at different sequence positions are correlated, is a hallmark of naturally occurring proteins. This covariation can arise from multiple factors, including selective pressures for maintaining protein structure, requirements imposed by a specific function, or from phylogenetic sampling bias. Here we employed flexible backbone computational protein design to quantify the extent to which protein structure has constrained amino acid covariation for 40 diverse protein domains. We find significant similarities between the amino acid covariation in alignments of natural protein sequences and sequences optimized for their structures by computational protein design methods. These results indicate that the structural constraints imposed by protein architecture play a dominant role in shaping amino acid covariation and that computational protein design methods can capture these effects. We also find that the similarity between natural and designed covariation is sensitive to the magnitude and mechanism of backbone flexibility used in computational protein design. Our results thus highlight the necessity of including backbone flexibility to correctly model precise details of correlated amino acid changes and give insights into the pressures underlying these correlations.

Proteins generally fold into specific three-dimensional structures to perform their cellular functions, and the presence of misfolded proteins is often deleterious for cellular and organismal fitness. For these reasons, maintenance of protein structure is thought to be one of the major fitness pressures acting on proteins. Consequently, the sequences of today's naturally occurring proteins contain signatures reflecting the constraints imposed by protein structure. Here we test the ability of computational protein design methods to recapitulate and explain these signatures. We focus on the physical basis of evolutionary pressures that act on interactions between amino acids in folded proteins, which are critical in determining protein structure and function. Such pressures can be observed from the appearance of amino acid covariation, where the amino acids at certain positions in protein sequences are correlated with each other. We find similar patterns of amino acid covariation in natural sequences and sequences optimized for their structures using computational protein design, demonstrating the importance of structural constraints in protein molecular evolution and providing insights into the structural mechanisms leading to covariation. In addition, these results characterize the ability of computational methods to model the precise details of correlated amino acid changes, which is critical for engineering new proteins with useful functions beyond those seen in nature.

Computer-aided antibody design

Recent clinical trials using antibodies with low toxicity and high efficiency have raised expectations for the development of next-generation protein therapeutics. However, the process of obtaining therapeutic antibodies remains time consuming and empirical. This review summarizes recent progresses in the field of computer-aided antibody development mainly focusing on antibody modeling, which is divided essentially into two parts: (i) modeling the antigen-binding site, also called the complementarity determining regions (CDRs), and (ii) predicting the relative orientations of the variable heavy (V(H)) and light (V(L)) chains. Among the six CDR loops, the greatest challenge is predicting the conformation of CDR-H3, which is the most important in antigen recognition. Further computational methods could be used in drug development based on crystal structures or homology models, including antibody-antigen dockings and energy calculations with approximate potential functions. These methods should guide experimental studies to improve the affinities and physicochemical properties of antibodies. Finally, several successful examples of in silico structure-based antibody designs are reviewed. We also briefly review structure-based antigen or immunogen design, with application to rational vaccine development.

Multistate approaches in computational protein design

Computational protein design (CPD) is a useful tool for protein engineers. It has been successfully applied towards the creation of proteins with increased thermostability, improved binding affinity, novel enzymatic activity, and altered ligand specificity. Traditionally, CPD calculations search and rank sequences using a single fixed protein backbone template in an approach referred to as single-state design (SSD). While SSD has enjoyed considerable success, certain design objectives require the explicit consideration of multiple conformational and/or chemical states. Cases where a "multistate" approach may be advantageous over the SSD approach include designing conformational changes into proteins, using native ensembles to mimic backbone flexibility, and designing ligand or oligomeric association specificities. These design objectives can be efficiently tackled using multistate design (MSD), an emerging methodology in CPD that considers any number of protein conformational or chemical states as inputs instead of a single protein backbone template, as in SSD. In this review article, recent examples of the successful design of a desired property into proteins using MSD are described. These studies employing MSD are divided into two categories--those that utilized multiple conformational states, and those that utilized multiple chemical states. In addition, the scoring of competing states during negative design is discussed as a current challenge for MSD.