The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cross-Modality and Self-Supervised Protein Embedding for Compound–Protein Affinity and Contact Prediction
Open accessPreprint — published as 10.1093/bioinformatics/btac470 · Paper page
Abstract
Motivation: Computational methods for compound–protein affinity and contact (CPAC) prediction aim at facilitating rational drug discovery by simultaneous prediction of the strength and the pattern of compound–protein interactions. Although the desired outputs are highly structure-dependent, the lack of protein structures often makes structure-free methods rely on protein sequence inputs alone. The scarcity of compound–protein pairs with affinity and contact labels further limits the accuracy and the generalizability of CPAC models. Results: To overcome the aforementioned challenges of structure naivety and labelled-data scarcity, we introduce cross-modality and self-supervised learning, respectively, for structure-aware and task-relevant protein embedding. Specifically, protein data are available in both modalities of 1D amino-acid sequences and predicted 2D contact maps, that are separately embedded with recurrent and graph neural networks, respectively, as well as jointly embedded with two cross-modality schemes. Furthermore, both protein modalities are pretrained under various self-supervised learning strategies, by leveraging massive amount of unlabelled protein data. Our results indicate that individual protein modalities differ in their strengths of predicting affinities or contacts. Proper cross-modality protein embedding combined with self-supervised learning improves model generalizability when predicting both affinities and contacts for unseen proteins. Availability: Data and source codes are available at https://github.com/Shen-Lab/CPAC . Contact: yshen@tamu.edu Supplementary information: Supplementary data are included.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Highly accurate protein structure prediction with AlphaFold
Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03819-2 · Cited by 43,764
Flagged first, then by citations
Research works printed but not linked: 30
- 10.1126/science.abj8754 · DOI · Paper page
- 10.1093/nar/28.1.235 · DOI · Paper page
- 10.1002/(SICI)1098-1128(199601)16:1<3::AID-MED1>3.0.CO;2-6 · DOI
- 2020, Energy-based graph convolutional networks for scoring protein docking models, Proteins: Structure, Function, and Bioinformatics, 88, 1091, 10.1002/prot.25888 · DOI
- 10.1371/journal.pone.0018910 · DOI
- 2018, Bert: Pre-training of deep bidirectional transformers for language understanding, arXiv
- El Hihi, S. and Bengio, Y. (1996). Hierarchical recurrent neural networks for longterm dependencies. In Advances in neural information processing systems, pages 493–499.
- 2018, Interpretable drug target prediction using deep neural representation, IJCAI, 2018, 3371
- 2017, Inductive representation learning on large graphs, arXiv
- 2020, Drug–target affinity prediction using graph neural network and contact maps, RSC Advances, 10, 20701, 10.1039/D0RA02297G · DOI · Paper page
- 10.1093/bioinformatics/btz111 · DOI
- 2020, Explainable deep relational networks for predicting compound–protein affinities and contacts, Journal of Chemical Information and Modeling, 61, 46
- 2016, Semi-supervised classification with graph convolutional networks, arXiv
- 10.1002/pro.3289 · DOI
- 10.1016/j.cels.2020.03.00 · DOI
- 10.1093/nar/gkl999 · DOI
- 10.1093/bioinformatics/btu626 · DOI
- 10.1093/NAR/GKAA913 · DOI · Paper page
- 10.1093/bioinformatics/bty593 · DOI
- 10.1038/nrd.2016.230 · DOI · Paper page
- 2019, Lxmert: Learning cross-modality encoder representations from transformers, arXiv
- 2019, Compound–protein interaction prediction with end-to-end learning of neural networks for graphs and sequences, Bioinformatics, 35, 309, 10.1093/bioinformatics/bty535 · DOI · Paper page
- 2017, Graph attention networks, arXiv
- 10.1073/pnas.1821309116 · DOI · Paper page
- 2018, How powerful are graph neural networks?, arXiv
- 2020, Cross-modality protein embedding for compoundprotein affinity and contact prediction, arXiv
- You, Y. , Chen, T. , Sui, Y. , Chen, T. , Wang, Z. , and Shen, Y. (2020a). Graph contrastive learning with augmentations. Advances in Neural Information Processing Systems, 33.
- You, Y. , Chen, T. , Wang, Z. , and Shen, Y. (2020b). When does self-supervision help graph convolutional networks? In International Conference on Machine Learning, pages 10871–10880.PMLR.
- 2021, Graph contrastive learning automated, arXiv
- 2022, Bringing your own view: Graph contrastive learning without prefabricated data augmentations, arXiv
Metadata
- Authors
- You, Y., & Shen, Y.
- Affiliations
- Texas A&M University (US)
- Corresponding author
- Shen, Yang
- ORCID
- Shen, Yang
- Venue
- Bioinformatics
- Publisher
- openRxiv
- Published
- 2022-07-20
- Volume
- 38
- Issue
- Supplement_2
- Pages
- ii68-ii74
- ISSN
- 1367-4803 (ISSN-L)
- PMC
- PMC9486597
- OpenAlex
- W4296777853
- Cited by
- 20
- References
- 1
- Citations by year
- 2026: 4 · 2025: 5 · 2024: 6 · 2023: 3 · 2022: 2
- FWCI
- 2.16
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Bioinformatics (publishedVersion)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc-nd)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- Funders
- National Science Foundation (ECCB2022, 1943008)
- National Institutes of Health (ECCB2022)
- High Performance Research Computing, Texas A and M University
- National Institute of General Medical Sciences (R35GM124952)
- Topics
- Life Sciences › Pharmacology, Toxicology and Pharmaceutics › Drug Discovery › Computational Drug Discovery Methods
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
- Keywords
- protein embeddings, cross-modal learning, self-supervised learning, amino acid sequence, contact maps, graph neural networks, recurrent neural networks, drug discovery
- MeSH terms
- Amino Acid Sequence, Proteins, Software, Neural Networks, Computer, Drug Discovery
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