Advances in BioinformaticsVolume 2011 (2011), Article ID 457578, 7 pagesdoi:10.1155/2011/457578

Research Article

Computational Design of a DNA- and Fc-Binding Fusion Protein

Jonas Winkler,¹ Giuliano Armano,² J. Nikolaj Dybowski,¹ Oliver Kuhn,¹ Filippo Ledda,² and Dominik Heider¹

¹Department of Bioinformatics, Center for Medical Biotechnology, University of Duisburg-Essen, Universitaetsstraβe 1-5, 45117 Essen, Germany²Department of Electrical and Electronic Engineering, University of Cagliari, Piazza d'Armi, 09123 Cagliari, Italy

Received 29 April 2011; Revised 16 June 2011; Accepted 22 June 2011

Academic Editor: Shandar Ahmad

Copyright © 2011 Jonas Winkler et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

Computational design of novel proteins with well-defined functions is an ongoing topic in computational biology. In this work, we generated and optimized a new synthetic fusion protein using an evolutionary approach. The optimization was guided by directed evolution based on hydrophobicity scores, molecular weight, and secondary structure predictions. Several methods were used to refine the models built from the resulting sequences. We have successfully combined two unrelated naturally occurring binding sites, the immunoglobin Fc-binding site of the Z domain and the DNA-binding motif of MyoD bHLH, into a novel stable protein.

1. Introduction

Protein design methods use trial and error or more sophisticated methods like directed evolution or inverse folding to generate novel scaffolds or to find novel protein sequences folding into a defined scaffold, respectively. Given the intimate relationship between a protein’s structure and function, a way to design proteins with targeted properties is to start from a desired structure and find sequences able to fold into it, imposing additional constraints in the process [1]. On the one hand, it is known that, in general, similar sequences fold into similar structures [2]; on the other hand, there are many cases of nearly identical structures known, sharing no sequence similarity at all [3]. However, the aim of computational design methods is not finding all possible solutions, but at least one solution that fits the required properties. One of the methods that have been proposed is a multiobjective optimization, in which protein stability and catalytic activity are simultaneously optimized [4, 5].

In convergent evolution, nonhomologous proteins evolve in separate biological contexts to catalyze the same or similar reactions. There exist two types of convergent evolution: (1) mechanistic analogs that uses the same mechanisms to perform related reactions and (2) transformational analogs catalyzing exactly the same reaction. However, analogous proteins may have structural homology although this is not a prerequisite. Prominent examples are the antifreeze glycoproteins [6], protein phosphatases [7], and glutaminyl cyclases [8].

Several methods have been proposed to design novel stable proteins, such as multi-objective optimization, in which protein stability and catalytic activity are simultaneously optimized. For instance, Gronwald et al. [4] used a multi-objective optimization to build new stable peptides based on the villin headpiece (VH) sequence, which is known to be stable in vitro. VH is derived from a single protein domain of 35 residues [9]. The algorithm of Gronwald et al. consists of four steps. First, the sequences carrying point mutations are modeled on a given template structure, and subsequently, molecular dynamics simulations are carried out for 10 ns. After simulation, the fitness of each model is evaluated, and the best models are selected for further optimization.

The limits of current methods is the incorporation of molecular dynamics simulations into the multi-objective optimization. Due to the fact that molecular dynamics simulations are very expensive regarding computational time, new fitness functions have to be introduced without loosing predictive power. Thus, a preprocessing and prescreening of amino acid sequences is necessary due to the huge dimension of the potential sequence space. In classification studies, amino acids are often represented by so called descriptors, mapping each amino acid to a numerical value. These descriptors range from physicochemical properties, for example, hydrophobicity, molecular weight, or isoelectric point, to more complex arrangements. It has been shown that the composition of the descriptor set is one of the most crucial parts in classifier development [10]. However, we tested several of these descriptors in different classification studies, ranging from functional classification and identification of protein families [11, 12], coreceptor prediction of HIV-1 [13], and HIV-1 drug resistance prediction [14]. Hydrophobicity was one of the most important physicochemical properties, due to the fact that it is involved in protein interactions, for example, by forming hydrophobic cores. However, molecular weight is also important due to potential steric incompatibilities within protein cores. Furthermore, we found out that electrostatic potentials are also good descriptors, because they are also involved in protein interactions [13].

