CoChat

TT3D: Leveraging precomputed protein 3D sequence models to predict protein–protein interactions

Open access
Sledzieski, Samuel, Devkota, Kapil, Singh, Rohit, Cowen, Lenore, Berger, Bonnie · 2023 · Bioinformatics
Cited by 29

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Abstract

Motivation: High-quality computational structural models are now precomputed and available for nearly every protein in UniProt. However, the best way to leverage these models to predict which pairs of proteins interact in a high-throughput manner is not immediately clear. The recent Foldseek method of van Kempen et al. encodes the structural information of distances and angles along the protein backbone into a linear string of the same length as the protein string, using tokens from a 21-letter discretized structural alphabet (3Di). Results: We show that using both the amino acid sequence and the 3Di sequence generated by Foldseek as inputs to our recent deep-learning method, Topsy-Turvy, substantially improves the performance of predicting protein–protein interactions cross-species. Thus TT3D (Topsy-Turvy 3D) presents a way to reuse all the computational effort going into producing high-quality structural models from sequence, while being sufficiently lightweight so that high-quality binary protein–protein interaction predictions across all protein pairs can be made genome-wide. Availability and Implementation: TT3D is available at https://github.com/samsledje/D-SCRIPT. An archived version of the code at time of submission can be found at https://zenodo.org/records/10037674.

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.

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

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btad663

Cites

13 of 13 references verified0 citation errors · 0 not checkable

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.

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.

Citations

Cites

Show all 13 references

Research works printed but not linked: 10

  1. Altschul, 1997, Gapped BLAST and PSI-BLAST: a new generation of protein database search programs, Nucleic Acids Res, 25, 3389, 10.1093/nar/25.17.3389 · DOI · Paper page
  2. Burley, 2023, RCSB protein data bank (RCSB.org): delivery of experimentally-determined PDB structures alongside one million computed structure models of proteins from artificial intelligence/machine learning, Nucleic Acids Res, 51, D488, 10.1093/nar/gkac1077 · DOI · Paper page
  3. Harini, 2023, Protein–Protein Interactions: Methods in Molecular Biology 2690, 355, 10.1007/978-1-0716-3327-4_28 · DOI
  4. Li, 2006, Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences, Bioinformatics, 22, 1658, 10.1093/bioinformatics/btl158 · DOI · Paper page
  5. Porter, 2019, What method to use for protein–protein docking?, Curr Opin Struct Biol, 55, 1, 10.1016/j.sbi.2018.12.010 · DOI
  6. Singh, 2022, Topsy-Turvy: integrating a global view into sequence-based PPI prediction, Bioinformatics, 38, i264, 10.1093/bioinformatics/btac258 · DOI · Paper page
  7. Sledzieski, 2021, D-SCRIPT translates genome to phenome with sequence-based, structure-aware, genome-scale predictions of protein–protein interactions, Cell Syst, 12, 969, 10.1016/j.cels.2021.08.010 · DOI · Paper page
  8. Smedley, 2009, BioMart–biological queries made easy, BMC Genomics, 10, 22, 10.1186/1471-2164-10-22 · DOI · Paper page
  9. Van Den Oord, 2017, Neural discrete representation learning, Adv Neural Inf Process Syst, 30, 6306
  10. Zhu, 2023, Evaluation of AlphaFold-Multimer prediction on multi-chain protein complexes, Bioinformatics, 39, btad424, 10.1093/bioinformatics/btad424 · DOI · Paper page

Cited by

Metadata

Authors
Sledzieski, S., Devkota, K., Singh, R., Cowen, L., & Berger, B.
Venue
Bioinformatics
Published
2023-10-28
Volume
39
Issue
11
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W4388007030
Cited by
29
References
13
FWCI
2.17
Type
journal article
Language
en
Open access
gold
Funders
  • National Science Foundation Graduate Research Fellowship (2141064)
  • National Science Foundation (CCF-1934553)
  • National Institutes of Health (R35GM141861)

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.