{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T07:43:25Z","timestamp":1778053405657,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>Various forms of the so-called <jats:italic>loop closure problem<\/jats:italic> are crucial to protein structure prediction methods. Given an N- and a C-terminal end, the problem consists of finding a suitable segment of a certain length that bridges the ends seamlessly.<\/jats:p>\n                <jats:p>In homology modelling, the problem arises in predicting loop regions. In <jats:italic>de novo<\/jats:italic> protein structure prediction, the problem is encountered when implementing local moves for Markov Chain Monte Carlo simulations.<\/jats:p>\n                <jats:p>Most loop closure algorithms keep the bond angles fixed or semi-fixed, and only vary the dihedral angles. This is appropriate for a full-atom protein backbone, since the bond angles can be considered as fixed, while the (<jats:italic>\u03c6<\/jats:italic>, <jats:italic>\u03c8<\/jats:italic>) dihedral angles are variable. However, many <jats:italic>de novo<\/jats:italic> structure prediction methods use protein models that only consist of C<jats:italic>\u03b1<\/jats:italic> atoms, or otherwise do not make use of all backbone atoms. These methods require a method that alters both bond and dihedral angles, since the pseudo bond angle between three consecutive C<jats:italic>\u03b1<\/jats:italic> atoms also varies considerably.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>Here we present a method that solves the loop closure problem for C<jats:italic>\u03b1<\/jats:italic> only protein models. We developed a variant of Cyclic Coordinate Descent (CCD), an inverse kinematics method from the field of robotics, which was recently applied to the loop closure problem. Since the method alters both bond and dihedral angles, which is equivalent to applying a full rotation matrix, we call our method Full CCD (FCDD). FCCD replaces CCD's vector-based optimization of a rotation around an axis with a singular value decomposition-based optimization of a general rotation matrix. The method is easy to implement and numerically stable.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusion<\/jats:title>\n                <jats:p>We tested the method's performance on sets of random protein C<jats:italic>\u03b1<\/jats:italic> segments between 5 and 30 amino acids long, and a number of loops of length 4, 8 and 12. FCCD is fast, has a high success rate and readily generates conformations close to those of real loops. The presence of constraints on the angles only has a small effect on the performance. A reference implementation of FCCD in Python is available as supplementary information.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/1471-2105-6-159","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T18:13:46Z","timestamp":1119982426000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Full cyclic coordinate descent: solving the protein loop closure problem in C\u03b1 space"],"prefix":"10.1186","volume":"6","author":[{"given":"Wouter","family":"Boomsma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hamelryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"484_CR1","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1021\/ma60014a012","volume":"3","author":"N Go","year":"1970","unstructured":"Go N, Scheraga H: Ring closure and local conformational deformations of chain molecules. Macromolecules 1970, 3: 178\u2013187. 10.1021\/ma60014a012","journal-title":"Macromolecules"},{"key":"484_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1038\/nsb0295-163","volume":"2","author":"P Koehl","year":"1995","unstructured":"Koehl P, Delarue M: A self consistent mean field approach to simultaneous gap closure and side-chain positioning in homology modelling. Nat Struct Biol 1995, 2: 163\u201370. 10.1038\/nsb0295-163","journal-title":"Nat Struct Biol"},{"key":"484_CR3","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1529\/biophysj.104.041541","volume":"87","author":"R da Silva","year":"2004","unstructured":"da Silva R, Degreve L, Caliri A: LMProt: an efficient algorithm for Monte Carlo sampling of protein conformational space. Biophys J 2004, 87: 1567\u201377. 10.1529\/biophysj.104.041541","journal-title":"Biophys J"},{"key":"484_CR4","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1002\/j.1460-2075.1986.tb04287.x","volume":"5","author":"T Jones","year":"1986","unstructured":"Jones T, Thirup S: Using known substructures in protein model building and crystallography. EMBO J 1986, 5: 819\u201322.","journal-title":"EMBO J"},{"key":"484_CR5","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/prot.10629","volume":"55","author":"C Rohl","year":"2004","unstructured":"Rohl C, Strauss C, Chivian D, Baker D: Modeling structurally variable regions in homologous proteins with rosetta. Proteins 2004, 55: 656\u201377. 10.1002\/prot.10629","journal-title":"Proteins"},{"key":"484_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1177\/0278364905050352","volume":"24","author":"R Kolodny","year":"2005","unstructured":"Kolodny R, Guibas L, Levitt M, Koehl P: Inverse kinematics in biology: The protein loop closure problem. Int J Robotics Research 2005, 24: 151\u2013163. 10.1177\/0278364905050352","journal-title":"Int J Robotics Research"},{"key":"484_CR7","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1109\/70.326569","volume":"10","author":"D Manocha","year":"1994","unstructured":"Manocha D, Canny J: Efficient inverse kinematics for general 6R manipulators. IEEE Trans Rob Aut 1994, 10: 648\u2013657. 10.1109\/70.326569","journal-title":"IEEE Trans Rob Aut"},{"key":"484_CR8","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1110\/ps.0242703","volume":"12","author":"A Canutescu","year":"2003","unstructured":"Canutescu A, Dunbrack R Jr: Cyclic coordinate descent: A robotics algorithm for protein loop closure. Protein Sci 2003, 12: 963\u201372. 10.1110\/ps.0242703","journal-title":"Protein Sci"},{"key":"484_CR9","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1002\/jcc.10416","volume":"25","author":"E Coutsias","year":"2004","unstructured":"Coutsias E, Seok C, Jacobson M, Dill K: A kinematic view of loop closure. J Comput Chem 2004, 25: 510\u201328. 10.1002\/jcc.10416","journal-title":"J Comput Chem"},{"key":"484_CR10","doi-asserted-by":"publisher","first-page":"8154","DOI":"10.1063\/1.1364637","volume":"114","author":"G Favrin","year":"2001","unstructured":"Favrin G, Irb\u00e4ck A, Sjunnesson F: Monte carlo update for chain molecules: Biased Gaussian steps in torsional space. J Chem Phys 2001, 114: 8154\u20138158. 10.1063\/1.1364637","journal-title":"J Chem Phys"},{"key":"484_CR11","doi-asserted-by":"publisher","first-page":"2665","DOI":"10.1016\/S0006-3495(02)75608-7","volume":"82","author":"M Cahill","year":"2002","unstructured":"Cahill M, Cahill S, Cahill K: Proteins wriggle. Biophys J 2002, 82: 2665\u201370.","journal-title":"Biophys J"},{"key":"484_CR12","volume-title":"Pac Symp Biocomput","author":"R Singh","year":"2005","unstructured":"Singh R, Bergert B: Chaintweak: sampling from the neighbourhood of a protein conformation. Pac Symp Biocomput 2005. [http:\/\/helix-web.stanford.edu\/ps605\/singh.pdf]"},{"key":"484_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.sbi.2004.03.002","volume":"14","author":"N Buchete","year":"2004","unstructured":"Buchete N, Straub J, Thirumalai D: Development of novel statistical potentials for protein fold recognition. Curr Opin Struct Biol 2004, 14: 225\u201332. 10.1016\/j.sbi.2004.03.002","journal-title":"Curr Opin Struct Biol"},{"key":"484_CR14","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.sbi.2005.02.005","volume":"15","author":"V Tozzini","year":"2005","unstructured":"Tozzini V: Coarse-grained models for proteins. Curr Opin Struct Biol 2005, 15: 144\u201350. 10.1016\/j.sbi.2005.02.005","journal-title":"Curr Opin Struct Biol"},{"key":"484_CR15","doi-asserted-by":"publisher","first-page":"10125","DOI":"10.1073\/pnas.181328398","volume":"98","author":"D Kihara","year":"2001","unstructured":"Kihara D, Lu H, Kolinski A, Skolnick J: TOUCHSTONE: an ab initio protein structure prediction method that uses threading-based tertiary restraints. Proc Natl Acad Sci USA 2001, 98: 10125\u201330. 10.1073\/pnas.181328398","journal-title":"Proc Natl Acad Sci USA"},{"key":"484_CR16","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1002\/prot.340180404","volume":"18","author":"T Oldfield","year":"1994","unstructured":"Oldfield T, Hubbard R: Analysis of C alpha geometry in protein structures. Proteins 1994, 18: 324\u201337. 10.1002\/prot.340180404","journal-title":"Proteins"},{"key":"484_CR17","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1093\/protein\/7.8.953","volume":"7","author":"K Fidelis","year":"1994","unstructured":"Fidelis K, Stern P, Bacon D, Moult J: Comparison of systematic search and database methods for constructing segments of protein structure. Protein Eng 1994, 7: 953\u201360.","journal-title":"Protein Eng"},{"key":"484_CR18","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1006\/jmbi.1996.0857","volume":"267","author":"H van Vlijmen","year":"1997","unstructured":"van Vlijmen H, Karplus M: PDB-based protein loop prediction: parameters for selection and methods for optimization. J Mol Biol 1997, 267: 975\u20131001. 10.1006\/jmbi.1996.0857","journal-title":"J Mol Biol"},{"key":"484_CR19","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/70.86079","volume":"7","author":"L Wang","year":"1991","unstructured":"Wang L, Chen C: A combined optimization method for solving the inverse kinematics problem of mechanical manipulators. IEEE Trans Rob Aut 1991, 7: 489\u2013499. 10.1109\/70.86079","journal-title":"IEEE Trans Rob Aut"},{"key":"484_CR20","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1107\/S0567739478001680","volume":"A34","author":"W Kabsch","year":"1978","unstructured":"Kabsch W: A discussion of the solution for the best rotation to relate two sets of vectors. Acta Cryst 1978, A34: 827\u2013828.","journal-title":"Acta Cryst"},{"key":"484_CR21","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/34.88573","volume":"13","author":"S Umeyama","year":"1991","unstructured":"Umeyama S: Least squares estimation of transformation parameters between two point patterns. IEEE Trans Pattern Anal Mach Intell 1991, 13: 376\u201380. 10.1109\/34.88573","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"484_CR22","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub GH, Loan CFV: Matrix Computations. 3rd edition. Baltimore, Maryland: Johns Hopkins University Press; 1996.","edition":"3"},{"key":"484_CR23","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jmbi.2000.3837","volume":"301","author":"C Bystroff","year":"2000","unstructured":"Bystroff C, Thorsson V, Baker D: HMMSTR: a hidden Markov model for local sequence-structure correlations in proteins. J Mol Biol 2000, 301: 173\u201390. 10.1006\/jmbi.2000.3837","journal-title":"J Mol Biol"},{"key":"484_CR24","volume-title":"LAPACK's user's guide","author":"E Anderson","year":"1992","unstructured":"Anderson E, Bai Z, Bischof C, Demmel J, Dongarra J, Croz JD, Greenbaum A, Hammarling S, McKenney A, Ostrouchov S, Sorensen D:LAPACK's user's guide. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics; 1992. [http:\/\/www.netlib.org\/lapack\/lug\/]"},{"key":"484_CR25","doi-asserted-by":"publisher","first-page":"2308","DOI":"10.1093\/bioinformatics\/btg299","volume":"19","author":"T Hamelryck","year":"2003","unstructured":"Hamelryck T, Manderick B: PDB file parser and structure class implemented in Python. Bioinformatics 2003, 19: 2308\u201310. 10.1093\/bioinformatics\/btg299","journal-title":"Bioinformatics"},{"key":"484_CR26","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1093\/bioinformatics\/bth493","volume":"21","author":"I Van Walle","year":"2005","unstructured":"Van Walle I, Lasters I, Wyns L: SABmark-a benchmark for sequence alignment that covers the entire known fold space. Bioinformatics 2005, 21: 1267\u20138. 10.1093\/bioinformatics\/bth493","journal-title":"Bioinformatics"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-6-159.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T17:52:30Z","timestamp":1706809950000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-6-159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,28]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2005,12]]}},"alternative-id":["484"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-6-159","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6,28]]},"assertion":[{"value":"25 April 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2005","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2005","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"159"}}