While most protein design methods focus on divergent evolution, and thus aim at improving characteristics of a specific protein such as stability and binding affinity, we used directed evolution to create a novel synthetic protein combining two unrelated naturally occurring binding sites: the immunoglobin Fc-binding site of the Z domain and the DNA-binding motif of MyoD bHLH. The resulting protein should be able to bind to both the Fc region of human antibodies and to DNA simultaneously. We compare our multiobjective optimization scheme to that of Gronwald et al. [4] with respect to computational efficiency and overall number of sequences investigated.

2. Materials and Methods

2.1. Protein Z and MyoD

Protein Z is derived from staphylococcal protein A and holds an IgG Fc-binding domain. It consists of a three-helix bundle built from 58 amino acids. Helix 1 and 2 contain the Fc-binding region, whereas helix 3 is necessary for Fab binding [15]. Chain B of PDB file 1LP1 [16] was used as a model for protein Z. In this study, we transplanted the DNA-binding region of MyoD intro helix 3 of protein Z. MyoD is a bHLH domain DNA-binding protein [17]. The protein-DNA complex structure (PDB: 1MDY) was used in this study.

2.2. Design Process

We employed a genetic algorithm (GA) with a multiobjective fitness function based on secondary structure alignments and hydrophobicity and molecular weight comparisons. In an iterative process, sequences were assessed by the fitness function, best-ranked sequences were selected, recombined, and mutated to get new sets of sequences. The resulting sequence sets were refined in a second step. ERIS [18] was used to model sequences onto the wild-type structure and to calculate their free energy. The models with the lowest free energy were subsequently evaluated using molecular dynamics simulations (Figure 1).

Figure 1: Chart of the design process. We employed a genetic algorithm (GA) with a fitness function based on secondary structure alignments and hydrophobicity and molecular weight comparisons. The resulting sequence set of this iterative process was refined using ERIS to build and rank the models which were then simulated using molecular dynamics simulations in order to estimate stability according to [4]. Amber and Brownian dynamics simulations are applied for testing and refinement of the final optimized protein models.

2.3. Multiobjective Optimization

Multiobjective optimization has been widely applied in protein design [4], providing a heuristic solution for optimization problems without the need for problem specific domain knowledge.

The quality of a solution is not represented by a single value, but rather as a vector representing the quality for each criterion. This can be formulated as with being the corresponding fitness functions and the target protein.

In contrast to natural or real numbers, vectors do not have a natural order. To compare vectors with each other, which is necessary for the optimization process, we identify all vectors dominated by another one. One vector dominates another vector if it is bigger in at least one component and equal at the remaining components. This can be mathematically expressed by and being the vectors to be compared: (i), (ii) with and ,(iii)if has greater and smaller components than , the vectors do not dominate each other.

For instance, dominates , because . However, neither dominates nor , because .

All vectors that are not dominated by other vectors build the first Pareto frontier. Dominating vectors are removed from the set, and the next Pareto frontiers are calculated iteratively, thus leading to a Pareto rank count. Vectors having a lower Pareto rank count are more likely selected for a new generation. Two individuals are chosen and combined using 1-point-crossover at a random position leading to a new individual. This novel individual is subsequently mutated at a random position. All individuals, including those from the current generation and the newly generated ones, are ranked based on their fitness, and the best individuals are selected for further evolutionary optimization, whereas the worst individuals are discarded. Thus, the number of individuals per generation is fixed (here: 600 individuals).

2.4. Scoring Functions

