Homology model of the DHRS7B protein created with Swiss-model and rendered with PyMOL

Homology modeling, also known as comparative modeling of protein, refers to constructing an atomic-resolution model of the "target" protein from its amino acid sequence and an experimental three-dimensional structure of a related homologous protein (the "template"). Homology modeling relies on the identification of one or more known protein structures likely to resemble the structure of the query sequence, and on the production of an alignment that maps residues in the query sequence to residues in the template sequence. It has been seen that protein structures are more conserved than protein sequences amongst homologues, but sequences falling below a 20% sequence identity can have very different structure.[1]

Evolutionarily related proteins have similar sequences and naturally occurring homologous proteins have similar protein structure. It has been shown that three-dimensional protein structure is evolutionarily more conserved than would be expected on the basis of sequence conservation alone.[2]

The sequence alignment and template structure are then used to produce a structural model of the target. Because protein structures are more conserved than DNA sequences, and detectable levels of sequence similarity usually imply significant structural similarity.[3]

The quality of the homology model is dependent on the quality of the sequence alignment and template structure. The approach can be complicated by the presence of alignment gaps (commonly called indels) that indicate a structural region present in the target but not in the template, and by structure gaps in the template that arise from poor resolution in the experimental procedure (usually X-ray crystallography) used to solve the structure. Model quality declines with decreasing sequence identity; a typical model has ~1–2 Å root mean square deviation between the matched Cα atoms at 70% sequence identity but only 2–4 Å agreement at 25% sequence identity. However, the errors are significantly higher in the loop regions, where the amino acid sequences of the target and template proteins may be completely different.

Regions of the model that were constructed without a template, usually by loop modeling, are generally much less accurate than the rest of the model. Errors in side chain packing and position also increase with decreasing identity, and variations in these packing configurations have been suggested as a major reason for poor model quality at low identity.[4] Taken together, these various atomic-position errors are significant and impede the use of homology models for purposes that require atomic-resolution data, such as drug design and protein–protein interaction predictions; even the quaternary structure of a protein may be difficult to predict from homology models of its subunit(s). Nevertheless, homology models can be useful in reaching qualitative conclusions about the biochemistry of the query sequence, especially in formulating hypotheses about why certain residues are conserved, which may in turn lead to experiments to test those hypotheses. For example, the spatial arrangement of conserved residues may suggest whether a particular residue is conserved to stabilize the folding, to participate in binding some small molecule, or to foster association with another protein or nucleic acid.

Homology modeling can produce high-quality structural models when the target and template are closely related, which has inspired the formation of a structural genomics consortium dedicated to the production of representative experimental structures for all classes of protein folds. [5] The chief inaccuracies in homology modeling, which worsen with lower sequence identity, derive from errors in the initial sequence alignment and from improper template selection.[6] Like other methods of structure prediction, current practice in homology modeling is assessed in a biennial large-scale experiment known as the Critical Assessment of Techniques for Protein Structure Prediction, or CASP.

Motive

The method of homology modeling is based on the observation that protein tertiary structure is better conserved than amino acid sequence.[3] Thus, even proteins that have diverged appreciably in sequence but still share detectable similarity will also share common structural properties, particularly the overall fold. Because it is difficult and time-consuming to obtain experimental structures from methods such as X-ray crystallography and protein NMR for every protein of interest, homology modeling can provide useful structural models for generating hypotheses about a protein's function and directing further experimental work.

There are exceptions to the general rule that proteins sharing significant sequence identity will share a fold. For example, a judiciously chosen set of mutations of less than 50% of a protein can cause the protein to adopt a completely different fold.[7][8] However, such a massive structural rearrangement is unlikely to occur in evolution, especially since the protein is usually under the constraint that it must fold properly and carry out its function in the cell. Consequently, the roughly folded structure of a protein (its "topology") is conserved longer than its amino-acid sequence and much longer than the corresponding DNA sequence; in other words, two proteins may share a similar fold even if their evolutionary relationship is so distant that it cannot be discerned reliably. For comparison, the function of a protein is conserved much less than the protein sequence, since relatively few changes in amino-acid sequence are required to take on a related function.

Steps in model production

