Evidence map›Paper›PMID 39123049›Full record

ArticleNature biotechnology2025

Fast, sensitive detection of protein homologs using deep dense retrieval.

Liang Hong, Zhihang Hu, Siqi Sun, Xiangru Tang, Jiuming Wang, Qingxiong Tan, Liangzhen Zheng, Sheng Wang, Sheng Xu, Irwin King and 2 more

Abstract read
In one paragraph

Article in Nature biotechnology, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 23 papers.

0numbers the graph read from it
0cells of the map it votes in
23citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

23 citing papers in PubMed.

  1. Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Scalable homology detection with ERAST.Nature biotechnology · 2026
    Article
  7. Review
  8. Article
  9. Article
  10. Article
  11. Review
  12. Review
  13. TheInternational journal of hypertension · 2026
    Article
  14. Exploring the protein universe with distant similarity detection methods.Protein science : a publication of the Protein Society · 2026
    Review
  15. Review
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

12 authors.

Liang Hong *Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China.
Zhihang Hu *Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China.
Siqi Sun *Research Institute of Intelligent Complex Systems, Fudan University, Shanghai, China. siqisun@fudan.edu.cn.
Xiangru Tang *Department of Computer Science, Yale University, New Haven, CT, USA.
Jiuming WangDepartment of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China.
Qingxiong TanDepartment of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China.
Liangzhen ZhengShenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China.
Sheng WangShenzhen Institute of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China.
Sheng XuResearch Institute of Intelligent Complex Systems, Fudan University, Shanghai, China.
Irwin KingDepartment of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China.
Mark GersteinDepartment of Computer Science, Yale University, New Haven, CT, USA. mark@gersteinlab.org.
Yu Li *Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China. liyu@cse.cuhk.edu.hk.ORCID http://orcid.org/0000-0002-3664-6722

Funding

Innovation and Technology Fund (ITF) GHP/065/21SZResearch Grants Council, University Grants Committee (RGC, UGC) CUHK 24204023Research Grants Council, University Grants Committee (RGC, UGC) PF22-73180
6 · The paper itself

Abstract

The identification of protein homologs in large databases using conventional methods, such as protein sequence comparison, often misses remote homologs. Here, we offer an ultrafast, highly sensitive method, dense homolog retriever (DHR), for detecting homologs on the basis of a protein language model and dense retrieval techniques. Its dual-encoder architecture generates different embeddings for the same protein sequence and easily locates homologs by comparing these representations. Its alignment-free nature improves speed and the protein language model incorporates rich evolutionary and structural information within DHR embeddings. DHR achieves a >10% increase in sensitivity compared to previous methods and a >56% increase in sensitivity at the superfamily level for samples that are challenging to identify using alignment-based approaches. It is up to 22 times faster than traditional methods such as PSI-BLAST and DIAMOND and up to 28,700 times faster than HMMER. The new remote homologs exclusively found by DHR are useful for revealing connections between well-characterized proteins and improving our knowledge of protein evolution, structure and function.

Indexed as

Computational BiologyProteinsSequence Analysis, ProteinSequence Homology, Amino AcidAlgorithmsDatabases, ProteinSequence AlignmentProteins

Identifiers

PMID39123049
PMCPMC12167706

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.