Cited by 15Protein Structure and DynamicsMachine Learning in BioinformaticsComputational Drug Discovery Methods

SPIN-CGNN: Improved fixed backbone protein design with contact map-based graph construction and contact graph neural network

Open access
Zhang, Xing, Yin, Hongmei, Ling, Fei, Zhan, Jian, Zhou, Yaoqi·2023·PLOS Computational Biology

Published version of a preprint

Abstract

Recent advances in deep learning have significantly improved the ability to infer protein sequences directly from protein structures for the fix-backbone design. The methods have evolved from the early use of multi-layer perceptrons to convolutional neural networks, transformers, and graph neural networks (GNN). However, the conventional approach of constructing K-nearest-neighbors (KNN) graph for GNN has limited the utilization of edge information, which plays a critical role in network performance. Here we introduced SPIN-CGNN based on protein contact maps for nearest neighbors. Together with auxiliary edge updates and selective kernels, we found that SPIN-CGNN provided a comparable performance in refolding ability by AlphaFold2 to the current state-of-the-art techniques but a significant improvement over them in term of sequence recovery, perplexity, deviation from amino-acid compositions of native sequences, conservation of hydrophobic positions, and low complexity regions, according to the test by unseen structures, “hallucinated” structures and diffusion models. Results suggest that low complexity regions in the sequences designed by deep learning, for generated structures in particular, remain to be improved, when compared to the native sequences.

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.1371/journal.pcbi.1011330

Cites

9 of 9 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

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

Authors
Zhang, X., Yin, H., Ling, F., Zhan, J., & Zhou, Y.
Affiliations
  • Shenzhen Bay Laboratory (CN)
  • South China University of Technology (CN)
Corresponding author
  • Ling, Fei
  • Zhan, Jian
  • Zhou, Yaoqi
Venue
PLOS Computational Biology
Published
2023-12-07
Volume
19
Issue
12
Pages
e1011330
ISSN
  • 1553-734X (ISSN-L)
  • 1553-7358
OpenAlex
W4389429454
Cited by
15
References
9
Citations by year
2026: 4 · 2025: 2 · 2024: 9
FWCI
1.33
Type
journal article
Language
en
Open access
Locations
  • PLoS Computational Biology (publishedVersion, cc-by)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Griffith Research Online (submittedVersion, cc-by)
Funders
  • National Key Research and Development Program of China (NO.2021YFF1200400)
  • Major Program of Shenzhen Bay Laboratory (S201101001)
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 › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
Keywords
protein design, contact maps, graph neural networks, contact graphs, k-nearest neighbor graph, low complexity regions, diffusion models
MeSH terms
Amino Acid Sequence, Amino Acids, Diffusion, Cluster Analysis, Neural Networks, Computer

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