Loop modeling: Difference between revisions

Revision as of 02:31, 18 June 2014

Revision as of 22:14, 17 July 2014

Line 1:

'''Loop modeling''' is a problem in [[protein structure prediction]] requiring the prediction of the [[chemical conformation|conformations]] of [[loop (biochemistry)|loop]] regions in [[protein]]s with or without the use of a structural template. Computer programs that solve these problems have been used to research a broad range of scientific topics from [[Adenosine diphosphate|ADP]] to [[breast cancer]].<ref>{{cite journal|last=Perraud|first=AL|coauthors=Takanishi, CL; Shen, B; Kang, S; Smith, MK; Schmitz, C; Knowles, HM; Ferraris, D; Li, W; Zhang, J; Stoddard, BL; Scharenberg, AM|title=Accumulation of free ADP-ribose from mitochondria mediates oxidative stress-induced gating of TRPM2 cation channels.|journal=The Journal of Biological Chemistry|date=Feb 18, 2005|volume=280|issue=7|pages=6138–48|pmid=15561722|doi=10.1074/jbc.M411446200}}</ref><ref>{{cite journal|last=Baloria|first=U|coauthorsauthor2=Akhoon, BA; |author3=Gupta, SK; |author4=Sharma, S; |author5= Verma, V |title=In silico proteomic characterization of human epidermal growth factor receptor 2 (HER-2) for the mapping of high affinity antigenic determinants against breast cancer.|journal=Amino Acids|date=Apr 2012|volume=42|issue=4|pages=1349–60|pmid=21229277|doi=10.1007/s00726-010-0830-x}}</ref> Because protein function is determined by its shape and the physiochemical properties of its exposed surface, it is important to create an accurate model for protein/ligand interaction studies.<ref>{{cite journal|last=Fiser|first=A|author2=Sali, A |title=ModLoop: automated modeling of loops in protein structures.|journal=Bioinformatics (Oxford, England)|date=Dec 12, 2003|volume=19|issue=18|pages=2500–1|pmid=14668246|doi=10.1093/bioinformatics/btg362}}</ref> The problem arises often in [[homology modeling]], where the [[tertiary structure]] of an [[amino acid sequence]] is predicted based on a [[sequence alignment]] to a ''template'', or a second sequence whose structure is known. Because loops have highly variable sequences even within a given [[structural motif]] or [[protein folding|protein fold]], they often correspond to unaligned regions in sequence alignments; they also tend to be located at the [[solvent]]-exposed surface of [[globular protein]]s and thus are more conformationally flexible. Consequently, they often cannot be modeled using standard homology modeling techniques. More constrained versions of loop modeling are also used in the data fitting stages of solving a protein structure by [[X-ray crystallography]], because loops can correspond to regions of low [[electron density]] and are therefore difficult to resolve.

Regions of a structural model that are predicted by non-template-based loop modeling tend to be much less accurate than regions that are predicted using template-based techniques. The extent of the inaccuracy increases with the number of [[amino acid]]s in the loop. The loop amino acids' [[side chain]]s [[dihedral angle]]s are often approximated from a [[rotamer]] library, but can worsen the inaccuracy of side chain packing in the overall model. [[Andrej Sali]]'s homology modeling suite [[MODELLER]] includes a facility explicitly designed for loop modeling by a satisfaction of spatial restraints method. All methods require an upload of the [[Protein Data Bank (file format)|PDB]] file and some require the specification of the loop ___location.

Line 13:

==Non-Template Based Techniques==

Otherwise known as an ''ab initio'' method, non-template based approaches use a statistical model to fill in the gaps created by the unknown loop structure. Some of these programs include MODELLER, Loopy, and RAPPER; but each of these programs approaches the problem in a different manner. For example, Loopy uses samples of torsion angle pairs to generate the initial loop structure then it revises this structure to maintain a realistic shape and closure, while RAPPER builds from one end of the gap to the other by extending the stem with different sampled angles until the gap is closed.<ref>{{cite journal|last=Holtby|first=Daniel|author2=Shuai Cheng Li |author3=Ming Li |title=LoopWeaver – Loop Modeling by the Weighted Scaling of Verified Proteins|journal=Lecture Notes in Computer Science|year=2012|volume=7262|pages=113–126|doi=10.1007/978-3-642-29627-7_11}}</ref> Yet another method is the “divide and conquer” approach. This involves subdividing the loop into 2 segments and then repeatedly dividing and transforming each segment until the loop is small enough to be solved.<ref>{{cite journal|last=Tosatto|first=SC|coauthorsauthor2=Bindewald, E; |author3=Hesser, J; |author4= Männer, R |title=A divide and conquer approach to fast loop modeling.|journal=Protein engineering|date=Apr 2002|volume=15|issue=4|pages=279–86|pmid=11983928|doi=10.1093/protein/15.4.279}}</ref> Even with all these methods non-template based approaches are most accurate up to 12 residues (amino acids within the loop).

There are three problems that arise when using a non-template based technique. First, there are constraints that limit the possibilities for local region modeling. One such constraint is that loop termini are required to end at the correct anchor position. Also, the [[Ramachandran plot|Ramachandran]] space cannot contain a backbone of [[dihedral angle]]s. Second, a modeling program has to use a set procedure. Some programs use the “spare parts” approach as mentioned above. Other programs use a ''[[De novo protein structure prediction|de novo]]'' approach that samples sterically feasible loop conformations and selects the best one. Third, determining the best model means that a scoring method must be created to compare the various conformations.<ref>{{cite journal|last=Adhikari|first=AN|coauthorsauthor2=Peng, J; |author3=Wilde, M; |author4=Xu, J; |author5=Freed, KF; |author6= Sosnick, TR |title=Modeling large regions in proteins: applications to loops, termini, and folding.|journal=Protein science : a publication of the Protein Society|date=Jan 2012|volume=21|issue=1|pages=107–21|pmid=22095743|doi=10.1002/pro.767|pmc=3323786}}</ref>

==See also==