The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Deep architectures for protein contact map prediction
Open accessAbstract
Motivation: Residue–residue contact prediction is important for protein structure prediction and other applications. However, the accuracy of current contact predictors often barely exceeds 20% on long-range contacts, falling short of the level required for ab initio structure prediction. Results: Here, we develop a novel machine learning approach for contact map prediction using three steps of increasing resolution. First, we use 2D recursive neural networks to predict coarse contacts and orientations between secondary structure elements. Second, we use an energy-based method to align secondary structure elements and predict contact probabilities between residues in contacting alpha-helices or strands. Third, we use a deep neural network architecture to organize and progressively refine the prediction of contacts, integrating information over both space and time. We train the architecture on a large set of non-redundant proteins and test it on a large set of non-homologous domains, as well as on the set of protein domains used for contact prediction in the two most recent CASP8 and CASP9 experiments. For long-range contacts, the accuracy of the new CMAPpro predictor is close to 30%, a significant increase over existing approaches. Availability: CMAPpro is available as part of the SCRATCH suite at http://scratch.proteomics.ics.uci.edu/. Contact: pfbaldi@uci.edu Supplementary information: Supplementary data are available at Bioinformatics online.
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
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
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
Murzin, A. G., Brenner, S. E., Hubbard, T., & Chothia, C. (1995) · Journal of Molecular Biology · doi:10.1016/s0022-2836(05)80134-2 · Cited by 6,445
Exploring Strategies for Training Deep Neural Networks
Larochelle, H., Bengio, Y., Louradour, J., & Lamblin, P. (2009) · doi:10.1145/1577069.1577070 · Cited by 1,095
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-citationCorrelated mutations and residue contacts in proteins
Göbel, U., Sander, C., Schneider, R., & Valencia, A. (1994) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.340180402 · Cited by 863
Jones, D. T., Buchan, D. W. A., Cozzetto, D., & Pontil, M. (2012) · Bioinformatics · doi:10.1093/bioinformatics/btr638 · Cited by 770
Pollastri, G., Przybylski, D., Rost, B., & Baldi, P. (2002) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10082 · Cited by 743
Self-citationChandonia, J.-M. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh034 · Cited by 528
Dunn, S. D., Wahl, L. M., & Gloor, G. B. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btm604 · Cited by 483
Hormone phage: An enrichment method for variant proteins with altered binding properties
Bass, S., Greene, R., & Wells, J. A. (1990) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340080405 · Cited by 356
Prediction 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-citationImproved residue contact prediction using support vector machines and a large feature set
Cheng, J., & Baldi, P. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-113 · Cited by 240
Self-citationOlmea, O., & Valencia, A. (1997) · Folding and Design · doi:10.1016/s1359-0278(97)00060-6 · Cited by 203
Disentangling Direct from Indirect Co-Evolution of Residues in Protein Alignments
Burger, L., & van Nimwegen, E. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000633 · Cited by 191
Development and large scale benchmark testing of the PROSPECTOR_3 threading algorithm
Skolnick, J., Kihara, D., & Zhang, Y. (2004) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20106 · Cited by 168
PROFcon: novel prediction of long-range contacts
Punta, M., & Rost, B. (2005) · Computer applications in the biosciences · doi:10.1093/bioinformatics/bti454 · Cited by 163
Physically realistic homology models built with rosetta can be more accurate than their templates
Misura, K. M. S., Chivian, D. C., Rohl, C. A., Kim, D. E., & Baker, D. A. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0509355103 · Cited by 156
Contact prediction using mutual information and neural nets
Shackelford, G., & Karplus, K. J. (2007) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.21791 · Cited by 142
CASP9 results compared to those of previous casp experiments
Kryshtafovych, A., Fidelis, K. A., & Moult, J. (2011) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.23182 · Cited by 136
Wang, Z., Eickholt, J., & Cheng, J. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq058 · Cited by 103
Evaluation of residue–residue contact predictions in CASP9
Monastyrskyy, B., Fidelis, K. A., Tramontano, A. L., & Kryshtafovych, A. (2011) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.23160 · Cited by 103
Fariselli, P., Olmea, O., Valencia, A., & Casadio, R. (2001) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.1173 · Cited by 101
A two-stage approach for improved prediction of residue contact maps
Vullo, A., Walsh, I., & Pollastri, G. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-180 · Cited by 98
Assessment of domain boundary predictions and the prediction of intramolecular contacts in CASP8
Ezkurdia, I., Graña‐Castro, O., Izarzugaza, J. M. G., & Tress, M. L. (2009) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.22554 · Cited by 76
Nagata, K., Randall, A. Z., & Baldi, P. (2011) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.23170 · Cited by 66
Self-citationProtein topology from predicted residue contacts
Taylor, W. R., Jones, D. T., & Sadowski, M. I. (2011) · Protein Science · doi:10.1002/pro.2002 · Cited by 48
Björkholm, P., Daniluk, P., Kryshtafovych, A., Fidelis, K. A., Andersson, R., & Hvidsten, T. R. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp149 · Cited by 48
Predicted residue–residue contacts can help the scoring of 3D models
Tress, M. L., & Valencia, A. (2010) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.22714 · Cited by 43
Modular DAG–RNN Architectures for Assembling Coarse Protein Structures
Pollastri, G., Vullo, A., Frasconi, P., & Baldi, P. (2006) · Journal of Computational Biology · doi:10.1089/cmb.2006.13.631 · Cited by 26
Self-citation
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Opportunities and obstacles for deep learning in biology and medicine
Ching, T., Himmelstein, D. S., Beaulieu-Jones, B. K., Kalinin, A. A., Do, B. T., Way, G. P., Ferrero, E., Agapow, P.-M., Zietz, M., Hoffman, M. M., et al. (2018) · Journal of The Royal Society Interface · doi:10.1098/rsif.2017.0387 · Cited by 2,310
Deep learning in bioinformatics
Min, S., Lee, B., & Yoon, S. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbw068 · Cited by 1,465
Accurate De Novo Prediction of Protein Contact Map by Ultra-Deep Learning Model
Wang, S., Sun, S., Li, Z., Zhang, R., & Xu, J. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005324 · Cited by 931
Deep 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
Metadata
- Authors
- Di Lena, P., Nagata, K., & Baldi, P.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-07-30
- Volume
- 28
- Issue
- 19
- Pages
- 2449-2457
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2108101947
- Cited by
- 270
- References
- 30
- FWCI
- 5.34
- 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.