The homology modeling procedure can be broken down into four sequential steps: template selection, target-template alignment, model construction, and model assessment.[3] The first two steps are often essentially performed together, as the most common methods of identifying templates rely on the production of sequence alignments; however, these alignments may not be of sufficient quality because database search techniques prioritize speed over alignment quality. These processes can be performed iteratively to improve the quality of the final model, although quality assessments that are not dependent on the true target structure are still under development.

Optimizing the speed and accuracy of these steps for use in large-scale automated structure prediction is a key component of structural genomics initiatives, partly because the resulting volume of data will be too large to process manually and partly because the goal of structural genomics requires providing models of reasonable quality to researchers who are not themselves structure prediction experts.[3]

Template selection and sequence alignment

The critical first step in homology modeling is the identification of the best template structure, if indeed any are available. The simplest method of template identification relies on serial pairwise sequence alignments aided by database search techniques such as FASTA and BLAST. More sensitive methods based on multiple sequence alignment – of which PSI-BLAST is the most common example – iteratively update their position-specific scoring matrix to successively identify more distantly related homologs. This family of methods has been shown to produce a larger number of potential templates and to identify better templates for sequences that have only distant relationships to any solved structure. Protein threading,[9] also known as fold recognition or 3D-1D alignment, can also be used as a search technique for identifying templates to be used in traditional homology modeling methods.[3] Recent CASP experiments indicate that some protein threading methods such as RaptorX indeed are more sensitive than purely sequence(profile)-based methods when only distantly-related templates are available for the proteins under prediction. When performing a BLAST search, a reliable first approach is to identify hits with a sufficiently low E-value, which are considered sufficiently close in evolution to make a reliable homology model. Other factors may tip the balance in marginal cases; for example, the template may have a function similar to that of the query sequence, or it may belong to a homologous operon. However, a template with a poor E-value should generally not be chosen, even if it is the only one available, since it may well have a wrong structure, leading to the production of a misguided model. A better approach is to submit the primary sequence to fold-recognition servers[9] or, better still, consensus meta-servers which improve upon individual fold-recognition servers by identifying similarities (consensus) among independent predictions.

Often several candidate template structures are identified by these approaches. Although some methods can generate hybrid models with better accuracy from multiple templates,[9][10] most methods rely on a single template. Therefore, choosing the best template from among the candidates is a key step, and can affect the final accuracy of the structure significantly. This choice is guided by several factors, such as the similarity of the query and template sequences, of their functions, and of the predicted query and observed template secondary structures. Perhaps most importantly, the coverage of the aligned regions: the fraction of the query sequence structure that can be predicted from the template, and the plausibility of the resulting model. Thus, sometimes several homology models are produced for a single query sequence, with the most likely candidate chosen only in the final step.

It is possible to use the sequence alignment generated by the database search technique as the basis for the subsequent model production; however, more sophisticated approaches have also been explored. One proposal generates an ensemble of stochastically defined pairwise alignments between the target sequence and a single identified template as a means of exploring "alignment space" in regions of sequence with low local similarity.[11] "Profile-profile" alignments that first generate a sequence profile of the target and systematically compare it to the sequence profiles of solved structures; the coarse-graining inherent in the profile construction is thought to reduce noise introduced by sequence drift in nonessential regions of the sequence.[12]

Model generation

Given a template and an alignment, the information contained therein must be used to generate a three-dimensional structural model of the target, represented as a set of Cartesian coordinates for each atom in the protein. Three major classes of model generation methods have been proposed.[13][14]

Fragment assembly

The original method of homology modeling relied on the assembly of a complete model from conserved structural fragments identified in closely related solved structures. For example, a modeling study of serine proteases in mammals identified a sharp distinction between "core" structural regions conserved in all experimental structures in the class, and variable regions typically located in the loops where the majority of the sequence differences were localized. Thus unsolved proteins could be modeled by first constructing the conserved core and then substituting variable regions from other proteins in the set of solved structures.[15] Current implementations of this method differ mainly in the way they deal with regions that are not conserved or that lack a template.[16] The variable regions are often constructed with the help of fragment libraries.

Segment matching

