The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Ab initio protein structure assembly using continuous structure fragments and optimized knowledge‐based force field
Open accessAbstract
Ab initio protein folding is one of the major unsolved problems in computational biology owing to the difficulties in force field design and conformational search. We developed a novel program, QUARK, for template‐free protein structure prediction. Query sequences are first broken into fragments of 1–20 residues where multiple fragment structures are retrieved at each position from unrelated experimental structures. Full‐length structure models are then assembled from fragments using replica‐exchange Monte Carlo simulations, which are guided by a composite knowledge‐based force field. A number of novel energy terms and Monte Carlo movements are introduced and the particular contributions to enhancing the efficiency of both force field and search engine are analyzed in detail. QUARK prediction procedure is depicted and tested on the structure modeling of 145 nonhomologous proteins. Although no global templates are used and all fragments from experimental structures with template modeling score >0.5 are excluded, QUARK can successfully construct 3D models of correct folds in one‐third cases of short proteins up to 100 residues. In the ninth community‐wide Critical Assessment of protein Structure Prediction experiment, QUARK server outperformed the second and third best servers by 18 and 47% based on the cumulative Z‐score of global distance test‐total scores in the FM category. Although ab initio protein folding remains a significant challenge, these data demonstrate new progress toward the solution of the most important problem in the field. Proteins 2012; © 2012 Wiley Periodicals, Inc.
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
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
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
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Kabsch, W., & Sander, C. (1983) · Biopolymers · doi:10.1002/bip.360221211 · Cited by 15,320
Principles that Govern the Folding of Protein Chains
Anfinsen, C. B. (1973) · Science · doi:10.1126/science.181.4096.223 · Cited by 7,096
How significant is a protein structure similarity with TM-score = 0.5?
Xu, J., & Zhang, Y. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq066 · Cited by 1,142
Self-citationLGA: a method for finding 3D similarities in protein structures
Zemla, A. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg571 · Cited by 1,069
Zhou, H., & Zhou, Y. (2002) · Protein Science · doi:10.1110/ps.0217002 · Cited by 902
Cited by
Advances in protein structure prediction and design
Kuhlman, B., & Bradley, P. (2019) · Nature Reviews Molecular Cell Biology · doi:10.1038/s41580-019-0163-x · Cited by 806
Zhang, C., Freddolino, L., & Zhang, Y. (2017) · Nucleic Acids Research · doi:10.1093/nar/gkx366 · Cited by 606
Self-citationEnd-to-End Differentiable Learning of Protein Structure
AlQuraishi, M. (2019) · Cell Systems · doi:10.1016/j.cels.2019.03.006 · Cited by 371
The Road to Metagenomics: From Microbiology to DNA Sequencing Technologies and Bioinformatics
Escobar-Zepeda, A., Vera-Ponce de León, A., & Sanchez-Flores, A. (2015) · Frontiers in Genetics · doi:10.3389/fgene.2015.00348 · Cited by 363
The translation of non-canonical open reading frames controls mucosal immunity
Jackson, R., Kroehling, L., Khitun, A., Bailis, W., Jarret, A., York, A. G., Khan, O. M., Brewer, J. R., Skadow, M. H., Duizer, C., et al. (2018) · Nature · doi:10.1038/s41586-018-0794-7 · Cited by 242
Metadata
- Authors
- Xu, D., & Zhang, Y.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2012-04-13
- Volume
- 80
- Issue
- 7
- Pages
- 1715-1735
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2171559274
- Cited by
- 856
- References
- 8
- FWCI
- 22.30
- Type
- journal article
- Language
- en
- Open access
- green
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.