Skip to main content

Protein Closed Loop Prediction from Contact Probabilities

  • Conference paper
Bioinformatics Research and Applications (ISBRA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 7875))

Included in the following conference series:

  • 4015 Accesses

Abstract

According to the theory of Trifonov [1] a subset of closed loops found in globular proteins, descriptively named loop-n-lock (LNL) structures, are returns of a polypeptide chain trajectory to close contact with itself. These closed loops are distinguished by a characteristic length, 20 to 35 residues, and a ”lock” that stabilizes the loop. Evidence supports their contention that globular proteins are composed of linear combinations of such closed loops. Occupying an intermediate position in protein structure hierarchy i.e., between secondary structure and domain, makes these loops good candidates for units of a hierarchical folding model.

In this study we investigated the potential utility of such closed loops in protein structure prediction. We first proposed a method to predict closed loops using sequence information, specifically interaction potential and secondary structure potential. As far as we know, this is the first program to predict closed loops solely based on sequence information. Then to support their use in a hierarchical folding model, we explored the placement of secondary structure elements with respect to closed loops. Our investigations showed that 80% of secondary structures do not cross a closed loop boundary, lending support to the hypothesis that the closed loop is a higher level intermediate structure of proteins. Moreover, we explored the relationship between closed loops and aligned segments from protein chain pairs from the Dali data set . The results showed protein pairs which exhibited significant structural similarity were more likely to have conserved closed loops.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Trifonov, E.N., Berezovsky, I.N.: Proteomic Code. Molecular Biology 36(2), 315–319 (2002)

    Article  Google Scholar 

  2. Linderstrom-Lang, K.U.: Proteins and Enzymes. In: Lane MedicalLectures. University Series, Medical Sciences, vol. 6. Stanford University Publications, Stanford University Press (1952)

    Google Scholar 

  3. Levinthal, C.: How to Fold Graciously. Mossbauer Spectroscopy in Biological Systems. In: Proceedings of a Meeting Held at Allerton House, Monticello, Illinois, pp. 22–24 (1969)

    Google Scholar 

  4. Chintapalli, S.V., Yew, B.K., Illingworth, C.J.R., Upton, G.J.G., Reeves, P.J., Parkes, K.E.B., Snell, C.R., Reynolds, C.A.: Closed Loop Folding Units from Structural Alignments: Experimental Foldons Revisited. J. Comput. Chem. 31, 2689–2701 (2010)

    Article  Google Scholar 

  5. Tegge, A.N., Wang, Z., Eickholt, J., Cheng, J.: NNcon: Improved Protein Contact Map Prediction Using 2D-Recursive Neural Networks. Nucleic Acids Research 37, w515–w518 (2009)

    Google Scholar 

  6. Murzin, A.G., Brenner, S.E., Hubbard, T., Chothia, C.: SCOP: a structural classification of proteins database for the investigation of sequences and structures. Jounral Molecular Biology 247, 536–540 (1995)

    Google Scholar 

  7. Koczyk, G., Berezovsky, I.N.: Domain Hierarchy and closed Loops (DHcL): a server for exploring hierarchy of protein domain structure. Nucl. Acids. Res. 36, W239–W245 (2008)

    Google Scholar 

  8. Chandonia, J.M., Hon, G., Walker, N.S., Lo Conte, L., Koehl, P., Levitt, M., Brenner, S.E.: The ASTRAL compendium in 2004. Nucleic Acids Research 32, D189–D192 (2004)

    Google Scholar 

  9. Holm, L., Rosenstrom, P.: Dali server: conservation mapping in 3D. Nucl. Acids Res. 38, W545–W549 (2010)

    Google Scholar 

  10. Hsiao, J.Y., Tang, C.Y., Chang, R.S.: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs. Information Processing Letters 43(5), 229–235 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kogan, S.B., Kupervasser, O.: Domain Hierarchy of Protein Loop-Lock Structure (DHoPLLS): a server for decomposition of a protein structure on set of closed loops. CoRR. abs/1106.1356 (2011)

    Google Scholar 

  12. Aharonovsky, E., Trifonov, E.N.: Sequence Structure of van der Waals Locks in Proteins. Journal of Biomolecular Structure Dynamics 22(5), 545–553 (2005)

    Article  Google Scholar 

  13. Berezovsky, I.N.: Discrete structure of van der Waals domains in globular proteins. Protein Engineering 16(3), 161–167 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, L., Robertson, J., Malmberg, R.L., Cai, L. (2013). Protein Closed Loop Prediction from Contact Probabilities. In: Cai, Z., Eulenstein, O., Janies, D., Schwartz, D. (eds) Bioinformatics Research and Applications. ISBRA 2013. Lecture Notes in Computer Science(), vol 7875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38036-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38036-5_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38035-8

  • Online ISBN: 978-3-642-38036-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics