Cited by 13Machine Learning in BioinformaticsProtein Structure and DynamicsComputational Drug Discovery Methods

Accurate and Rapid Prediction of Protein p K a : Protein Language Models Reveal the Sequence–p K a Relationship

Open access
Xu, Shijie, Onoda, Akira·2025·Journal of Chemical Theory and Computation

Published version of a preprint

Abstract

Protein p K a prediction is a key challenge in computational biology. In this study, we present pKALM, a novel deep learning-based method for high-throughput protein p K a prediction. pKALM uses a protein language model (PLM) to capture the complex sequence–structure relationships of proteins. While traditionally considered a structure-based problem, our results show that a PLM pretrained on large-scale protein sequence databases can effectively learn this relationship and achieve state-of-the-art performance. pKALM accurately predicts the p K a values of six residues (Asp, Glu, His, Lys, Cys, and Tyr) and two termini with high precision and efficiency. It performs well at predicting both exposed and buried residues, which often deviate from standard p K a values measured in the solvent. We demonstrate a novel finding that predicted protein isoelectric points (pI) can be used to improve the accuracy of p K a prediction. High-throughput p K a prediction of the human proteome using pKALM achieves a speed of 4,965 p K a predictions per second, which is several orders of magnitude faster than existing state-of-the-art methods. The case studies illustrate the efficacy of pKALM in estimating p K a values and the constraints of the method. pKALM will thus be a valuable tool for researchers in the fields of biochemistry, biophysics, and drug design.

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.

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

Integrity signals

Registry

Crossref · 10.1021/acs.jctc.4c01288

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

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.

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.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Xu, S., & Onoda, A.
Affiliations
Hokkaido University (JP)
Corresponding author
Onoda, Akira
Venue
Journal of Chemical Theory and Computation
Published
2025-03-26
Volume
21
Issue
7
Pages
3752-3764
ISSN
  • 1549-9618 (ISSN-L)
  • 1549-9626
OpenAlex
W4408853280
Cited by
13
References
7
Citations by year
2026: 11 · 2025: 2
FWCI
3.93
Type
journal article
Language
en
Open access
Locations
  • Journal of Chemical Theory and Computation (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • Institutional Repositories DataBase (IRDB) (submittedVersion)
Funders
  • Hokkaido University (JPMJSP2119)
  • Japan Society for the Promotion of Science (JP24A202, JP24H02213, JP24K01533)
  • Japan International Cooperation Agency (JPMJSA2206)
Topics
  • 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
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
Keywords
protein language models, sequence-structure relationship, isoelectric point, buried residues, human proteome, high-throughput prediction, charged amino acids
MeSH terms
Deep Learning, Amino Acid Sequence, Humans, Isoelectric Point, Proteins, Computational Biology, Databases, Protein

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