EUVIMEDEUVIMED entdecken
Open Access

Protein domain embeddings for fast and accurate similarity search

Benjamin Giovanni Iovino iD, Haixu Tang iD, Yuzhen Ye iD

Genome Research · 2024-09 · 34 (9) · 1434-1444

DOI: 10.1101/gr.279127.124 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Genome Research, 2024-09. Verfasst von Benjamin Giovanni Iovino und 2 weiteren Autor:innen. Beteiligte Einrichtung: Luddy School of Informatics, Computing and Engineering, Indiana University, Bloomington, Indiana 47408, USA. Hauptthemen laut MEDLINE: Protein Domains, Algorithms. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 37 Literaturangaben. Der Volltext ist frei in PubMed Central verfügbar. Gefördert von: NIAID NIH HHS, National Institutes of Health, National Institute of Allergy and Infectious Diseases.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Recently developed protein language models have enabled a variety of applications with the protein contextual embeddings they produce. Per-protein representations (each protein is represented as a vector of fixed dimension) can be derived via averaging the embeddings of individual residues, or applying matrix transformation techniques such as the discrete cosine transformation (DCT) to matrices of residue embeddings. Such protein-level embeddings have been applied to enable fast searches of similar proteins; however, limitations have been found; for example, PROST is good at detecting global homologs but not local homologs, and knnProtT5 excels for proteins with single domains but not multidomain proteins. Here, we propose a novel approach that first segments proteins into domains (or subdomains) and then applies the DCT to the vectorized embeddings of residues in each domain to infer domain-level contextual vectors. Our approach, called DCTdomain, uses predicted contact maps from ESM-2 for domain segmentation, which is formulated as a domain segmentation problem and can be solved using a recursive cut algorithm (RecCut in short) in quadratic time to the protein length; for comparison, an existing approach for domain segmentation uses a cubic-time algorithm. We show such domain-level contextual vectors (termed as DCT fingerprints ) enable fast and accurate detection of similarity between proteins that share global similarities but with undefined extended regions between shared domains, and those that only share local similarities. In addition, tests on a database search benchmark show that the DCTdomain is able to detect distant homologs by leveraging the structural information in the contextual embeddings.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Protein DomainsAlgorithmsProteinsDatabases, ProteinComputational BiologyHumans

Substanzen

Proteins

Autor:innen und Institutionen

  • Luddy School of Informatics, Computing and Engineering, Indiana University, Bloomington, Indiana 47408, USA.
  • Luddy School of Informatics, Computing and Engineering, Indiana University, Bloomington, Indiana 47408, USA yye@iu.edu.

ORCID-Profile: Benjamin Giovanni Iovino, Haixu Tang, Yuzhen Ye

Förderung

  • NIAID NIH HHS
  • National Institutes of Health
  • National Institute of Allergy and Infectious Diseases
  • National Science Foundation

Zitieren

APA

Iovino, B. G., Tang, H., & Ye, Y. (2024). Protein domain embeddings for fast and accurate similarity search. Genome Research. https://doi.org/10.1101/gr.279127.124

Vancouver

Iovino BG, Tang H, Ye Y. Protein domain embeddings for fast and accurate similarity search. Genome Research. 2024. doi:10.1101/gr.279127.124

BibTeX
@article{Iovino2024,
  author = {Iovino, Benjamin Giovanni and Tang, Haixu and Ye, Yuzhen},
  title = {Protein domain embeddings for fast and accurate similarity search},
  journal = {Genome Research},
  year = {2024},
  doi = {10.1101/gr.279127.124}
}
Kostenlos starten →