The segment-matching method divides the target into a series of short segments, each of which is matched to its own template fitted from the Protein Data Bank. Thus, sequence alignment is done over segments rather than over the entire protein. Selection of the template for each segment is based on sequence similarity, comparisons of alpha carbon coordinates, and predicted steric conflicts arising from the van der Waals radii of the divergent atoms between target and template.[17]

Satisfaction of spatial restraints

The most common current homology modeling method takes its inspiration from calculations required to construct a three-dimensional structure from data generated by NMR spectroscopy. One or more target-template alignments are used to construct a set of geometrical criteria that are then converted to probability density functions for each restraint. Restraints applied to the main protein internal coordinates – protein backbone distances and dihedral angles – serve as the basis for a global optimization procedure that originally used conjugate gradient energy minimization to iteratively refine the positions of all heavy atoms in the protein.[18]

This method had been dramatically expanded to apply specifically to loop modeling, which can be extremely difficult due to the high flexibility of loops in proteins in aqueous solution.[19] A more recent expansion applies the spatial-restraint model to electron density maps derived from cryoelectron microscopy studies, which provide low-resolution information that is not usually itself sufficient to generate atomic-resolution structural models.[20] To address the problem of inaccuracies in initial target-template sequence alignment, an iterative procedure has also been introduced to refine the alignment on the basis of the initial structural fit.[21] The most commonly used software in spatial restraint-based modeling is MODELLER and a database called ModBase has been established for reliable models generated with it.[22]

Loop modeling

Regions of the target sequence that are not aligned to a template are modeled by loop modeling; they are the most susceptible to major modeling errors and occur with higher frequency when the target and template have low sequence identity. The coordinates of unmatched sections determined by loop modeling programs are generally much less accurate than those obtained from simply copying the coordinates of a known structure, particularly if the loop is longer than 10 residues. The first two sidechain dihedral angles (χ1 and χ2) can usually be estimated within 30° for an accurate backbone structure; however, the later dihedral angles found in longer side chains such as lysine and arginine are notoriously difficult to predict. Moreover, small errors in χ1 (and, to a lesser extent, in χ2) can cause relatively large errors in the positions of the atoms at the terminus of side chain; such atoms often have a functional importance, particularly when located near the active site.

Model assessment

A large number of methods have been developed for selecting a native-like structure from a set of models. Scoring functions have been based on both molecular mechanics energy functions (Lazaridis and Karplus 1999; Petrey and Honig 2000; Feig and Brooks 2002; Felts et al. 2002; Lee and Duan 2004), statistical potentials (Sippl 1995; Melo and Feytmans 1998; Samudrala and Moult 1998; Rojnuckarin and Subramaniam 1999; Lu and Skolnick 2001; Wallqvist et al. 2002; Zhou and Zhou 2002), residue environments (Luthy et al. 1992; Eisenberg et al. 1997; Park et al. 1997; Summa et al. 2005), local side-chain and backbone interactions (Fang and Shortle 2005), orientation-dependent properties (Buchete et al. 2004a,b; Hamelryck 2005), packing estimates (Berglund et al. 2004), solvation energy (Petrey and Honig 2000; McConkey et al. 2003; Wallner and Elofsson 2003; Berglund et al. 2004), hydrogen bonding (Kortemme et al. 2003), and geometric properties (Colovos and Yeates 1993; Kleywegt 2000; Lovell et al. 2003; Mihalek et al. 2003). A number of methods combine different potentials into a global score, usually using a linear combination of terms (Kortemme et al. 2003; Tosatto 2005), or with the help of machine learning techniques, such as neural networks (Wallner and Elofsson 2003) and support vector machines (SVM) (Eramian et al. 2006). Comparisons of different global model quality assessment programs can be found in recent papers by Pettitt et al. (2005), Tosatto (2005), and Eramian et al. (2006).

Less work has been reported on the local quality assessment of models. Local scores are important in the context of modeling because they can give an estimate of the reliability of different regions of a predicted structure. This information can be used in turn to determine which regions should be refined, which should be considered for modeling by multiple templates, and which should be predicted ab initio. Information on local model quality could also be used to reduce the combinatorial problem when considering alternative alignments; for example, by scoring different local models separately, fewer models would have to be built (assuming that the interactions between the separate regions are negligible or can be estimated separately).

