Cited by 94Protein Structure and DynamicsMachine Learning in BioinformaticsEnzyme Structure and Function

Ensembling multiple raw coevolutionary features with deep residual neural networks for contact‐map prediction in CASP13

Open access
Li, Yang, Zhang, Chengxin, Bell, Eric W., Yu, Dong‐Jun, Zhang, Yang·2019·Proteins: Structure, Function, and Bioinformatics

Abstract

We report the results of residue‐residue contact prediction of a new pipeline built purely on the learning of coevolutionary features in the CASP13 experiment. For a query sequence, the pipeline starts with the collection of multiple sequence alignments (MSAs) from multiple genome and metagenome sequence databases using two complementary Hidden Markov Model (HMM)‐based searching tools. Three profile matrices, built on covariance, precision, and pseudolikelihood maximization respectively, are then created from the MSAs, which are used as the input features of a deep residual convolutional neural network architecture for contact‐map training and prediction. Two ensembling strategies have been proposed to integrate the matrix features through end‐to‐end training and stacking, resulting in two complementary programs called TripletRes and ResTriplet, respectively. For the 31 free‐modeling domains that do not have homologous templates in the PDB, TripletRes and ResTriplet generated comparable results with an average accuracy of 0.640 and 0.646, respectively, for the top L/5 long‐range predictions, where 71% and 74% of the cases have an accuracy above 0.5. Detailed data analyses showed that the strength of the pipeline is due to the sensitive MSA construction and the advanced strategies for coevolutionary feature ensembling. Domain splitting was also found to help enhance the contact prediction performance. Nevertheless, contact models for tail regions, which often involve a high number of alignment gaps, and for targets with few homologous sequences are still suboptimal. Development of new approaches where the model is specifically trained on these regions and targets might help address these problems.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1002/prot.25798

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. [32]Remmert M, Biegert A, Hauser A, Soding J. HHblits: lightning-fast iterative protein sequence searching by HMM-HMM alignment. Nat Methods 2011; 9(2): 173– 175. 22198341
  2. [36]Yu F, Koltun V. Multi-scale context aggregation by dilated convolutions. arXiv preprint arXiv: 151107122 2015.
  3. [38]Kingma DP, Ba J. Adam: A method for stochastic optimization. arXiv preprint arXiv: 14126980 2014.

Cited by

Sorted by citations

Authors
Li, Y., Zhang, C., Bell, E. W., Yu, D., & Zhang, Y.
Affiliations
University of Michigan (US)
Corresponding author
  • Yu, Dong‐Jun
  • Zhang, Yang
Venue
Proteins: Structure, Function, and Bioinformatics
Publisher
Wiley
Published
2019-08-22
Volume
87
Issue
12
Pages
1082-1091
ISSN
  • 0887-3585 (ISSN-L)
  • 1097-0134
OpenAlex
W2968295962
Cited by
94
References
37
Citations by year
2026: 1 · 2025: 1 · 2024: 5 · 2023: 7 · 2022: 22 · 2021: 36 · 2020: 16 · 2019: 6
FWCI
6.62
Type
journal article
Language
en
Open access
Locations
  • Proteins Structure Function and Bioinformatics (publishedVersion)
  • PubMed (publishedVersion)
  • PubMed Central (acceptedVersion)
  • Deep Blue (University of Michigan) (submittedVersion)
Funders
  • Fundamental Research Funds for the Central Universities (30918011104)
  • National Institute of General Medical Sciences (GM083107, GM116960)
  • National Natural Science Foundation of China (31628003, 61373062, 61772273)
  • National Science Foundation (DBI1564756, ACI‐1548562)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Physical Sciences › Materials Science › Materials Chemistry › Enzyme Structure and Function
Keywords
residue-residue contact prediction, multiple sequence alignment, deep residual convolutional neural network, stacking ensemble, CASP13, domain splitting, alignment gaps, long-range contacts
MeSH terms
Machine Learning, Algorithms, Models, Molecular, Protein Conformation, Proteins, Sequence Alignment, Neural Networks, Computer, Computational Biology, Sequence Analysis, Protein, Databases, Protein, Metagenome

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