![]() | ![]() |
Formats:
|
||||||||||||||||||
Copyright © 2006 by The National Academy of Sciences of the USA Biophysics Physically realistic homology models built with rosetta can be more accurate than their templates Department of Biochemistry, University of Washington, Box 357350, J-567 Health Sciences, Seattle, WA 98195-7350 §To whom correspondence should be addressed. E-mail: dabaker/at/u.washington.edu Edited by Stephen L. Mayo, California Institute of Technology, Pasadena, CA, and approved February 3, 2006 †Present address: Physical Biosciences Division, Lawrence Berkeley National Laboratory, 1 Cyclotron Road, MS 977-152, Berkeley, CA 94720. ‡Present address: Rosetta Inpharmatics, 401 Terry Avenue North, Seattle, WA 98109. Author contributions: K.M.S.M., D.C., and D.B. designed research; K.M.S.M. performed research; K.M.S.M., D.C., C.A.R., D.E.K., and D.B. contributed new reagents/analytic tools; K.M.S.M. and D.B. analyzed data; and K.M.S.M. and D.B. wrote the paper. Received October 26, 2005. This article has been cited by other articles in PMC.Abstract We have developed a method that combines the rosetta de novo protein folding and refinement protocol with distance constraints derived from homologous structures to build homology models that are frequently more accurate than their templates. We test this method by building complete-chain models for a benchmark set of 22 proteins, each with 1 or 2 candidate templates, for a total of 39 test cases. We use structure-based and sequence-based alignments for each of the test cases. All atoms, including hydrogens, are represented explicitly. The resulting models contain approximately the same number of atomic overlaps as experimentally determined crystal structures and maintain good stereochemistry. The most accurate models can be identified by their energies, and in 22 of 39 cases a model that is more accurate than the template over aligned regions is one of the 10 lowest-energy models. Keywords: fragment assembly, structure prediction Building accurate 3D structural models for protein sequences of unknown structure is a challenging, unsolved problem in contemporary biology, and its solution would provide insight into a broad range of biological systems. Large-scale genomic sequencing efforts are providing increasing numbers of sequences, but the number of experimentally determined structures remains small by comparison. The goal of homology modeling methods is to match these query sequences with known template structures and construct accurate 3D models of the proteins. This task involves four steps: identifying suitable templates, aligning the query sequence to the templates, building the model for the query sequence by using information from the templates, and evaluating the models. Several methods are available to perform these steps and appear to perform similarly when used optimally (see refs. 1 and 2 for a description of several current methods). Although these methods have been useful, in most cases the final model is not more structurally similar to the query structure than the parent template (3, 4). In addition, many homology-modeling methods introduce physically unrealistic properties into the models in efforts to substitute the query sequence onto a nonnative backbone (2). The fixed backbone of the template is not always able to accommodate the side chains of the query sequence, particularly at buried positions, resulting in poor stereochemistry or atomic overlaps. Although the overall topology of the query structure can be derived from its homologs assuming a reasonably confident alignment, the atomic details of a homology model are of equal interest. Accurate modeling of side-chain and loop conformations is necessary in modeling and manipulating small molecule interactions, protein–protein and protein–nucleic acid interactions, and protein function. A useful homology model is one that can provide more information about a protein of interest than any homologous structures. The positions of the query sequence that are aligned to a template can be modeled by simply copying coordinates for the backbone atoms or by using this information to generate spatial restraints, but modeling unaligned regions requires different tactics. Reliably modeling loops and unaligned regions is a challenge, and many current homology-modeling protocols do not build coordinates for all of the residues in every sequence. To date it has not been demonstrated that homology models can be built that are consistently more accurate over backbone and side-chain atoms than their templates, physically realistic according to a structure validating programs such as procheck (5), whatcheck (6), or molprobity (7), and model all residues in the query sequence with all atoms explicitly represented. Our goal in this research was to meet these challenges. rosetta builds models of protein structures by inserting small fragments derived from the structures in the Protein Data Bank (PDB) into an initially unstructured chain (8, 9). We modified the rosetta ab initio folding protocol (8–10) to incorporate interatomic distance information from homologous structures and applied the revised protocol to a test set of query sequences. We compared models generated with this method to models generated with a fixed template method, rosetta Structurally Variable Region (rosettasvr) modeling (11, 12). To assess the accuracy of side-chain modeling, we compared the rosetta models folded with constraints to those generated with modeller (13). Our method preserves chain connectivity throughout the simulation, strictly enforces the steric properties of experimentally determined protein structures thereby ensuring physically plausible models, and unaligned regions of any length or conformation can be modeled by using the relatively successful rosetta fragment insertion method. Results It is generally accepted that the most important component of homology modeling is the choice of the template structure and initial alignment of the query sequence to that template (4, 14). To decouple the sequence-alignment task from the coordinate modeling process, we used structure–structure alignments derived from 3dpair (15) to first test our methods. We also used standard sequence-based alignments derived from psi-blast (16) to test the sensitivity of our method to incomplete coverage and minor sequence-alignment errors. We chose our test set of query–template pairs to be in a sequence similarity range detectable with psi-blast, so the template and query structure adopt the same topology, and sequence-alignment errors are minor but the structural differences are still significant. Near-Native Homology Models Can Be Selected by Energy. The method we have developed, rosetta folding with constraints, uses a low-resolution search with side chains approximated with centroids followed by a high-resolution search with all atoms, including hydrogens, represented explicitly. Thousands of trajectories are required to adequately sample conformational space, and a diverse population of models is generated that satisfy the constraint set and energy function to varying degrees. In both the low- and high-resolution populations, models with low rms deviation (rmsd) to the native structure can be selected based on their energies (Fig. 1
The population of full-atom refined models (Fig. 1 Folding with Constraints Produces Physically Realistic Complete-Chain Models. The final all-atom models were analyzed for atomic clashes by using the program molprobity (7), and the results were compared with those obtained for the native query structures, the template-based model generated by using rosettasvr modeling (12), and the model built with modeller (13). Only aligned regions were included in the calculation. The models folded with constraints have considerably fewer numbers of atomic clashes than models generated by using modeller or rosettasvr modeling (≈10% of the total modeller clashes and ≈20% of total fixed-template model clashes) and on average contain approximately the same number as native crystal structures (Fig. 2
Folding with Constraints Produces Homology Models Closer to the Native Structure than Their Parent Templates. We used structure–structure alignments generated with the program 3dpair for each query–template pair to examine the success of the protocol in the absence of alignment errors. This method is a direct test of our sampling strategy and energy function and provides an upper-limit estimate of how well the method can perform; decreases in the rmsd correspond directly to improvements to the model and cannot be simply due to improving the alignment. We selected the lowest-energy model and the low-energy* model produced by folding with constraints and compared their rmsd values with the rosettasvr template-based model over aligned regions as well as over the complete chain. The low-energy* model was frequently more accurate than the template-based model over the aligned regions as well as over the complete chain. For the aligned regions, the rmsd was lower than the template-based model in 22 cases, unchanged in 2 cases, and worse in 15 cases. For the complete chain, the rmsd was lower than the template-based model in 29 cases, unchanged in 7 cases, and worse in 3 cases (Fig. 3
The results for the low-energy model are similar for the complete chain models, where 22 cases show improvement over the template-based model, 3 are unchanged, and 14 are worse. However, the low-energy models are more frequently worse than the template-based model over the aligned regions; 13 are better, 5 are unchanged, and 21 are worse. To see whether we could detect more accurate models, we clustered the full-atom refined populations and compared the models at the centers of the largest cluster and largest cluster* (defined as the lowest rmsd cluster center model out of the largest 5 clusters) to the template-based model. The cluster center of the largest cluster is more accurate than the template more frequently than the lowest-energy model, but the cluster center of the top cluster* is not more accurate than the lowest-energy* model most of the time (Fig. 3 The low-rmsd models are significantly more accurate than those selected by energy; in 29 cases the low-rmsd model had a lower rmsd value than the template-based model, and in 10 cases the rmsd was higher. For the complete chain, in 34 cases the low-rmsd model had a lower rmsd value than the template-based model; in 1 case the value was unchanged, and in 4 cases the rmsd was higher. We conclude that folding with constraints can produce more accurate backbone scaffolds but that increased sampling is required to find the precise conformation that will allow for native-like side-chain packing. We also used alignments generated with psi-blast (16) to examine the more realistic case where the alignment is often incomplete or contains errors. As observed for the structure-based alignments, the final low-energy* model is usually more accurate than the template over aligned regions (22 better, 2 unchanged, and 8 worse) as well as over the entire chain (29 are better and 3 are worse) (Fig. 3 Models Produced by Folding with Constraints Have Reasonably Accurate Side-Chain Conformations. For many applications, accurate prediction of side-chain conformations is important. In addition, the success of our method and the reliability of the energy function to discriminate near-native models depend on accurate side-chain placement, especially in the hydrophobic core. We compared the side-chain conformations over aligned regions of the low-energy and the low-energy* models with the side-chain conformations of models generated by rosettasvr and modeller. First, we computed the absolute difference between the χ1 angle for each residue in the models with the corresponding χ1 angle in the native structures. Then, we classified the side-chain positions as either buried or exposed and grouped the counts into bins of 10°. A side chain was considered buried if >20 Cβ atoms were found within a 10-Å radius of its Cβ atom. The χ2 angle differences were measured and included in the analysis only if the χ1 value of the same residue differed from the native by an absolute value of <15°. For buried side chains, the models folded with constraints more accurately describe the native side-chain conformations than the modeller models in all angle bins for χ1 and χ2 angles (Fig. 4
Low-Energy Models Disproportionately Violate Incorrect Constraints. Homology-modeling programs using spatial restraints such as the one presented here rely heavily on the accuracy of the constraints. However, because the query structure is not identical to its homologs, some of the constraints derived from the homologs may be violated in the native structure. Therefore, the most accurate homology models should violate the constraint set to a certain extent. We analyzed the lowest 10 energy models for each query–parent pair in our test set and compared the constraint violations with those found in the native structure. In most cases, the percent of correct constraints (defined as constraints satisfied in the native structure) that were violated in the final models was less than the percent incorrect constraints (defined as constraints violated in the native structure) that were violated in the final models (average values of 16.5% of incorrect constraints violated and 2.5% of correct constraints violated over the test set; see Supporting Text, which is published as supporting information on the PNAS web site). Thus, the stiffness of our physical model, with stringent treatment of sterics, makes it robust to spurious forces arising from incorrect constraints. The considerable added information from the energy function makes the method less sensitive to the choice of template. Although the lowest-energy models are more frequently worse than their templates over the aligned regions, the energy function allows the generation of some models that are better than the starting template. Successful Examples. The Crk SH3 domain (PDB ID code 1b07) structure consists of strands and short connecting loops. The backbones of the template-based model and the low-energy* model folded with constraints derived from the homologous 2sem structure overlay closely with the 1b07 structure. However, two aligned regions show differences (Fig. 5
For the Pike parvalbumin α-component (PDB ID code 1pva) example, the most significant difference between the native structure and the models folded with constraints is the 38-residue unaligned region at the N terminus of the 1pva sequence. Both the model folded with constraints and the fixed template model with loops built with rosetta predict two helices and a short loop for this unaligned region, but the extension closely resembles the native structure in the model folded with constraints, whereas in the rosettasvr template-based model the orientations and locations of the helices are incorrect (Fig. 5 Effect of Increased Conformational Space Sampling on the 1pva-1ahr Test Case. As discussed above, we believe that many independent trajectories are required to finely sample conformational space around the native structure such that the details of the native backbone and the native side-chain packing arrangement can be found. To test this hypothesis, we used the distributed computing software boinc (19) on the 1pva example because it showed a promising correlation of energy with rmsd but was not an easy target because of the long unaligned region and features in the aligned region that differed from the 1ahr template. We were able to run thousands of simulations each day, and the population of 54,267 full-atom models contained 43 models with <1.5 Å rmsd (compared with 6 produced using our in-house computing clusters). Even with thousands of trajectories, the space near the native is still under-sampled and the lowest energy models do not correspond to the most accurate models (Fig. 6
Thus, although the low-rmsd models are not sufficiently similar to the native structure to have as low energies, they can be detected based on their close proximity to one another. This finding is reminiscent of the ability of clustering to select native-like models out of populations of low-resolution models (20), but here the selection is based on finer details such as an irregular helix rather than overall topology. It is at first surprising that several of the models that incorporate the bent helix are found in a tight cluster, because only 3.5% of the population used for clustering contained this feature. However, as shown in Fig. 6 Discussion We have developed a method to build homology models of protein sequences of unknown structure using rosetta fragment insertion combined with distance constraints derived from homologous structures. Coordinates are built for all residues in the query sequence, regardless of whether they were aligned to a template or not, or are in regular secondary-structure elements or flexible loops. Although the resulting lowest-energy models are frequently less accurate than their templates over aligned regions, at least 1 of the 10 lowest-energy models is frequently more accurate than the template from which they were derived. In addition, the models are physically reasonable; they contain the same number or fewer atomic overlaps than native crystal structures and by construction have ideal bond lengths and angles. It has been found that models may sometimes be numerically evaluated incorrectly as being more native-like by virtue of overlaps (21), an error we wished to avoid in determining whether our method truly accomplishes structural improvement. As such, we are encouraged by the lack of atomic overlaps demonstrated by our low-rmsd models. In the course of this study, we used distance constraints derived from a single template applied to a single query sequence. It is possible that incorporating constraints from multiple templates, as modeller (13) does, will improve the results and extend the method to more remote sequence–structure pairs. Constraints derived from experimental information also could be easily incorporated. In addition, it may be possible to refine and discriminate among candidate alignments by generating populations of models for each alignment and comparing their energies. The method presented here is an improvement over current methods in the range of sequence identity, protein size, and alignment coverage tested here, but it has some limitations. The computational cost is large, especially when compared with other homology modeling programs such as modeller. The method is currently less successful for proteins with high contact order, and the simulations require even more computational time for these cases. Although the method is comparable with fixed-template-based methods for the very largest proteins we tested, a 255-residue TIM barrel (1aw2) and a 245-residue two-domain ATPase (1d2n), these cases will likely require additional sampling because the near-native space was not well populated (see Fig. 7). The size of the conformational space a polypeptide chain can occupy is vast, even for small proteins when an initial low-resolution model is structurally similar to the native conformation. In addition to the increased degrees of freedom, searching this space becomes more difficult with higher resolution because of increased steric constraints. Slight differences in the backbone conformation may accommodate entirely different combinations of side-chain conformations, leading to a very rough energy landscape. Irregular features such as the 1pva broken helix add to the complexity of the search problem, because they are essential to locating the native minimum but may be rare in model populations. Distributed computing resources provide a powerful tool in which to navigate this space and potentially populate the region near native conformation with enough backbone scaffolds such that the native side-chain conformations can be accommodated. Methods The data set, generation of sequence alignments, and the full-atom refinement protocol are described in Supporting Text. Distance Constraint Generation. Interatomic distances between β-carbon atoms were calculated for each template structure. For each pair of atoms whose distance d < 10 Å in the template structure a constraint was derived with a lower bound (l) of d − 1.5 Å and an upper bound (u) of d + 2.0 Å. To generate a set of constraints as consistent as possible with the query structure, the initial set of constraints was combined with the rosetta ab initio protocol by penalizing pairwise distances that deviated from the bounds and used to generate 1,000 initial low-resolution models. These initial models were then analyzed to determine how many times each distance constraint was violated. The constraints that were violated more often than (0.5 × max) times, where max equals the maximum number of times any one constraint was violated, were removed, and the low-resolution folding protocol was repeated. This procedure reduced the number of violations of the native query structure with the initial constraint data set by 36.1% on average, compared with 14.0% if the same number of constraints were randomly removed from the complete constraint set (see Table 1, which is published as supporting information on the PNAS web site). Folding Protocol. Initial models were folded by using the rosetta fragment insertion protocol (8–10) with side chains represented by centroids. Custom fragment libraries were constructed for each query–template pair by first generating fragments from structures of homologous proteins with sequence identities less than or equal to the test query–template pair. These fragments then were added to a standard set of fragments from a set of nonredundant PDB structures, where the sequences of the structures are <60% identical to any other sequence in the set. A fragment screening protocol modified from Rohl et al. (8) was used to maximize the satisfaction of the constraints. After a position was randomly selected for insertion, the candidate fragments for that site were evaluated for the effect that they would have on the constraints violation score after insertion. The net rotation and offset of each fragment was determined and applied to one of the atoms for each constrained pair of atoms by using the methods described for wobble moves in ref. 8. A constraint satisfaction score was computed for each candidate fragment, cs = Σmax(0, ((dij2) − (rij2))), where dij is the distance between the two atoms defining the constraint and uij is the upper distance bound, which is taken to be the distance between the same two atoms in the template structure. The sum is over the subset of constraints for which the distance between the constrained atoms would be affected by the insertion (e.g., pairs in which atoms i and j are on opposite sides of the insertion point). A fragment was then randomly selected from among those fragments for which cs ≤ (rs*tolerance), where the reference score rs was calculated as for cs but for the structure before the insertion. The value of tolerance alternates between 2.0 or 5.0. If no fragments meeting these criteria were found, a fragment insertion at the N-terminally adjacent site was tried. If an insertion site was selected that did not affect the distance between any constrained atom pairs, 1 of the top 25 fragments for this site was selected at random from the fragment library, as in the standard rosetta de novo structure prediction protocol (8, 9). The conformation of the model after each fragment insertion then was evaluated with the rosetta low-resolution energy function (8) in combination with the distance constraint data. A penalty was applied to residues with interatomic distances dij that were outside the allowed range described above. Small and large distance violations were penalized by using quadratic and linear functional forms, respectively, according to the following:
The method described above plus two variations designed to improve and increase the diversity of the low-resolution population were used to generate low-resolution models. The first variation used a fragment library that had been enriched with fragments of high local sequence identity to the query sequence in addition to the homologous fragments described above. For the second variation, an initial population of structures was generated by using the method described above, and the variance in and ψ in the population was computed for each residue in the lowest 10% energy models. For residues where the mean square deviation was >40°, the –ψ distributions were clustered. The –ψ distributions in the cluster centers observed at high frequencies then were preferentially resampled in a large-scale run. At the beginning of each run, for each stretch of five or fewer consecutive “variable” positions, a single residue and a corresponding cluster center were selected at random, and only fragments with deviation < 40° in and ψ of the selected cluster center were allowed for insertion. In a number of cases, this procedure produced a population of low-scoring structures with lower rmsds than in the starting population (data not shown). A total of 10,000 models using each method were generated for each query–template pair with 3dpair alignments, but because of limited computer time only 1,000 were made for each query–template pair with psi-blast alignments. Their energies were ranked by using the standard rosetta centroid energy function plus the constraint energy, and the lowest 15% of the population from each of the three methods was subjected to full-atom refinement.Final Model Selection. Following the refinement protocol, the refined models from each of the three folding protocols were combined and ranked according to energy. We used the energy function described in ref. 17 combined with the constraint energy described above. We selected three types of models for analysis: the lowest-energy model, the lowest-rmsd model, and the lowest-rmsd model out of the lowest 10 energy models (referred to as lowest-energy*). The rmsd was calculated over all Cα atoms. Cluster analysis was carried out as described in ref. 22, by using a clustering threshold of between 1 and 3 Å. Generation of Complete Chain Models with modeller and Fixed-Template rosettasvr Modeling. We generated one model for each query sequence by using the rosettasvr modeling protocol (12). The modeller model used for analysis was the best-scoring model, using the modeller score, out of 100 models produced initially. The same alignments were used as for the folding protocol. Atomic Clash Score Analysis Calculation. Atomic clashes for native structures, rosetta models produced by folding with constraints, models produced with the rosettasvr fixed-template method (12), or models produced with modeller (13) were calculated by using molprobity (7). Before calculating clashes, hydrogen atoms were optimized and added according to suggestions from the “Reduce” utility incorporated with molprobity. Clashes were calculated over aligned regions only. An atomic clash was counted if the distance between atoms 1 and 2 is less than [(r1 + r2)/2] − 0.4 Å where r1 and r2 are the radii in Å of atoms 1 and 2, respectively. Model Generation Using boinc Distributed Computing. Each boinc (19) client in the Rosetta@Home project (http://boinc.bakerlab.org) generated 10 low-resolution models with the rosetta fragment insertion protocol and refined the two lowest-energy models by using the full-atom refinement protocol. The community that participated in this project produced 265,000 low-resolution models and 53,000 full-atom models with constraint information for the 1pva-1ahr test case. Supporting Information
Acknowledgments We thank members of the D.B. laboratory for helpful advice and discussion, Keith Laidig for expert management of computational resources, and the ≈3,000 participants in the boinc distributed computing project who generously donated CPU cycles to the experiment. The participants who produced models belonging to the low-energy and low-rmsd clusters analyzed in this work are listed in Supporting Text. K.M.S.M. was supported by the Helen Hay Whitney Foundation. K.M.S.M. and D.B. are supported by the Howard Hughes Medical Institute. Footnotes Conflict of interest statement: No conflicts declared. This paper was submitted directly (Track II) to the PNAS office. References 1. Marti-Renom M. A., Stuart A. C., Fiser A., Sanchez R., Melo F., Sali A. Annu. Rev. Biophys. Biomol. Struct. 2000;29:291–325. [PubMed] 2. Wallner B., Elofsson A. Protein Sci. 2005;14:1315–1327. [PubMed] 3. Tramontano A., Leplae R., Morea V. Proteins. 2001;(Suppl. 5):22–38. [PubMed] 4. Tramontano A., Morea V. Proteins. 2003;53(Suppl. 6):352–368. [PubMed] 5. Laskowski R. A., MacArthur M. W., Moss D. S., Thornton J. M. J. Appl. Cryst. 1993;26:291–294. 6. Hooft R. W., Vriend G., Sander C., Abola E. E. Nature. 1996;381:272. [PubMed] 7. Lovell S. C., Davis I. W., Arendall W. B., III, de Bakker P. I., Word J. M., Prisant M. G., Richardson J. S., Richardson D. C. Proteins. 2003;50:437–450. [PubMed] 8. Rohl C. A., Strauss C. E., Misura K. M., Baker D. Methods Enzymol. 2004;383:66–93. [PubMed] 9. Simons K. T., Kooperberg C., Huang E., Baker D. J. Mol. Biol. 1997;268:209–225. [PubMed] 10. Simons K. T., Ruczinski I., Kooperberg C., Fox B. A., Bystroff C., Baker D. Proteins. 1999;34:82–95. [PubMed] 11. Chivian D., Kim D. E., Malmstrom L., Bradley P., Robertson T., Murphy P., Strauss C. E., Bonneau R., Rohl C. A., Baker D. Proteins. 2003;53(Suppl. 6):524–533. [PubMed] 12. Rohl C. A., Strauss C. E., Chivian D., Baker D. Proteins. 2004;55:656–677. [PubMed] 13. Fiser A., Sali A. Methods Enzymol. 2003;374:461–491. [PubMed] 14. Chothia C., Lesk A. M. EMBO J. 1986;5:823–826. [PubMed] 15. Plewczynski D., Pas J., Von Grotthuss M., Rychlewski L. Acta Biochim. Polonica. 2004;51:161–172. 16. Altschul S. F., Madden T. L., Schaffer A. A., Zhang J., Zhang Z., Miller W., Lipman D. J. Nucleic Acids Res. 1997;25:3389–3402. [PubMed] 17. Misura K. M., Baker D. Proteins. 2005;59:15–29. [PubMed] 18. Bradley P., Misura K. M., Baker D. Science. 2005;309:1868–1871. [PubMed] 19. Anderson D. P. Berkeley, CA: University of California; 2005. Berkeley Open Infrastructure for Network Computing (boinc). 20. Shortle D., Simons K. T., Baker D. Proc. Natl. Acad. Sci. USA. 1998;95:11158–11162. [PubMed] 21. Kinch L. N., Wrabl J. O., Krishna S. S., Majumdar I., Sadreyev R. I., Qi Y., Pei J., Cheng H., Grishin N. V. Proteins. 2003;53(Suppl. 6):395–409. [PubMed] 22. Bonneau R., Strauss C. E. M., Baker D. Proteins Struct. Funct. Genet. 2001;43:1–11. [PubMed] 23. DeLano W. L. The pymol Molecular Graphics System. San Carlos, CA: DeLano Scientific; 2002. |
PubMed related articles
Your browsing activity is empty. Activity recording is turned off. |
|||||||||||||||||
Annu Rev Biophys Biomol Struct. 2000; 29():291-325.
[Annu Rev Biophys Biomol Struct. 2000]Protein Sci. 2005 May; 14(5):1315-27.
[Protein Sci. 2005]Proteins. 2001; Suppl 5():22-38.
[Proteins. 2001]Proteins. 2003; 53 Suppl 6():352-68.
[Proteins. 2003]Nature. 1996 May 23; 381(6580):272.
[Nature. 1996]Proteins. 2003 Feb 15; 50(3):437-50.
[Proteins. 2003]Methods Enzymol. 2004; 383():66-93.
[Methods Enzymol. 2004]J Mol Biol. 1997 Apr 25; 268(1):209-25.
[J Mol Biol. 1997]Proteins. 1999 Jan 1; 34(1):82-95.
[Proteins. 1999]Proteins. 2003; 53 Suppl 6():524-33.
[Proteins. 2003]Proteins. 2004 May 15; 55(3):656-77.
[Proteins. 2004]Proteins. 2003; 53 Suppl 6():352-68.
[Proteins. 2003]EMBO J. 1986 Apr; 5(4):823-6.
[EMBO J. 1986]Nucleic Acids Res. 1997 Sep 1; 25(17):3389-402.
[Nucleic Acids Res. 1997]Proteins. 2005 Apr 1; 59(1):15-29.
[Proteins. 2005]Science. 2005 Sep 16; 309(5742):1868-71.
[Science. 2005]Proteins. 2003 Feb 15; 50(3):437-50.
[Proteins. 2003]Proteins. 2004 May 15; 55(3):656-77.
[Proteins. 2004]Methods Enzymol. 2003; 374():461-91.
[Methods Enzymol. 2003]Nucleic Acids Res. 1997 Sep 1; 25(17):3389-402.
[Nucleic Acids Res. 1997]Proc Natl Acad Sci U S A. 1998 Sep 15; 95(19):11158-62.
[Proc Natl Acad Sci U S A. 1998]Proteins. 2003; 53 Suppl 6():395-409.
[Proteins. 2003]Methods Enzymol. 2003; 374():461-91.
[Methods Enzymol. 2003]Methods Enzymol. 2004; 383():66-93.
[Methods Enzymol. 2004]J Mol Biol. 1997 Apr 25; 268(1):209-25.
[J Mol Biol. 1997]Proteins. 1999 Jan 1; 34(1):82-95.
[Proteins. 1999]Methods Enzymol. 2004; 383():66-93.
[Methods Enzymol. 2004]J Mol Biol. 1997 Apr 25; 268(1):209-25.
[J Mol Biol. 1997]Methods Enzymol. 2004; 383():66-93.
[Methods Enzymol. 2004]Proteins. 2005 Apr 1; 59(1):15-29.
[Proteins. 2005]Proteins. 2001 Apr 1; 43(1):1-11.
[Proteins. 2001]Proteins. 2004 May 15; 55(3):656-77.
[Proteins. 2004]Proteins. 2004 May 15; 55(3):656-77.
[Proteins. 2004]Methods Enzymol. 2003; 374():461-91.
[Methods Enzymol. 2003]Proteins. 2003 Feb 15; 50(3):437-50.
[Proteins. 2003]Proteins. 2005 Apr 1; 59(1):15-29.
[Proteins. 2005]Proteins. 2005 Apr 1; 59(1):15-29.
[Proteins. 2005]