One of the most widely used local scoring methods is Verify3D (Luthy et al. 1992; Eisenberg et al. 1997), which combines secondary structure, solvent accessibility, and polarity of residue environments. ProsaII (Sippl 1993), which is based on a combination of a pairwise statistical potential and a solvation term, is also applied extensively in model evaluation. Other methods include the Errat program (Colovos and Yeates 1993), which considers distributions of nonbonded atoms according to atom type and distance, and the energy strain method (Maiorov and Abagyan 1998), which uses differences from average residue energies in different environments to indicate which parts of a protein structure might be problematic. Melo and Feytmans (1998) use an atomic pairwise potential and a surface-based solvation potential (both knowledge-based) to evaluate protein structures. Apart from the energy strain method, which is a semiempirical approach based on the ECEPP3 force field (Nemethy et al. 1992), all of the local methods listed above are based on statistical potentials. A conceptually distinct approach is the ProQres method, which was very recently introduced by Wallner and Elofsson (2006). ProQres is based on a neural network that combines structural features to distinguish correct from incorrect regions. ProQres was shown to outperform earlier methodologies based on statistical approaches (Verify3D, ProsaII, and Errat). The data presented in Wallner and Elofsson's study suggests that their machine-learning approach based on structural features is indeed superior to statistics-based methods. However, the knowledge-based methods examined in their work, Verify3D (Luthy et al. 1992; Eisenberg et al. 1997), Prosa (Sippl 1993), and Errat (Colovos and Yeates 1993), are not based on newer statistical potentials.

Benchmarking

Several large-scale benchmarking efforts have been made to assess the relative quality of various current homology modeling methods. CASP is a community-wide prediction experiment that runs every two years during the summer months and challenges prediction teams to submit structural models for a number of sequences whose structures have recently been solved experimentally but have not yet been published. Its partner CAFASP has run in parallel with CASP but evaluates only models produced via fully automated servers. Continuously running experiments that do not have prediction 'seasons' focus mainly on benchmarking publicly available webservers. LiveBench and EVA run continuously to assess participating servers' performance in prediction of imminently released structures from the PDB. CASP and CAFASP serve mainly as evaluations of the state of the art in modeling, while the continuous assessments seek to evaluate the model quality that would be obtained by a non-expert user employing publicly available tools.

Accuracy

The accuracy of the structures generated by homology modeling is highly dependent on the sequence identity between target and template. Above 50% sequence identity, models tend to be reliable, with only minor errors in side chain packing and rotameric state, and an overall RMSD between the modeled and the experimental structure falling around 1 Å. This error is comparable to the typical resolution of a structure solved by NMR. In the 30–50% identity range, errors can be more severe and are often located in loops. Below 30% identity, serious errors occur, sometimes resulting in the basic fold being mis-predicted.[13] This low-identity region is often referred to as the "twilight zone" within which homology modeling is extremely difficult, and to which it is possibly less suited than fold recognition methods.[23]

At high sequence identities, the primary source of error in homology modeling derives from the choice of the template or templates on which the model is based, while lower identities exhibit serious errors in sequence alignment that inhibit the production of high-quality models.[6] It has been suggested that the major impediment to quality model production is inadequacies in sequence alignment, since "optimal" structural alignments between two proteins of known structure can be used as input to current modeling methods to produce quite accurate reproductions of the original experimental structure.[24]

Attempts have been made to improve the accuracy of homology models built with existing methods by subjecting them to molecular dynamics simulation in an effort to improve their RMSD to the experimental structure. However, current force field parameterizations may not be sufficiently accurate for this task, since homology models used as starting structures for molecular dynamics tend to produce slightly worse structures.[25] Slight improvements have been observed in cases where significant restraints were used during the simulation.[26]

Sources of error

