The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
SSpro/ACCpro 5: almost perfect prediction of protein secondary structure and relative solvent accessibility using profiles, machine learning and structural similarity
Open accessAbstract
Motivation: Accurately predicting protein secondary structure and relative solvent accessibility is important for the study of protein evolution, structure and function and as a component of protein 3D structure prediction pipelines. Most predictors use a combination of machine learning and profiles, and thus must be retrained and assessed periodically as the number of available protein sequences and structures continues to grow. Results: We present newly trained modular versions of the SSpro and ACCpro predictors of secondary structure and relative solvent accessibility together with their multi-class variants SSpro8 and ACCpro20. We introduce a sharp distinction between the use of sequence similarity alone, typically in the form of sequence profiles at the input level, and the additional use of sequence-based structural similarity, which uses similarity to sequences in the Protein Data Bank to infer annotations at the output level, and study their relative contributions to modern predictors. Using sequence similarity alone, SSpro’s accuracy is between 79 and 80% (79% for ACCpro) and no other predictor seems to exceed 82%. However, when sequence-based structural similarity is added, the accuracy of SSpro rises to 92.9% (90% for ACCpro). Thus, by combining both approaches, these problems appear now to be essentially solved, as an accuracy of 100% cannot be expected for several well-known reasons. These results point also to several open technical challenges, including (i) achieving on the order of ≥80% accuracy, without using any similarity with known proteins and (ii) achieving on the order of ≥85% accuracy, using sequence similarity alone. Availability and implementation: SSpro, SSpro8, ACCpro and ACCpro20 programs, data and web servers are available through the SCRATCH suite of protein structure predictors at http://scratch.proteomics.ics.uci.edu . Contact: pfbaldi@uci.edu
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
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
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
Kabsch, W., & Sander, C. (1983) · Biopolymers · doi:10.1002/bip.360221211 · Cited by 15,320
Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences
Li, W., & Godzik, A. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl158 · Cited by 11,410
UniRef: comprehensive and non-redundant UniProt reference clusters
Suzek, B. E., Huang, H., McGarvey, P., Mazumder, R., & Wu, C. H. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm098 · Cited by 1,613
Scalable web services for the PSIPRED Protein Analysis Workbench
Buchan, D. W. A., Minneci, F., Nugent, T. C. O., Bryson, K., & Jones, D. T. (2013) · Nucleic Acids Research · doi:10.1093/nar/gkt381 · Cited by 1,318
SCRATCH: a protein structure and structural feature prediction server
Cheng, J., Randall, A. Z., Sweredoski, M. J., & Baldi, P. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki396 · Cited by 1,044
Self-citationPollastri, G., Przybylski, D., Rost, B., & Baldi, P. (2002) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10082 · Cited by 743
Self-citationThe dropout learning algorithm
Baldi, P., & Sadowski, P. (2014) · Artificial Intelligence · doi:10.1016/j.artint.2014.02.004 · Cited by 340
Self-citationPrediction of coordination number and relative solvent accessibility in proteins
Pollastri, G., Baldi, P., Fariselli, P., & Casadio, R. (2002) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10069 · Cited by 249
Self-citation
Cited by
Highly Accurate Machine Fault Diagnosis Using Deep Transfer Learning
Shao, S., McAleer, S., Yan, R., & Baldi, P. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2864759 · Cited by 1,635
Self-citationRaptorX-Property: a web server for protein structure property prediction
Wang, S., Li, W., Liu, S., & Xu, J. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkw306 · Cited by 565
Protein Secondary Structure Prediction Using Deep Convolutional Neural Fields
Wang, S., Peng, J., Ma, J., & Xu, J. (2016) · Scientific Reports · doi:10.1038/srep18962 · Cited by 563
Karimi, M., Wu, D., Wang, Z., & Shen, Y. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz111 · Cited by 536
Ali, M., Pandey, R. K., Khatoon, N., Narula, A., Mishra, A., & Prajapati, V. K. (2017) · Scientific Reports · doi:10.1038/s41598-017-09199-w · Cited by 388
Site-specific mapping of the human SUMO proteome reveals co-modification with phosphorylation
Hendriks, I. A., Lyon, D., Young, C., Jensen, L. J., Vertegaal, A. C. O., & Nielsen, M. L. (2017) · Nature Structural & Molecular Biology · doi:10.1038/nsmb.3366 · Cited by 382
Heffernan, R., Yang, Y., Paliwal, K., & Zhou, Y. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx218 · Cited by 357
Protein Design: From the Aspect of Water Solubility and Stability
Qing, R., Hao, S., Smorodina, E., Jin, D., Zalevsky, A., & Zhang, S. (2022) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00757 · Cited by 312
Deep learning methods in protein structure prediction
Torrisi, M., Pollastri, G., & Le, Q. (2020) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2019.12.011 · Cited by 284
Assessment of contact predictions in CASP12: Co‐evolution and deep learning coming of age
Schaarschmidt, J., Monastyrskyy, B., Kryshtafovych, A., & Bonvin, A. M. J. J. (2018) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25407 · Cited by 177
Deep learning in biomedical data science
Baldi, P. (2018) · Annual Review of Biomedical Data Science · doi:10.1146/annurev-biodatasci-080917-013343 · Cited by 119
Explainable Deep Relational Networks for Predicting Compound-Protein Affinities and Contacts
Karimi, M., Wu, D., Wang, Z., & Shen, Y. (2019) · doi:10.1101/2019.12.28.890103 · Cited by 64
Explainable Deep Relational Networks for Predicting Compound–Protein Affinities and Contacts
Karimi, M., Wu, D., Wang, Z., & Shen, Y. (2021) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.0c00866 · Cited by 64
Jain, T., Boland, T., Lilov, A., Burnina, I., Brown, M., Xu, Y., & Vásquez, M. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx519 · Cited by 61
Banerjee, S., Bhandary, P., Woodhouse, M., Sen, T. Z., Wise, R. P., & Andorf, C. M. (2021) · BMC Bioinformatics · doi:10.1186/s12859-021-04120-9 · Cited by 35
Inner and Outer Recursive Neural Networks for Chemoinformatics Applications
Urban, G., Subrahmanya, N., & Baldi, P. (2018) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.7b00384 · Cited by 25
Self-citationYang, Z., & Tsui, S. K.-W. (2018) · Journal of Proteome Research · doi:10.1021/acs.jproteome.8b00262 · Cited by 19
Pulse labeling reveals the tail end of protein folding by proteome profiling
Zhu, M., Kuechler, E. R., Wong, R. W. K., Calabrese, G., Sitarik, I. M., Rana, V., Stoynov, N., O’Brien, E. P., Gsponer, J., & Mayor, T. (2022) · Cell Reports · doi:10.1016/j.celrep.2022.111096 · Cited by 13
Metadata
- Authors
- Magnan, C. N., & Baldi, P.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2014-05-24
- Volume
- 30
- Issue
- 18
- Pages
- 2592-2597
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2131474431
- Cited by
- 363
- References
- 14
- FWCI
- 9.37
- 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.