Secondary structure predictions were carried out with GAMESSP, a secondary structure predictor based on the GAME-framework [19]. GAMESSP is a multiple-expert-based secondary structure prediction software based on the PSIPRED algorithm [20], where each expert represents an independent artificial neural network. We used a basic secondary structure alphabet, namely, alpha-helix, beta-sheet and loop. GAMESSP was modified to use a local version of the SwissProt Database [21] due to performance purposes. As GAMESSP is written in Java, it can be easily adapted. The secondary structure predictions of the query and the target protein were aligned using a local alignment algorithm [22] to achieve a fitness score.

Hydrophobicity predictions were based on a sliding window procedure with a window size of seven [23]. The generated protein sequences were then ranked by the difference of the hydrophobicity integrals with function defined by the hydrophobicity values of the amino acids as splines and being the length of the sequence. We used the hydrophobicity integrals instead of the single discrete values for the amino acid sequences to capture neutralizing effects of neighboring amino acids. In the same manner, the molecular weight scores were calculated using the molecular weights of the amino acids.

2.5. Modeling New Sequences

The sequences from the first Pareto frontier were modeled on the query structure using ERIS [18]. ERIS was developed to handle more than one mutation with no loss of accuracy to predict protein stability. Protein Z (Chain B of PDB file 1LP1 [16]) was used as a template. ERIS performs free energy calculations by using prerelaxation of a template. Models of each sequence were built using flexible backbones.

2.6. MD Simulations of the Protein Models

Simulations of the protein models (build with ERIS) were performed using Gromacs 4.0.7 [24]. NVT ensembles were used for simulation of 20 ns. The leap-frog algorithm was used as an integrator with a 2 fs time step. Fast Particle-Mesh Ewald electrostatics (PME) were used with a 0.9 nm cutoff and the Van-der-Waals cutoff was set to 1.4 nm. Temperature coupling was set to Nose-Hoover, the reference temperature was set to 300 K. H-bonds were constrained using the linear constraint solver (LINCS). Protein stability was assessed by analyzing RMSD and RMSF.

2.7. MD Simulations of the Protein-DNA Complex

Simulations of the protein-DNA complexes were performed using Amber 10 [25]. Protein and DNA were described with the Amber99SB force field. Protons were added using the LEAP module. Each protein-DNA complex was immersed in an octahedral box of TIP3P water molecules that extended at least 10 Å outside the complex. Simulations were performed with the pmemd module in Amber 10. The SHAKE algorithm has been used to allow for an integration time step of 2 fs. Long-range interactions were treated with PME. The nonbonded cutoff was set to 9 Å. Langevin thermostat and Berendsen barostat were used. First, water molecules and hydrogens were minimized with 100-step steepest descent followed by 100-step conjugate gradient keeping all other atoms restrained with a force constant of 100 kcal/mol Å². The solute was then minimized with 1000-step steepest descent followed by 1000-step conjugate gradient with no restraints. The system was gradually heated from 0 to 300 K over 10 ps in the NVT ensemble. 10 ns production simulation were carried out in the NPT ensemble.

2.8. Brownian Dynamics Simulations

