The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A kinematic view of loop closure
Abstract
We consider the problem of loop closure, i.e., of finding the ensemble of possible backbone structures of a chain segment of a protein molecule that is geometrically consistent with preceding and following parts of the chain whose structures are given. We reduce this problem of determining the loop conformations of six torsions to finding the real roots of a 16th degree polynomial in one variable, based on the robotics literature on the kinematics of the equivalent rotator linkage in the most general case of oblique rotators. We provide a simple intuitive view and derivation of the polynomial for the case in which each of the three pair of torsional axes has a common point. Our method generalizes previous work on analytical loop closure in that the torsion angles need not be consecutive, and any rigid intervening segments are allowed between the free torsions. Our approach also allows for a small degree of flexibility in the bond angles and the peptide torsion angles; this substantially enlarges the space of solvable configurations as is demonstrated by an application of the method to the modeling of cyclic pentapeptides. We give further applications to two important problems. First, we show that this analytical loop closure algorithm can be efficiently combined with an existing loop‐construction algorithm to sample loops longer than three residues. Second, we show that Monte Carlo minimization is made severalfold more efficient by employing the local moves generated by the loop closure algorithm, when applied to the global minimization of an eight‐residue loop. Our loop closure algorithm is freely available at http://dillgroup. ucsf.edu/loop_closure/. © 2004 Wiley Periodicals, Inc. J Comput Chem 25: 510–528, 2004
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Discriminants, Resultants, and Multidimensional Determinants
Gelfand, I. M., Kapranov, M. M., & Zelevinsky, A. V. (1994) · Birkhäuser Boston eBooks · doi:10.1007/978-0-8176-4771-1 · Cited by 2,306
Applied and Computational Complex Analysis
Thacher, H. C., & Henrici, P. (1977) · Mathematics of Computation · doi:10.2307/2005805 · Cited by 2,022
Kinematic geometry of mechanisms
Hunt, K. H. (1978) · Medical Entomology and Zoology · Cited by 1,911
Monte Carlo-minimization approach to the multiple-minima problem in protein folding.
Li, Z., & Scheraga, H. A. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.19.6611 · Cited by 1,468
Effective energy function for proteins in solution
Lazaridis, T., & Karplus, M. (1999) · Proteins: Structure, Function, and Genetics · doi:10.1002/(sici)1097-0134(19990501)35:2<133::aid-prot1>3.0.co;2-n · Cited by 1,269
Kinematic Synthesis of Linkages
Hartenburg, R. S., Denavit, J., & Freudenstein, F. (1965) · Journal of Applied Mechanics · doi:10.1115/1.3625860 · Cited by 1,010
Cyclic coordinate descent: A robotics algorithm for protein loop closure
Canutescu, A. A., & Dunbrack, R. L. (2003) · Protein Science · doi:10.1110/ps.0242703 · Cited by 521
Prediction 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
Ring Closure and Local Conformational Deformations of Chain Molecules
Go¯, N., & Scheraga, H. A. (1970) · Macromolecules · doi:10.1021/ma60014a012 · Cited by 412
Glassner, A. S. (1990) · Cited by 401
A concerted rotation algorithm for atomistic Monte Carlo simulation of polymer melts and glasses
Dodd, L. R., Boone, T. D., & Theodorou, D. N. (1993) · Molecular Physics · doi:10.1080/00268979300100641 · Cited by 307
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
Mémoire sur la théorie de l'octaèdre articulé
Bricard, R. (1897) · French digital mathematics library (Numdam) · Cited by 186
Analysis and assessment of comparative modeling predictions in CASP4
Tramontano, A. L., Leplae, R., & Morea, V. (2001) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.10015 · Cited by 126
Ulmschneider, J. P., & Jorgensen, W. L. (2003) · The Journal of Chemical Physics · doi:10.1063/1.1542611 · Cited by 119
Chain closure with bond angle variations
Bruccoleri, R. E., & Karplus, M. (1985) · Macromolecules · doi:10.1021/ma00154a069 · Cited by 111
Efficient Monte Carlo methods for cyclic peptides
WU, M. G., & Deem, M. W. (1999) · Molecular Physics · doi:10.1080/00268979909482855 · Cited by 72
Determining protein loop conformation using scaling‐relaxation techniques
Zheng, Q., Rosenfeld, R., Vajda, S., & DeLisi, C. (1993) · Protein Science · doi:10.1002/pro.5560020806 · Cited by 66
Local moves: An efficient algorithm for simulation of protein folding
Elofsson, A., Grand, S. M. L., & Eisenberg, D. S. (1995) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.340230109 · Cited by 64
USING STURM SEQUENCES TO BRACKET REAL ROOTS OF POLYNOMIAL EQUATIONS
Hook, D. G., & McAree, P. R. (1990) · Elsevier eBooks · doi:10.1016/b978-0-08-050753-8.50089-9 · Cited by 40
Knapp, E. W., & Irgens‐Defregger, A. (1993) · Journal of Computational Chemistry · doi:10.1002/jcc.540140106 · Cited by 23
Baysal, C., & Meirovitch, H. (1997) · The Journal of Physical Chemistry A · doi:10.1021/jp9627537 · Cited by 22
Cited by
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
Protein Structure Modeling with MODELLER
Eswar, N., Eramian, D., Webb, B., Shen, M.-Y., & Sali, A. (2008) · Methods in Molecular Biology · doi:10.1007/978-1-60327-058-8_8 · Cited by 1,773
GalaxyRefine: protein structure refinement driven by side-chain repacking
Heo, L., Park, H., & Seok, C. (2013) · Nucleic Acids Research · doi:10.1093/nar/gkt458 · Cited by 1,363
Self-citationGalaxyWEB server for protein structure prediction and refinement
Ko, J., Park, H., Heo, L., & Seok, C. (2012) · Nucleic Acids Research · doi:10.1093/nar/gks493 · Cited by 1,007
Self-citation
Metadata
- Authors
- Coutsias, E. A., Seok, C., Jacobson, M. P., & Dill, K. A.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 2004-01-13
- Volume
- 25
- Issue
- 4
- Pages
- 510-528
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2137604324
- Cited by
- 292
- References
- 23
- FWCI
- 3.72
- Type
- journal article
- Language
- en
- Open access
- closed
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.