Cargando…

Full cyclic coordinate descent: solving the protein loop closure problem in Cα space

BACKGROUND: Various forms of the so-called loop closure problem 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. In homology modelling, the problem arises in...

Descripción completa

Detalles Bibliográficos
Autores principales: Boomsma, Wouter, Hamelryck, Thomas
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2005
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1192790/
https://www.ncbi.nlm.nih.gov/pubmed/15985178
http://dx.doi.org/10.1186/1471-2105-6-159
_version_ 1782124813876199424
author Boomsma, Wouter
Hamelryck, Thomas
author_facet Boomsma, Wouter
Hamelryck, Thomas
author_sort Boomsma, Wouter
collection PubMed
description BACKGROUND: Various forms of the so-called loop closure problem 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. In homology modelling, the problem arises in predicting loop regions. In de novo protein structure prediction, the problem is encountered when implementing local moves for Markov Chain Monte Carlo simulations. 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 (φ, ψ) dihedral angles are variable. However, many de novo structure prediction methods use protein models that only consist of Cα 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α atoms also varies considerably. RESULTS: Here we present a method that solves the loop closure problem for Cα 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. CONCLUSION: We tested the method's performance on sets of random protein Cα 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.
format Text
id pubmed-1192790
institution National Center for Biotechnology Information
language English
publishDate 2005
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-11927902005-08-27 Full cyclic coordinate descent: solving the protein loop closure problem in Cα space Boomsma, Wouter Hamelryck, Thomas BMC Bioinformatics Methodology Article BACKGROUND: Various forms of the so-called loop closure problem 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. In homology modelling, the problem arises in predicting loop regions. In de novo protein structure prediction, the problem is encountered when implementing local moves for Markov Chain Monte Carlo simulations. 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 (φ, ψ) dihedral angles are variable. However, many de novo structure prediction methods use protein models that only consist of Cα 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α atoms also varies considerably. RESULTS: Here we present a method that solves the loop closure problem for Cα 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. CONCLUSION: We tested the method's performance on sets of random protein Cα 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. BioMed Central 2005-06-28 /pmc/articles/PMC1192790/ /pubmed/15985178 http://dx.doi.org/10.1186/1471-2105-6-159 Text en Copyright © 2005 Boomsma and Hamelryck; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( (http://creativecommons.org/licenses/by/2.0) ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Methodology Article
Boomsma, Wouter
Hamelryck, Thomas
Full cyclic coordinate descent: solving the protein loop closure problem in Cα space
title Full cyclic coordinate descent: solving the protein loop closure problem in Cα space
title_full Full cyclic coordinate descent: solving the protein loop closure problem in Cα space
title_fullStr Full cyclic coordinate descent: solving the protein loop closure problem in Cα space
title_full_unstemmed Full cyclic coordinate descent: solving the protein loop closure problem in Cα space
title_short Full cyclic coordinate descent: solving the protein loop closure problem in Cα space
title_sort full cyclic coordinate descent: solving the protein loop closure problem in cα space
topic Methodology Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1192790/
https://www.ncbi.nlm.nih.gov/pubmed/15985178
http://dx.doi.org/10.1186/1471-2105-6-159
work_keys_str_mv AT boomsmawouter fullcycliccoordinatedescentsolvingtheproteinloopclosureproblemincaspace
AT hamelryckthomas fullcycliccoordinatedescentsolvingtheproteinloopclosureproblemincaspace