The two most common and large-scale sources of error in homology modeling are poor template selection and inaccuracies in target-template sequence alignment.[6][27] Controlling for these two factors by using a structural alignment, or a sequence alignment produced on the basis of comparing two solved structures, dramatically reduces the errors in final models; these "gold standard" alignments can be used as input to current modeling methods to produce quite accurate reproductions of the original experimental structure.[24] Results from the most recent CASP experiment suggest that "consensus" methods collecting the results of multiple fold recognition and multiple alignment searches increase the likelihood of identifying the correct template; similarly, the use of multiple templates in the model-building step may be worse than the use of the single correct template but better than the use of a single suboptimal one.[27] Alignment errors may be minimized by the use of a multiple alignment even if only one template is used, and by the iterative refinement of local regions of low similarity.[3][11] A lesser source of model errors are errors in the template structure. The PDBREPORT database lists several million, mostly very small but occasionally dramatic, errors in experimental (template) structures that have been deposited in the PDB.

Serious local errors can arise in homology models where an insertion or deletion mutation or a gap in a solved structure result in a region of target sequence for which there is no corresponding template. This problem can be minimized by the use of multiple templates, but the method is complicated by the templates' differing local structures around the gap and by the likelihood that a missing region in one experimental structure is also missing in other structures of the same protein family. Missing regions are most common in loops where high local flexibility increases the difficulty of resolving the region by structure-determination methods. Although some guidance is provided even with a single template by the positioning of the ends of the missing region, the longer the gap, the more difficult it is to model. Loops of up to about 9 residues can be modeled with moderate accuracy in some cases if the local alignment is correct.[3] Larger regions are often modeled individually using ab initio structure prediction techniques, although this approach has met with only isolated success.[28]

The rotameric states of side chains and their internal packing arrangement also present difficulties in homology modeling, even in targets for which the backbone structure is relatively easy to predict. This is partly due to the fact that many side chains in crystal structures are not in their "optimal" rotameric state as a result of energetic factors in the hydrophobic core and in the packing of the individual molecules in a protein crystal.[29] One method of addressing this problem requires searching a rotameric library to identify locally low-energy combinations of packing states.[30] It has been suggested that a major reason that homology modeling so difficult when target-template sequence identity lies below 30% is that such proteins have broadly similar folds but widely divergent side chain packing arrangements.[4]

Utility

Uses of the structural models include protein–protein interaction prediction, protein–protein docking, molecular docking, and functional annotation of genes identified in an organism's genome.[31] Even low-accuracy homology models can be useful for these purposes, because their inaccuracies tend to be located in the loops on the protein surface, which are normally more variable even between closely related proteins. The functional regions of the protein, especially its active site, tend to be more highly conserved and thus more accurately modeled.[13]

Homology models can also be used to identify subtle differences between related proteins that have not all been solved structurally. For example, the method was used to identify cation binding sites on the Na+/K+ ATPase and to propose hypotheses about different ATPases' binding affinity.[32] Used in conjunction with molecular dynamics simulations, homology models can also generate hypotheses about the kinetics and dynamics of a protein, as in studies of the ion selectivity of a potassium channel.[33] Large-scale automated modeling of all identified protein-coding regions in a genome has been attempted for the yeast Saccharomyces cerevisiae, resulting in nearly 1000 quality models for proteins whose structures had not yet been determined at the time of the study, and identifying novel relationships between 236 yeast proteins and other previously solved structures.[34]

See also

