The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Development and large scale benchmark testing of the PROSPECTOR_3 threading algorithm
Abstract
This article describes the PROSPECTOR_3 threading algorithm, which combines various scoring functions designed to match structurally related target/template pairs. Each variant described was found to have a Z‐score above which most identified templates have good structural (threading) alignments, Zstruct (Zgood). ‘Easy’ targets with accurate threading alignments are identified as single templates with Z > Zgood or two templates, each with Z > Zstruct, having a good consensus structure in mutually aligned regions. ‘Medium’ targets have a pair of templates lacking a consensus structure, or a single template for which Zstruct < Z < Zgood. PROSPECTOR_3 was applied to a comprehensive Protein Data Bank (PDB) benchmark composed of 1491 single domain proteins, 41–200 residues long and no more than 30% identical to any threading template. Of the proteins, 878 were found to be easy targets, with 761 having a root mean square deviation (RMSD) from native of less than 6.5 Å. The average contact prediction accuracy was 46%, and on average 17.6 residue continuous fragments were predicted with RMSD values of 2.0 Å. There were 606 medium targets identified, 87% (31%) of which had good structural (threading) alignments. On average, 9.1 residue, continuous fragments with RMSD of 2.5 Å were predicted. Combining easy and medium sets, 63% (91%) of the targets had good threading (structural) alignments compared to native; the average target/template sequence identity was 22%. Only nine targets lacked matched templates. Moreover, PROSPECTOR_3 consistently outperforms PSIBLAST. Similar results were predicted for open reading frames (ORFS) ≤200 residues in the M. genitalium, E. coli and S. cerevisiae genomes. Thus, progress has been made in identification of weakly homologous/analogous proteins, with very high alignment coverage, both in a comprehensive PDB benchmark as well as in genomes. Proteins 2004;55:000–000. © 2004 Wiley‐Liss, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Protein Structure Prediction and Structural Genomics
Baker, D., & Sali, A. (2001) · Science · doi:10.1126/science.1065659 · Cited by 1,587
Cited by
Scoring function for automated assessment of protein structure template quality
Zhang, Y., & Skolnick, J. (2004) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20264 · Cited by 2,392
Self-citationYang, J., Roy, A., & Zhang, Y. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt447 · Cited by 1,035
Self-citationDeep learning for computational chemistry
Goh, G. B., Hodas, N. O., & Vishnu, A. (2017) · Journal of Computational Chemistry · doi:10.1002/jcc.24764 · Cited by 809
Ab initio modeling of small proteins by iterative TASSER simulations
Wu, S., Skolnick, J., & Zhang, Y. (2007) · BMC Biology · doi:10.1186/1741-7007-5-17 · Cited by 514
Self-citationProgress and challenges in protein structure prediction
Zhang, Y. (2008) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2008.02.004 · Cited by 506
Self-citationTemplate-based modeling and free modeling by I-TASSER in CASP7
Zhang, Y. (2007) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21702 · Cited by 466
Self-citationWu, S., & Zhang, Y. (2008) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21945 · Cited by 375
Self-citationA threading-based method (FINDSITE) for ligand-binding site prediction and functional annotation
Brylinski, M., & Skolnick, J. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0707684105 · Cited by 333
Self-citationThe protein structure prediction problem could be solved using the current PDB library
Zhang, Y., & Skolnick, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407152101 · Cited by 297
Self-citationDeep architectures for protein contact map prediction
Di Lena, P., Nagata, K., & Baldi, P. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts475 · Cited by 270
Zhou, H., & Zhou, Y. (2005) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20308 · Cited by 254
Protein-Protein Complex Structure Predictions by Multimeric Threading and Template Recombination
Mukherjee, S., & Zhang, Y. (2011) · Structure · doi:10.1016/j.str.2011.04.006 · Cited by 174
Self-citationM-TASSER: An Algorithm for Protein Quaternary Structure Prediction
Chen, H., & Skolnick, J. (2008) · Biophysical Journal · doi:10.1529/biophysj.107.114280 · Cited by 68
Self-citationDESTINI: A deep-learning approach to contact-driven protein structure prediction
Gao, M., Zhou, H., & Skolnick, J. (2019) · Scientific Reports · doi:10.1038/s41598-019-40314-1 · Cited by 61
Self-citationThe role of local versus nonlocal physicochemical restraints in determining protein native structure
Skolnick, J., & Gao, M. (2021) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2020.10.008 · Cited by 21
Self-citationA novel sequence alignment algorithm based on deep learning of the protein folding code
Gao, M., & Skolnick, J. (2021) · Bioinformatics · doi:10.1093/bioinformatics/btaa810 · Cited by 18
Self-citation
Metadata
- Authors
- Skolnick, J., Kihara, D., & Zhang, Y.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2004-04-28
- Volume
- 56
- Issue
- 3
- Pages
- 502-518
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2121702291
- Cited by
- 168
- References
- 2
- FWCI
- 4.59
- 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.