Brownian dynamics simulations were carried out with BrownDye (http://browndye.ucsd.edu/) using the Northrup-Allison-McCammon method [26]. Protein-DNA reaction sites of the studied complexes were defined based on structural protein-DNA interactions described elsewhere [27]. Interacting atom pairs between molecules were defined as such if they formed a polar interaction at less than 4.5 Å distance. During diffusion simulations, successful association of molecules was assumed if three or more interacting atom pairs of diffusing and fixed molecules were closer than 5.5 Å. Each experiment consisted of 25.000 trajectories from which association rate constants were computed with BrownDye with a ionic strength of 0.3 mol/L.

3. Results and Discussion

We have successfully combined two independent binding sites into a given protein scaffold (PDB: 1LP1) using a genetic algorithm for sequence optimization. The fused sequence of the Z domain and MyoD was used as a start sequence (see Figure 2). Helix 3 of the Z domain (residue 42 to 57) was replaced by a DNA-binding helix of MyoD (residue 110 to 125). Amino acids essential for binding of Fc (5,9–11,13,14,28,31) and DNA (110,111,114,115,117–119,121) were conserved, while remaining positions were mutated during the optimization. The initial population consisted of randomly mutated seed sequences.

Figure 2: 1LP1: sequence of the Z domain. 1MDY: part of the sequence of MyoD. Red marked amino acids are used as part of the seed sequence. Seed: seed sequence for the optimization. The blue and magenta marked amino acids are fixed during optimization. The initial population was created by randomly mutating black marked amino acids. JW70: selected model of the optimization aligned to the seed sequence.

We simulated 1000 and 2000 generations, with each generation consisting of 600 individuals. A mutation rate of 0.01 led to a Pareto frontier of 67 and 86 individuals, respectively. Individuals were ranked using ERIS, and we carried out MD simulations of both the ten best ranked and the ten worst ranked individuals. After MD simulations, the models were aligned to the wild-type structure of the Z domain using residues 6–17 and 22–33 (Helix 1 and 2). RMSD of Helix 3 (residue 39–53) was calculated and smoothed using spline interpolation (see Figure 3).

(a)

(b)

Figure 3: RMSD plots of the best (solid line) and worst (dashed line) sequences ranked by ERIS after 1000 generation (a) and 2000 generations (b), respectively. Models after 20 ns MD simulations were aligned to the wild-type structure of the Z domain using residues 6–17 and 22–33 (Helix 1 and 2). RMSD of Helix 3 (residue 39–53) was calculated and smoothed using spline interpolation.

After 1000 generations of optimization, ERIS was able to separate low from high RMSD sequences (see Figure 3, left) very well. This is probably due to a widely spread Pareto frontier. After 2000 generations, optimization led to a narrow Pareto frontier, and thus ERIS was not able to distinguish the sequences anymore (see Figure 3, right). In addition, RMSF calculations of sequences optimized for 2000 generation showed improved stability of Helix 3 in comparison to the sequences that were optimized for 1000 generations. We then selected a model (JW70) with an all-atom RMSD of about 5 Å compared to the wild-type structure and an RMSD of about 1 Å to its starting structure, which implied a well-conserved geometry. Simulations of the seed sequence modeled on the 1LP1 structure as a negative control, showed dislocation of the three helices and thus potential negative effects to the functionality of the protein (see Figure 4).

(a)

(b)

Figure 4: (a): JW70 after 20 ns MD simulation (blue) aligned to the structure of the Z domain from 1LP1 after 10 ns MD simulation (orange). (b): model of the seed sequence after 20 ns MD simulation (purple) aligned to the Z domain from 1LP1 (orange). Helix 3, which contains the new DNA-binding site, is shown on top.

As mentioned before, four Amber simulations were performed to check the models DNA-binding abilities. Protein-DNA interactions were modeled based on the 1MDY structure. We analyzed the interactions of DNA with our optimized fusion protein (JW70) as well as the interaction of DNA with the Z domain as a negative control, the seed sequence before optimization, and the MyoD-binding helix as a positive control. Both JW70 and the positive control bound stable to the DNA over 10 ns of simulation, while the negative control diffused from the DNA. The model of the seed sequence also bound to the DNA but lost its stability and partially unfolded.

In order to further assess the relative DNA-binding ability, we performed several Brownian dynamics (BDs) simulations to estimate the relative association rate constants () of our models to the wild-type structure. As reference the wild-type protein-DNA complex (PDB: 1MDY) was used. The of the reference WT complex was estimated to be 4.66·10⁸ M⁻¹ s⁻¹. The negative control protein, the native Z-Domain, did not associate with the DNA molecule in any of the 25.000 simulations, which is feasible considering its negative net charge and the absence of a DNA-binding site. All models generated during the optimization process, including the seed model achieved protein-DNA association, however, at varying estimated rates. Table 1 summarizes the results. The most promising model JW70 showed a similar association rate relative to the WT (4.56·10⁸ M⁻¹ s⁻¹). The model seed, which was shown to retain DNA-interaction during a 10 ns MD simulation before partially unfolding, showed a reduced but still considerable of around 25% relative of that estimated for the WT. All of these proteins have net charge of +5. In order to explore the effect of the net charge on the estimated , we included three more model into the analysis. JW19, JW56, and JW15 have net charges of +3, +5, and +7, respectively. Although there seems to be a logical trend of models with higher net charge associating with the target DNA more often, none of the other tested models achieved rates similar to JW70 and the WT.

Table 1: Brownian dynamics simulation results.

model
M⁻¹ s⁻¹
net charge
rel. (WT)

WT

+5
1.000

Negative
0
−2
0.000

Seed

+5
0.251

JW15

+7
0.657

JW19

+3
0.034

JW56

+5
0.099

JW70

+5
0.978

In comparison to Gronwald et al. [4], we used a fusion protein of 56 residues instead of villin headpiece (36 residues). However, computational efficiency can be clearly compared (see Table 2). Gronwald et al. analyzed two runs of the multi-objective optimization with 15 generations, each consisting of 8 individuals. Thus, they carried out 240 MD simulations for 10 ns. The total CPU time was about of 1 year [4]. Our algorithm was able to analyze 600 individuals in 2000 generations, resulting in a total number of 1.2 million protein sequences. These huge number of sequences was analyzed in only 2 months, reflecting the high computational efficiency of our method compared to that of Gronwald et al.

Table 2: Method comparison.

method
residues
individuals
generation
sequences
CPU time

GHH [4]
36
8
15
2 · 120
1 year

current study
54
600
2000
1.2 mil
2 months

4. Conclusion

We have applied multi-objective optimization guided by directed evolution to combine the MyoD DNA-binding motif into the Z domain conserving the scaffolds structure. Simulations showed that the optimization of the sequences based on hydrophobicity, molecular weight, and secondary structure predictions improved structural stability while maintaining protein functionality. The use of simple fitness functions reduces the optimization complexity, and thus allows to optimize more individuals over more generations resulting in a better sampling of the sequence space.

Acknowledgment

This work has been supported by a Young Investigator Grand of the University of Duisburg-Essen and the Italian Ministry of Education-Investment funds for basic research, under the project ITALBIONET-Italian Network of Bioinformatics.

References

M. Surez and A. Jaramillo, “Challenges in the computational design of proteins,” Journal of the Royal Society Interface, vol. 6, supplement 4, pp. S477–S491, 2009.

P. A. Alexander, Y. He, Y. Chen, J. Orban, and P. N. Bryan, “The design and characterization of two proteins with 88% sequence identity but different structure and function,” Proceedings of the National Academy of Sciences of the United States of America, vol. 104, no. 29, pp. 11963–11968, 2007.

W. A. Koppensteiner, P. Lackner, M. Wiederstein, et al., “Characterization of novel proteins based on known protein structures,” Journal of Molecular Biology, vol. 296, no. 4, pp. 1139–1152, 2000.

W. Gronwald, T. Hohm, and D. Hoffmann, “Evolutionary Pareto-optimization of stably folding peptides,” BMC Bioinformatics, vol. 9, article 109, 2008.

M. Suarez, P. Tortosa, M. M. Garcia-Mira et al., “Using multi-objective computational design to extend protein promiscuity,” Biophysical Chemistry, vol. 147, no. 1-2, pp. 13–19, 2010.

L. Chen, A. L. Devries, and C. H. Cheng, “Convergent evolution of antifreeze glycoproteins in Antarctic notothenioid fish and Arctic cod,” Proceedings of the National Academy of Sciences of the United States of America, vol. 94, no. 8, pp. 3817–3822, 1997.

G. B. G. Moorhead, V. De Wever, G. Templeton, et al., “Evolution of protein phosphatases in plants and animals,” Biochemical Journal, vol. 417, no. 2, pp. 401–409, 2009.

S. Schilling, C. Wasternack, and H. U. Demuth, “Glutaminyl cyclases from animals and plants: a case of functionally convergent protein evolution,” Biological Chemistry, vol. 389, no. 8, pp. 983–991, 2008.

C. J. McKnight, D. S. Doering, P. T. Matsudaira, and P. S. Kim, “A thermostable 35-residue subdomain within villin headpiece,” Journal of Molecular Biology, vol. 260, no. 2, pp. 126–134, 1996.

S. A. K. Ong, H. H. Lin, Y. Z. Chen, et al., “Efficacy of different protein descriptors in predicting protein functional families,” BMC Bioinformatics, vol. 8, article 300, 2007.

D. Heider, J. Appelmann, T. Bayro et al., “A computational approach for the identification of small GTpases based on preprocessed amino acid sequences,” Technology in Cancer Research and Treatment, vol. 8, no. 5, pp. 333–341, 2009.

D. Heider, S. Hauke, M. Pyka, et al., “Insights into the classification of small GTPases,” Advances and Applications in Bioinformatics and Chemistry, vol. 3, pp. 15–24, 2010.

J. N. Dybowski, D. Heider, and D. Hoffmann, “Prediction of co-receptor usage of HIV-1 from genotype,” PLoS Computational Biology, vol. 6, no. 4, Article ID e1000743, 2010.

D. Heider, J. Verheyen, and D. Hoffmann, “Predicting Bevirimat resistance of HIV-1 from genotype,” BMC Bioinformatics, vol. 11, article 37, 2010.

M. Graille, E. A. Stura, A. L. Corper et al., “Crystal structure of a Staphylococcus aureus protein A domain complexed with the Fab fragment of a human IgM antibody: Structural basis for recognition of B-cell receptors and superantigen activity,” Proceedings of the National Academy of Sciences of the United States of America, vol. 97, no. 10, pp. 5399–5404, 2000.

M. Högbom, M. Eklund, P. Nygren, et al., “Structural basis for recognition by an in vitro evolved affibody,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 6, pp. 3191–3196, 2003.

P. C. Ma, M. A. Rould, H. Weintraub, et al., “Crystal structure of MyoD bHLH domain-DNA complex: perspectives on DNA recognition and implications for transcriptional activation,” Cell, vol. 77, no. 3, pp. 451–459, 1994.

S. Yin, F. Ding, and N. V. Dokholyan, “Modeling backbone exibility improves protein stability estimation,” Structure, vol. 15, no. 12, pp. 1567–1576, 2007.

G. Armano, F. Ledda, and E. Vargiu, “Sum-linear blosum: a novel protein encoding method for secondary structure prediction,” Communications of SIWN, vol. 6, pp. 71–77, 2009.

D. T. Jones, “Protein secondary structure prediction based on position-specific scoring matrices,” Journal of Molecular Biology, vol. 292, no. 2, pp. 195–202, 1999.

The UniProt Consortium, “The universal protein resource (UniProt) in 2010,” Nucleic Acids Research, vol. 38, pp. D142–D148, 2010.

T. F. Smith and M. S. Waterman, “Identification of common molecular subsequences,” Journal of Molecular Biology, vol. 147, no. 1, pp. 195–197, 1981.

J. Kyte and R. F. Doolittle, “A simple method for displaying the hydropathic character of a protein,” Journal of Molecular Biology, vol. 157, no. 1, pp. 105–132, 1982.

B. Hess, C. Kutzner, D. van der Spoel, et al., “GRGMACS 4: algorithms for highly efficient, load-balanced, and scalable molecular simulation,” Journal of Chemical Theory and Computation, vol. 4, no. 3, pp. 435–447, 2008.

D. A. Case, T. A. Darden, T. E. Cheatham, et al., AMBER 10, University of California, San Francisco, Calif, USA, 2008.

S. H. Northrup, S. A. Allison, and J. A. McCammon, “Brownian dynamics simulation of diffusion-influenced bimolecular reactions,” The Journal of Chemical Physics, vol. 80, no. 4, pp. 1517–1524, 1984.

N. M. Luscombe, R. A. Laskowski, and J. M. Thornton, “Amino acid-base interactions: a three-dimensional analysis of protein-DNA interactions at an atomic level,” Nucleic Acids Research, vol. 29, no. 13, pp. 2860–2874, 2001.