References

  1. ^ Chothia, C; Lesk, AM (1986). "The relation between the divergence of sequence and structure in proteins". EMBO J. 5 (4): 823–6. doi:10.1002/j.1460-2075.1986.tb04288.x. PMC 1166865. PMID 3709526.
  2. ^ Kaczanowski, S; Zielenkiewicz, P (2010). "Why similar protein sequences encode similar three-dimensional structures?" (PDF). Theoretical Chemistry Accounts. 125 (3–6): 643–50. doi:10.1007/s00214-009-0656-3. S2CID 95593331.
  3. ^ a b c d e f g Marti-Renom, MA; Stuart, AC; Fiser, A; Sanchez, R; Melo, F; Sali, A. (2000). "Comparative protein structure modeling of genes and genomes". Annu Rev Biophys Biomol Struct. 29: 291–325. doi:10.1146/annurev.biophys.29.1.291. PMID 10940251. S2CID 11498685.
  4. ^ a b Chung SY, Subbiah S. (1996.) A structural explanation for the twilight zone of protein sequence homology. Structure 4: 1123–27.
  5. ^ Williamson AR (2000). "Creating a structural genomics consortium". Nat Struct Biol. 7 (S1(11s)): 953. doi:10.1038/80726. PMID 11103997. S2CID 35185565.
  6. ^ a b c Venclovas C, Margeleviĉius M (2005). "Comparative modeling in CASP6 using consensus approach to template selection, sequence-structure alignment, and structure assessment". Proteins. 61 (S7): 99–105. doi:10.1002/prot.20725. PMID 16187350. S2CID 45345271.
  7. ^ Dalal, S; Balasubramanian, S; Regan, L (1997). "Transmuting alpha helices and beta sheets". Fold Des. 2 (5): R71–9. doi:10.1016/s1359-0278(97)00036-9. PMID 9377709.
  8. ^ Dalal, S; Balasubramanian, S; Regan, L. (1997). "Protein alchemy: changing beta-sheet into alpha-helix". Nat Struct Biol. 4 (7): 548–52. doi:10.1038/nsb0797-548. PMID 9228947. S2CID 5608132.
  9. ^ a b c Peng, Jian; Jinbo Xu (2011). "RaptorX: Exploiting structure information for protein alignment by statistical inference". Proteins. 79 (Suppl 10): 161–71. doi:10.1002/prot.23175. PMC 3226909. PMID 21987485.
  10. ^ Peng, Jian; Jinbo Xu (April 2011). "a multiple-template approach to protein threading". Proteins. 79 (6): 1930–1939. doi:10.1002/prot.23016. PMC 3092796. PMID 21465564.
  11. ^ a b Muckstein, U; Hofacker, IL; Stadler, PF (2002). "Stochastic pairwise alignments". Bioinformatics. 18 (Suppl 2): S153–60. doi:10.1093/bioinformatics/18.suppl_2.S153. PMID 12385998.
  12. ^ Rychlewski, L; Zhang, B; Godzik, A. (1998). "Fold and function predictions for Mycoplasma genitalium proteins". Fold Des. 3 (4): 229–38. doi:10.1016/S1359-0278(98)00034-0. PMID 9710568.
  13. ^ a b c Baker, D; Sali, A (2001). "Protein structure prediction and structural genomics". Science. 294 (5540): 93–96. Bibcode:2001Sci...294...93B. doi:10.1126/science.1065659. PMID 11588250. S2CID 7193705.
  14. ^ Zhang Y (2008). "Progress and challenges in protein structure prediction". Curr Opin Struct Biol. 18 (3): 342–348. doi:10.1016/j.sbi.2008.02.004. PMC 2680823. PMID 18436442.
  15. ^ Greer, J. (1981). "Comparative model-building of the mammalian serine proteases". Journal of Molecular Biology. 153 (4): 1027–42. doi:10.1016/0022-2836(81)90465-4. PMID 7045378.
  16. ^ Wallner, B; Elofsson, A (2005). "All are not equal: A benchmark of different homology modeling programs". Protein Science. 14 (5): 1315–1327. doi:10.1110/ps.041253405. PMC 2253266. PMID 15840834.
  17. ^ Levitt, M. (1992). "Accurate modeling of protein conformation by automatic segment matching". J Mol Biol. 226 (2): 507–33. doi:10.1016/0022-2836(92)90964-L. PMID 1640463.
  18. ^ Sali, A; Blundell, TL. (1993). "Comparative protein modelling by satisfaction of spatial restraints". J Mol Biol. 234 (3): 779–815. doi:10.1006/jmbi.1993.1626. PMID 8254673.
  19. ^ Fiser, A; Sali, A. (2003). "ModLoop: automated modeling of loops in protein structures". Bioinformatics. 19 (18): 2500–1. doi:10.1093/bioinformatics/btg362. PMID 14668246.
  20. ^ Topf, M; Baker, ML; Marti-Renom, MA; Chiu, W; Sali, A. (2006). "Refinement of protein structures by iterative comparative modeling and CryoEM density fitting". J Mol Biol. 357 (5): 1655–68. doi:10.1016/j.jmb.2006.01.062. PMID 16490207.
  21. ^ John, B; Sali, A. (2003). "Comparative protein structure modeling by iterative alignment, model building and model assessment". Nucleic Acids Res. 31 (14): 3982–92. doi:10.1093/nar/gkg460. PMC 165975. PMID 12853614.
  22. ^ Ursula Pieper, Narayanan Eswar, Hannes Braberg, M.S. Madhusudhan, Fred Davis, Ashley C. Stuart, Nebojsa Mirkovic, Andrea Rossi, Marc A. Marti-Renom, Andras Fiser, Ben Webb, Daniel Greenblatt, Conrad Huang, Tom Ferrin, Andrej Sali. MODBASE, a database of annotated comparative protein structure models, and associated resources. Nucleic Acids Res 32, D217-D222, 2004.
  23. ^ Blake, JD; Cohen, FE. (2001). "Pairwise sequence alignment below the twilight zone". J Mol Biol. 307 (2): 721–35. doi:10.1006/jmbi.2001.4495. PMID 11254392.
  24. ^ a b Zhang, Y; Skolnick, J. (2005). "The protein structure prediction problem could be solved using the current PDB library". Proc. Natl. Acad. Sci. USA. 102 (4): 1029–34. Bibcode:2005PNAS..102.1029Z. doi:10.1073/pnas.0407152101. PMC 545829. PMID 15653774.
  25. ^ Koehl, P; Levitt, M. (1999). "A brighter future for protein structure prediction". Nat Struct Biol. 6 (2): 108–11. doi:10.1038/5794. PMID 10048917. S2CID 3162636.
  26. ^ Flohil, JA; Vriend, G; Berendsen, HJ. (2002). "Completion and refinement of 3-D homology models with restricted molecular dynamics: application to targets 47, 58, and 111 in the CASP modeling competition and posterior analysis". Proteins. 48 (4): 593–604. doi:10.1002/prot.10105. PMID 12211026. S2CID 11280977.
  27. ^ a b Ginalski, K. (2006). "Comparative modeling for protein structure prediction". Curr Opin Struct Biol. 16 (2): 172–7. doi:10.1016/j.sbi.2006.02.003. PMID 16510277.
  28. ^ Kryshtafovych A, Venclovas C, Fidelis K, Moult J. (2005). Progress over the first decade of CASP experiments. Proteins 61(S7):225–36.
  29. ^ Vasquez, M. (1996). "Modeling side-chain conformation". Curr Opin Struct Biol. 6 (2): 217–21. doi:10.1016/S0959-440X(96)80077-7. PMID 8728654.
  30. ^ Wilson, C; Gregoret, LM; Agard, DA. (1993). "Modeling side-chain conformation for homologous proteins using an energy-based rotamer search". J Mol Biol. 229 (4): 996–1006. doi:10.1006/jmbi.1993.1100. PMID 8445659.
  31. ^ Gopal, S; Schroeder, M; Pieper, U; Sczyrba, A; Aytekin-Kurban, G; Bekiranov, S; Fajardo, JE; Eswar, N; Sanchez, R; et al. (2001). "Homology-based annotation yields 1,042 new candidate genes in the Drosophila melanogaster genome". Nat Genet. 27 (3): 337–40. doi:10.1038/85922. PMID 11242120. S2CID 2144435.
  32. ^ Ogawa, H; Toyoshima, C. (2002). "Homology modeling of the cation binding sites of Na+K+-ATPase". Proc Natl Acad Sci USA. 99 (25): 15977–15982. Bibcode:2002PNAS...9915977O. doi:10.1073/pnas.202622299. PMC 138550. PMID 12461183.
  33. ^ Capener, CE; Shrivastava, IH; Ranatunga, KM; Forrest, LR; Smith, GR; Sansom, MSP (2000). "Homology Modeling and Molecular Dynamics Simulation Studies of an Inward Rectifier Potassium Channel". Biophys J. 78 (6): 2929–2942. Bibcode:2000BpJ....78.2929C. doi:10.1016/S0006-3495(00)76833-0. PMC 1300878. PMID 10827973.
  34. ^ Sánchez, R; Sali, A. (1998). "Large-scale protein structure modeling of the Saccharomyces cerevisiae genome". Proc Natl Acad Sci USA. 95 (23): 13597–13602. Bibcode:1998PNAS...9513597S. doi:10.1073/pnas.95.23.13597. PMC 24864. PMID 9811845.
source: https://en.wikipedia.org/wiki/Homology_modeling