Cyclic coordinate descent: A robotics algorithm for protein loop closure.

@article{citeulike:511492, abstract = {In protein structure prediction, it is often the case that a protein segment must be adjusted to connect two fixed segments. This occurs during loop structure prediction in homology modeling as well as in ab initio structure prediction. Several algorithms for this purpose are based on the inverse Jacobian of the distance constraints with respect to dihedral angle degrees of freedom. These algorithms are sometimes unstable and fail to converge. We present an algorithm developed originally for inverse kinematics applications in robotics. In robotics, an end effector in the form of a robot hand must reach for an object in space by altering adjustable joint angles and arm lengths. In loop prediction, dihedral angles must be adjusted to move the C-terminal residue of a segment to superimpose on a fixed anchor residue in the protein structure. The algorithm, referred to as cyclic coordinate descent or CCD, involves adjusting one dihedral angle at a time to minimize the sum of the squared distances between three backbone atoms of the moving C-terminal anchor and the corresponding atoms in the fixed C-terminal anchor. The result is an equation in one variable for the proposed change in each dihedral. The algorithm proceeds iteratively through all of the adjustable dihedral angles from the N-terminal to the C-terminal end of the loop. CCD is suitable as a component of loop prediction methods that generate large numbers of trial structures. It succeeds in closing loops in a large test set 99.79\% of the time, and fails occasionally only for short, highly extended loops. It is very fast, closing loops of length 8 in 0.037 sec on average.}, address = {Institute for Cancer Research, Fox Chase Cancer Center, Philadelphia, Pennsylvania 19111, USA.}, author = {Canutescu, A. A. and Dunbrack, R. L. }, citeulike-article-id = {511492}, issn = {0961-8368}, journal = {Protein Sci}, keywords = {loop}, month = {May}, number = {5}, pages = {963--972}, posted-at = {2006-02-19 07:17:09}, priority = {2}, title = {Cyclic coordinate descent: A robotics algorithm for protein loop closure.}, url = {http://www.proteinscience.org/cgi/content/abstract/12/5/963}, volume = {12}, year = {2003} }

TY - JOUR ID - citeulike:511492 L3 - citeulike-article-id:511492 TI - Cyclic coordinate descent: A robotics algorithm for protein loop closure. JF - Protein Sci VL - 12 IS - 5 SP - 963 EP - 972 AD - Institute for Cancer Research, Fox Chase Cancer Center, Philadelphia, Pennsylvania 19111, USA. SN - 0961-8368 N2 - In protein structure prediction, it is often the case that a protein segment must be adjusted to connect two fixed segments. This occurs during loop structure prediction in homology modeling as well as in ab initio structure prediction. Several algorithms for this purpose are based on the inverse Jacobian of the distance constraints with respect to dihedral angle degrees of freedom. These algorithms are sometimes unstable and fail to converge. We present an algorithm developed originally for inverse kinematics applications in robotics. In robotics, an end effector in the form of a robot hand must reach for an object in space by altering adjustable joint angles and arm lengths. In loop prediction, dihedral angles must be adjusted to move the C-terminal residue of a segment to superimpose on a fixed anchor residue in the protein structure. The algorithm, referred to as cyclic coordinate descent or CCD, involves adjusting one dihedral angle at a time to minimize the sum of the squared distances between three backbone atoms of the moving C-terminal anchor and the corresponding atoms in the fixed C-terminal anchor. The result is an equation in one variable for the proposed change in each dihedral. The algorithm proceeds iteratively through all of the adjustable dihedral angles from the N-terminal to the C-terminal end of the loop. CCD is suitable as a component of loop prediction methods that generate large numbers of trial structures. It succeeds in closing loops in a large test set 99.79% of the time, and fails occasionally only for short, highly extended loops. It is very fast, closing loops of length 8 in 0.037 sec on average. KW - loop AU - Canutescu, AA AU - Dunbrack, RL PY - 2003/05// UR - http://www.proteinscience.org/cgi/content/abstract/12/5/963 ER -