Abstract
Computational design of new active sites has generally proceeded by geometrically defining interactions between the reaction transition state(s) and surrounding side‐chain functional groups which maximize transition‐state stabilization, and then searching for sites in protein scaffolds where the specified side‐chain–transition‐state interactions can be realized. A limitation of this approach is that the interactions between the side chains themselves are not constrained. An extensive connected hydrogen bond network involving the catalytic residues was observed in a designed retroaldolase following directed evolution. Such connected networks could increase catalytic activity by preorganizing active site residues in catalytically competent orientations, and enabling concerted interactions between side chains during catalysis, for example, proton shuffling. We developed a method for designing active sites in which the catalytic side chains, in addition to making interactions with the transition state, are also involved in extensive hydrogen bond networks. Because of the added constraint of hydrogen‐bond connectivity between the catalytic side chains, to find solutions, a wider range of interactions between these side chains and the transition state must be considered. Our new method starts from a ChemDraw‐like two‐dimensional representation of the transition state with hydrogen‐bond donors, acceptors, and covalent interaction sites indicated, and all placements of side‐chain functional groups that make the indicated interactions with the transition state, and are fully connected in a single hydrogen‐bond network are systematically enumerated. The RosettaMatch method can then be used to identify realizations of these fully‐connected active sites in protein scaffolds. The method generates many fully‐connected active site solutions for a set of model reactions that are promising starting points for the design of fully‐preorganized enzyme catalysts.
Keywords: biocatalysis, computational modeling, enzyme design, enzyme mechanism, protein design
1.
The goal of de novo enzyme design is to create protein catalysts for any chemical reaction of interest.1, 2, 3, 4, 5 Several approaches have been developed to generate new enzyme active sites by searching for placements of catalytically competent side‐chain constellations in selected protein scaffolds or curated subsets of the Protein Data Bank containing up to several thousand protein structures.6, 7, 8, 9, 10, 11 Rosetta computational enzyme design calculations have proceeded by first generating an ideal active site, or theozyme, consisting of the reaction transition state surrounded by side‐chain functional groups positioned so as to maximize transition‐state stabilization. RosettaMatch is then used to search for geometrically compatible placements of these ideal active sites in protein scaffolds.12 While directed evolution has succeeded in maturing computational designs to have activities comparable to native enzymes,13, 14, 15, 16, 17, 18, 19 the activities of the original computational designs have generally been quite low. Achieving high catalytic activity directly from computation is an outstanding current challenge.
A route to increasing the activity of computational enzyme designs is suggested by the crystal structure of the optimized aldolase RA95.5‐8F which, with a k cat/K m of ~33,800 ± 4,200 M−1 s−1, is 200,000‐fold more active than the original RA95.0 design (Figure 1a,b).15 In this structure (Figure 1c), the catalytic residues form an extensive hydrogen‐bond network (a catalytic quartet). In contrast, in the starting computational design, as in most such designs, there are only a small number of interactions between the designed catalytic residues. High catalytic residue connectivity has the advantage of allowing concerted transitions, such as proton shuffling, during catalysis and in preorganizing the active site residues in catalytically competent conformations. Indeed, highly‐connected catalytic side‐chain networks are frequently observed in native enzymes. A limitation of the RosettaMatch method, which focuses on the geometry of side‐chain interactions with the transition state, is that the extent of interaction of catalytic residues with each other cannot be directly specified.
We set out to develop a computational method to directly generate such connected catalytic networks. RosettaMatch starts from a geometric description of the optimal interaction geometries between side‐chain functional groups and the transition state (from QM calculations or chemical intuition); to find fully‐connected active sites it is necessary to allow a wider range of functional‐group–transition‐state geometries. We reasoned that potential losses in activity from less optimal placement of individual functional groups relative to the transition state could be more than compensated by the advantages of catalytic network connectivity. The new method, HBNetGen, starts from a ChemDraw‐like specification of the hydrogen‐bonding and partial‐covalent interactions between side‐chain functional groups and the reaction transition state (rather than the more detailed geometric information in the original RosettaMatch), and between the catalytic side chains themselves (much like textbook schematic depictions of enzyme active sites). The transition state is placed on a grid, and side‐chain functional groups are placed around the transition state according to the active‐site specification. The grid enables complete enumeration of compatible functional‐group placements at a resolution set by the (user‐specified) grid spacing. At a grid spacing of 0.2 Å, there are typically ~103–104 functional‐group placements for each individual interaction in the active‐site specification. Next, for each side‐chain–side‐chain hydrogen bond in the connected active‐site specification, each pair of functional‐group placements for the two side chains is queried for the presence of the hydrogen bond, and placements which do not make the required interaction with any of the enumerated placements for the second side chain are discarded. Catalytic networks are then completed by joining the pairs of hydrogen‐bonding residues, and fully‐connected networks which make all the specified interactions between catalytic side chains and transition state and between the catalytic side chains are output.
To test HBNetGen, we selected seven examples of fully‐connected catalytic networks in the PDB and ran HBNetGen on these crystal structures and that of the evolved retroaldolase, starting from the backbone coordinates and a ChemDraw description of the connectivity of the desired active site. For direct comparison with the crystal structures, the inhibitor or reaction product was used in these tests rather than the computed reaction transition state. The results are summarized in Figure 2: for each ligand, the left‐most panel shows the two‐dimensional description of the network as a ChemDraw image, the center panel shows an example of a complete network at the functional‐group level with the number of generated networks indicated below, and the right‐most panel shows a full‐side‐chain representation of the network with the number of unique backbone positions for the selected side‐chain identities indicated below. The number of fully‐connected network solutions ranges from 7,267 for the alanine phosphonate network to 1,534,996 for the retroaldolase network.
To identify placements of the connected networks in sets of protein scaffolds, we adapted the previously described RosettaMatch method to input the rigid‐body transformations for each residue in each network expressed in a hierarchical XML file: a RosettaMatch calculation using the side‐chain conformations from a single HBNetGen network will by construction only identify fully‐connected active sites. However, even with the efficiency of RosettaMatch, searching for placements of hundreds of thousands of designed, connected active sites in protein scaffolds, each with a unique set of side‐chain conformations, is not computationally feasible for any but the simplest active sites. To make this problem tractable, we experimented with pooling the side‐chain conformations from all HBNetGen networks, and then using RosettaMatch to find combinations of side chains making the specified interactions with the transition state. This solution has the advantage of ensuring that each rotamer at each position is only considered once during the calculation, which considerably increases computational efficiency, but has the consequence that side‐chain conformations from different networks can be mixed during matching. We speculated that side‐chain rotamer conformations in the same HBNetGen network would have a higher likelihood of being placed in the same active site by RosettaMatch because of their geometric complementarity, leading to recovery of many of the input networks. However, fully‐connected networks were recovered infrequently with this approach (see next paragraph). To modulate the extent of network remixing, we experimented with clustering the set of networks on the coordinates of the central functional groups; this allows smooth interpolation between the case where each network is treated independently (cluster size 1), and that where all networks are combined (one large cluster). A larger number of smaller clusters will produce fewer models with incomplete networks but will increase the runtime because a separate calculation must be performed for each cluster; we found that using ~250 clusters balanced performance and the run‐time increase.
To evaluate the performance of HBNetGen‐guided match generation, we matched the set of networks inspired by the evolved retro‐aldolase (RA95.5‐8F) active site, with the additional criterion that each side chain must interact with the ligand directly (Figure S3), into a set of ~6,000 ligand‐binding scaffolds.20 We modeled the transition state for carbinolamine formation with a partial covalent bond to the nucleophilic lysine, and generated positions of the remaining three residues using HBNetGen, which produced 4,858 networks. Clustering produced 222 clusters comprising 4,526 networks. We compared three approaches: (a) the original RosettaMatch residue‐based method that considers each residue completely independently using functional group geometries based solely on interaction geometry with the substrate; (b) RosettaMatch using all 4,858 sidechain conformations from all networks identified by HBNetGen in one simulation; and (c) independent RosettaMatch calculations using side‐chain conformations from each of 239 clusters of HBNetGen networks (thus retaining the primary side‐chain dependencies determined by HBNetGen). For each resulting active site placement, we determined whether the desired connectivity of the catalytic side chains was achieved. The third approach (using the 239 networks resulting from clustering) generated 98 fully‐connected active site solutions from 3,031 matches, the second approach (using all side chain arrangements from all 4,858 networks) yielded 3,991 matches, but fewer (47) connected networks, and control RosettaMatch calculations identified only one fully‐connected network (Table 1; in all cases, most of the matches involve only partial networks, as expected because RosettaMatch considers each residue individually in order to make the search computationally tractable). The smaller number of fully‐connected networks found in the second approach compared to the third approach is due to pruning within RosettaMatch to reduce the combinatorial complexity of the sampling problem (see Supporting Information). Figure 1d–f shows fully‐connected matches of the RA95.5‐8F‐inspired theozyme in three different scaffolds. The networked residues are shown in magenta sticks, the ligand is shown in cyan sticks, and hydrogen bonds are indicated with black, dashed lines. While all the matches have the connectivity of the input two‐dimensional active site depiction, the three‐dimensional realizations are quite different.
Table 1.
Simulation ID | Number of incomplete networks | Number of complete networks | Completion rate |
---|---|---|---|
Residue‐baseda | 7,455 | 1 | 0.013% |
Network‐basedb (all) | 3,991 | 47 | 1.18% |
Network‐basedb (clustered) | 3,031 | 98 | 3.23% |
Side‐chain geometries from rigid‐body transformation to ligand for each residue separately (default RosettaMatch settings).
Side‐chain geometries from networks produced by HBNetGen, tested with, and without clustering.
HBNetGen explicitly generates fully‐connected active sites that are likely to be more preorganized than previous de novo designed catalytic sites. It allows exploration of different catalytic‐site specifications (at the ChemDraw level), completely independent of a particular protein backbone. This capability enables determination of the extent to which different sites can be realized in three dimensions with full hydrogen bonded connectivity, and investigation, again independent of any protein backbone, of whether the active site configurations found in nature were favored because of the transition state stabilization they provide or because of the connectivity of the catalytic side chains. It is likely that algorithms for finding matches to the HBNetGen connected sites in actual protein structures can be developed that are more efficient than the simple RosettaMatch implementation described here which breaks up the networks for computational tractability. Experimental characterization of HBNetGen fully‐connected active sites should provide insight into the contribution of preorganization and side‐chain connectivity to catalysis.
CONFLICT OF INTEREST
The authors declare no competing financial interest.
Supporting information
ACKNOWLEDGMENTS
This work was supported by the Washington Research Foundation (B.D.W., A.G.D.), the Howard Hughes Medical Institute (Y.K., D.B.), the Defense Threat Reduction Agency (D.B.), and the Swiss National Science Foundation (D.H.).
Weitzner BD, Kipnis Y, Daniel AG, Hilvert D, Baker D. A computational method for design of connected catalytic networks in proteins. Protein Science. 2019;28:2036–2041. 10.1002/pro.3757
Present address Brian D. Weitzner, Lyell Immunopharma, Seattle, WA 98109.
Brian D. Weitzner, Yakov Kipnis, and A. Gerard Daniel contributed equally to this work.
Funding information Howard Hughes Medical Institute; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Washington Research Foundation; Defense Threat Reduction Agency (DTRA) to DB
REFERENCES
- 1. Siegel JB, Zanghellini A, Lovick HM, et al. Computational design of an enzyme catalyst for a stereoselective bimolecular Diels‐Alder reaction. Science. 2010;329:309–313. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 2. Jiang L, Althoff EA, Clemente FR, et al. De novo computational design of retro‐aldol enzymes. Science. 2008;319:1387–1391. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 3. Röthlisberger D, Khersonsky O, Wollacott AM, et al. Kemp elimination catalysts by computational enzyme design. Nature. 2008;453:190–195. [DOI] [PubMed] [Google Scholar]
- 4. Bolon DN, Mayo SL. Enzyme‐like proteins by computational design. Proc Natl Acad Sci USA. 2001;98:14274–14279. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 5. Privett HK, Kiss G, Lee TM, et al. Iterative approach to computational enzyme design. Proc Natl Acad Sci USA. 2012;109:3790–3795. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 6. Fazelinia H, Cirino PC, Maranas CD. OptGraft: A computational procedure for transferring a binding site onto an existing protein scaffold. Protein Sci. 2009;18:180–195. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 7. Zhang C, Lai L. AutoMatch: target‐binding protein design and enzyme design by automatic pinpointing potential active sites in available protein scaffolds. Proteins. 2012;80:1078–1094. [DOI] [PubMed] [Google Scholar]
- 8. Lassila JK, Privett HK, Allen BD, Mayo SL. Combinatorial methods for small‐molecule placement in computational enzyme design. Proc Natl Acad Sci USA. 2006;103:16710–16715. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 9. Malisi C, Kohlbacher O, Höcker B. Automated scaffold selection for enzyme design. Proteins. 2009;77:74–83. [DOI] [PubMed] [Google Scholar]
- 10. Zhu X, Lai L. A novel method for enzyme design. J Comput Chem. 2009;30:256–267. [DOI] [PubMed] [Google Scholar]
- 11. Lei Y, Luo W, Zhu Y. A matching algorithm for catalytic residue site selection in computational enzyme design. Protein Sci. 2011;20:1566–1575. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 12. Zanghellini A, Jiang L, Wollacott AM, et al. New algorithms and an in silico benchmark for computational enzyme design. Protein Sci. 2006;15:2785–2794. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 13. Giger L, Caner S, Obexer R, et al. Evolution of a designed retro‐aldolase leads to complete active site remodeling. Nat Chem Biol. 2013;9:494–498. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 14. Khersonsky O, Kiss G, Röthlisberger D, et al. Bridging the gaps in design methodologies by evolutionary optimization of the stability and proficiency of designed Kemp eliminase KE59. Proc Natl Acad Sci USA. 2012;109:10358–10363. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 15. Obexer R, Godina A, Garrabou X, et al. Emergence of a catalytic tetrad during evolution of a highly active artificial aldolase. Nat Chem. 2017;9:50–56. [DOI] [PubMed] [Google Scholar]
- 16. Althoff EA, Wang L, Jiang L, et al. Robust design and optimization of retroaldol enzymes. Protein Sci. 2012;21:717–726. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 17. Blomberg R, Kries H, Pinkas DM, et al. Precision is essential for efficient catalysis in an evolved Kemp eliminase. Nature. 2013;503:418–421. [DOI] [PubMed] [Google Scholar]
- 18. Preiswerk N, Beck T, Schulz JD, et al. Impact of scaffold rigidity on the design and evolution of an artificial Diels‐Alderase. Proc Natl Acad Sci USA. 2014;111:8013–8018. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 19. Studer S, Hansen DA, Pianowski ZL, et al. Evolution of a highly active and enantiospecific metalloenzyme from short peptides. Science. 2018;362:1285–1288. [DOI] [PubMed] [Google Scholar]
- 20. Benson ML, Smith RD, Khazanov NA, et al. Binding MOAD, a high‐quality protein‐ligand database. Nucleic Acids Res. 2008;36:D674–D678. [DOI] [PMC free article] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.