The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Cyclic coordinate descent: A robotics algorithm for protein loop closure
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
Comparative Protein Modelling by Satisfaction of Spatial Restraints
Šali, A., & Blundell, T. L. (1993) · Journal of Molecular Biology · doi:10.1006/jmbi.1993.1626 · Cited by 12,977
Database resources of the National Center for Biotechnology Information: update
Wheeler, D. L. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh073 · Cited by 10,641
Knowledge‐based protein secondary structure assignment
Frishman, D., & Argos, P. (1995) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340230412 · Cited by 2,523
Modeling of loops in protein structures
Fiser, A., Do, R. K. G., & Šali, A. (2000) · Protein Science · doi:10.1110/ps.9.9.1753 · Cited by 2,116 · cited 4×
“Most loop methods have not been tested in true homology modeling situations, but rather in the more artificial situation of replacing a loop back into its own native structure Both Modeller (Fiser et al. 2000) and the “scaling relax-ation” method of Zheng et al. (1992) build initial conformations that connect the anch…”
MethodInfluentialBriggs, W. L. (1987) · Cited by 1,868
A Multigrid Tutorial, Second Edition
Briggs, W. L., Henson, V. E., & McCormick, S. F. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719505 · Cited by 1,510
Hidden Markov models for detecting remote protein homologies.
Karplus, K., Barrett, C., & Hughey, R. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.10.846 · Cited by 1,102
Bayesian statistical analysis of protein side‐chain rotamer preferences
Dunbrack, R. L., & Cohen, F. E. (1997) · Protein Science · doi:10.1002/pro.5560060807 · Cited by 774
Self-citationBower, M. J., Cohen, F. E., & Dunbrack, R. L. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1997.0926 · Cited by 551
Self-citationPrediction of the folding of short polypeptide segments by uniform conformational sampling
Bruccoleri, R. E., & Karplus, M. (1987) · Biopolymers · doi:10.1002/bip.360260114 · Cited by 424
Extending the accuracy limits of prediction for side-chain conformations
Xiang, Z., & Honig, B. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2001.4865 · Cited by 412
Xiang, Z., Soto, C. S., & Honig, B. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.102179699 · Cited by 367
Moult, J., & James, M. N. G. (1986) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340010207 · Cited by 258
Shenkin, P. S., Yarmush, D. L., Fine, R. M., Wang, H., & Levinthal, C. (1987) · Biopolymers · doi:10.1002/bip.360261207 · Cited by 249
Database resources of the National Center for Biotechnology Information: 2002 update
Wheeler, D. L. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.13 · Cited by 216
Fine, R. M., Wang, H., Shenkin, P. S., Yarmush, D. L., & Levinthal, C. (1986) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340010408 · Cited by 209
Structural basis of hyaluronan degradation by Streptococcus pneumoniae hyaluronate lyase
Li, S. (2000) · The EMBO Journal · doi:10.1093/emboj/19.6.1228 · Cited by 172
PDB-based protein loop prediction: parameters for selection and methods for optimization
van Vlijmen, H. W. T., & Karplus, M. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0857 · Cited by 160
del Pino, I. M. P., Ibarra‐Molero, B., & Sánchez‐Ruiz, J. M. (2000) · Proteins Structure Function and Bioinformatics · doi:10.1002/(sici)1097-0134(20000701)40:1<6::aid-prot30>3.0.co;2-7 · Cited by 148
Side‐chain modeling with an optimized scoring function
Liang, S., & Grishin, N. V. (2002) · Protein Science · doi:10.1110/ps.24902 · Cited by 135
Taxonomy and conformational analysis of loops in proteins
Ring, C. S., Kneller, D. G., Langridge, R., & Cohen, F. E. (1992) · Journal of Molecular Biology · doi:10.1016/0022-2836(92)90553-v · Cited by 130
A motion planning approach to flexible ligand binding.
Singh, A. P., Latombe, J.-C., & Brutlag, D. L. (1999) · PubMed · Cited by 107
Comparative modeling of CASP3 targets using PSI-BLAST and SCWRL
Dunbrack, R. L. (1999) · Proteins Structure Function and Bioinformatics · doi:10.1002/(sici)1097-0134(1999)37:3+<81::aid-prot12>3.0.co;2-r · Cited by 74
Self-citationA divide and conquer approach to fast loop modeling.
Tosatto, S., Bindewald, E., Hesser, J., & Männer, R. (2002) · Protein Engineering · doi:10.1093/protein/15.4.279 · Cited by 71
Loop closure via bond scaling and relaxation
Zheng, Q., Rosenfeld, R., Vajda, S., & DeLisi, C. (1993) · Journal of Computational Chemistry · doi:10.1002/jcc.540140508 · Cited by 49
Modeling protein loops using a ϕi+1, Ψi dimer database
Sudarsanam, S., DuBose, R. F., March, C. J., & Srinivasan, S. (1995) · Protein Science · doi:10.1002/pro.5560040715 · Cited by 43
Genomic fold assignment and rational modeling of proteins of biological interest.
Sauder, J. M., & Dunbrack, R. L. (2000) · PubMed · Cited by 9
Self-citation(1999) · doi:10.1002/(sici)1097-0134(1999)37:3+<171::aid-prot21>3.0.co;2-z
Cited by
The Phyre2 web portal for protein modeling, prediction and analysis
Kelley, L. A., Mezulis, S., Yates, C. M., Wass, M. N., & Sternberg, M. J. E. (2015) · Nature Protocols · doi:10.1038/nprot.2015.053 · Cited by 9,652
Computational Methods in Drug Discovery
Sliwoski, G., Kothiwale, S., Meiler, J., & Lowe, E. W. (2014) · Pharmacological Reviews · doi:10.1124/pr.112.007336 · Cited by 2,160
Leaver-Fay (2011) · doi:10.1016/b978-0-12-381270-4.00019-6 · Cited by 1,904
The SWISS-MODEL Repository—new features and functionality
Bienert, S., Waterhouse, A., de Beer, T. A. P., Tauriello, G., Studer, G., Bordoli, L., & Schwede, T. (2017) · Nucleic Acids Research · doi:10.1093/nar/gkw1132 · Cited by 1,745
Wright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Metadata
- Authors
- Canutescu, A. A., & Dunbrack, R. L.
- Venue
- Protein Science
- Publisher
- Wiley
- Published
- 2003-05
- Volume
- 12
- Issue
- 5
- Pages
- 963-972
- ISSN
- 0961-8368 (ISSN-L)
- 1469-896X
- OpenAlex
- W2067484689
- Cited by
- 521
- References
- 29
- FWCI
- 3.65
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.