EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

BioLiP3: a protein–ligand affinity database integrating curated data with LLM-enabled literature mining

Hao Lu iD, Xiaodong Ma, Runhua Zhang, Yang Zhang

Nucleic Acids Research · 06.11.2026

DOI: 10.1093/nar/gkag1141 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Nucleic Acids Research, online erschienen am 06.11.2026. Verfasst von Hao Lu und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science, School of Computing, National University of Singapore, Singapore 17417, Singapore. Die Arbeit nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Education, Singapore, Agency for Science, Technology and Research, National Research Foundation, Singapore.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Quantitative binding affinities and three-dimensional protein–ligand structures provide complementary information essential for structure-based drug discovery, yet these data remain largely disconnected across existing databases and the biomedical literature. We present BioLiP3, a major extension of BioLiP that expands quantitative affinity coverage 13-fold within its structure-centered framework for biologically relevant interactions. BioLiP3 contains 593 423 affinity records, of which 591 820 are linked to three-dimensional protein–ligand structures: 45 386 experimentally resolved PDB complexes, 528 732 BindingDB-derived records with computationally generated structures, and 17 702 structure-linked records derived from LLM-mined biomedical literature. For records lacking experimental complex structures, we generate structural models using available experimental or predicted receptor structures, binding-site identification, and molecular docking, with experimental and computational structures explicitly distinguished. To complement existing databases, we developed a hybrid literature-mining workflow combining large language models with rule-based validation and independent verification to extract Ki, Kd, IC50, and EC50 measurements from PubMed abstracts while preserving provenance. BioLiP3 further integrates ligand-binding sites and protein, functional, and structural annotations via cross-references to PDB, UniProt, NCBI Taxonomy, PubChem, and original literature. Taken together, these advances make BioLiP3 a unified resource for data-driven protein–ligand interaction studies and structure-based drug design. BioLiP3 is freely accessible at https://zhanggroup.org/BioLiP/.

Autor:innen und Institutionen

  • Department of Computer Science, School of Computing, National University of Singapore, Singapore 17417, Singapore.
  • College of Computer Science and Technology, Ocean University of China, Qingdao 266100, China.
  • Center for AI and Computational Biology, Institute of Systems Medicine, Chinese Academy of Medical Sciences, Suzhou 215123, China.
  • Department of Biochemistry, Yong Loo Lin School of Medicine, National University of Singapore, Singapore 17596, Singapore.
  • Cancer Science Institute of Singapore, National University of Singapore, Singapore 117599, Singapore.

ORCID-Profile: Hao Lu

Förderung

  • Ministry of Education, Singapore
  • Agency for Science, Technology and Research
  • National Research Foundation, Singapore

Zitieren

APA

Lu, H., Ma, X., Zhang, R., & Zhang, Y. (2026). BioLiP3: a protein–ligand affinity database integrating curated data with LLM-enabled literature mining. Nucleic Acids Research. https://doi.org/10.1093/nar/gkag1141

Vancouver

Lu H, Ma X, Zhang R, Zhang Y. BioLiP3: a protein–ligand affinity database integrating curated data with LLM-enabled literature mining. Nucleic Acids Research. 2026. doi:10.1093/nar/gkag1141

BibTeX
@article{Lu2026,
  author = {Lu, Hao and Ma, Xiaodong and Zhang, Runhua and Zhang, Yang},
  title = {BioLiP3: a protein–ligand affinity database integrating curated data with LLM-enabled literature mining},
  journal = {Nucleic Acids Research},
  year = {2026},
  doi = {10.1093/nar/gkag1141}
}
Kostenlos starten →