Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 352

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

A simple clustering algorithm can be accurate enough for use in calculations of p K s in macromolecules

Myers, Jonathan, Grothaus, Greg, Narayanan, Shivaram, Onufriev, Alexey·2006·Proteins: Structure, Function, and Bioinformatics

Abstract

Structure and function of macromolecules depend critically on the ionization states of their acidic and basic groups. Most current structure‐based theoretical methods that predict p K of ionizable groups in macromolecules include, as one of the key steps, a computation of the partition sum (Boltzmann average) over all possible protonation microstates. As the number of these microstates depends exponentially on the number of ionizable groups present in the molecule, direct computation of the sum is not realistically feasible for many typical proteins that may have tens or even hundreds of ionizable groups. We have tested a simple and robust approximate algorithm for computing these partition sums for macromolecules. The method subdivides the interacting sites into independent clusters, based upon the strength of site–site electrostatic interaction. The resulting partition function is factorizable into computationally manageable components. Two variants of the approach are presented and validated on a representative test set of 602 proteins, by comparing the p K1/2 values computed by the proposed method with those obtained by the standard Monte Carlo approach used as a reference. With 95% confidence, the relative error introduced by the more accurate of the two methods is less than 0.25 pK units. The algorithms are one to two orders of magnitude faster than the Monte Carlo method, with the typical settings. A graphical representation is introduced that visualizes the clusters of strong site–site interactions in the context of the three‐dimensional (3D) structure of the macromolecule, facilitating identification of functionally important clusters of ionizable groups; the approach is exemplified on two proteins, bacteriorhodopsin and myoglobin. Proteins 2006. © 2006 Wiley‐Liss, Inc.

Overview

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.1002/prot.20922

Cites

36 of 36 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.

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.

Citations

Cites

Show all 36 references

Cited by

See all 352

Metadata

Authors
Myers, J., Grothaus, G., Narayanan, S., & Onufriev, A.
Venue
Proteins: Structure, Function, and Bioinformatics
Publisher
Wiley
Published
2006-02-21
Volume
63
Issue
4
Pages
928-938
ISSN
  • 0887-3585 (ISSN-L)
  • 1097-0134
OpenAlex
W2029381257
Cited by
352
References
36
FWCI
1.23
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A simple clustering algorithm can be accurate enough for use in calculations of p K s in macromolecules. https://app.cochat.ai/papers/10.1002/prot.20922
The paper
Myers, J., Grothaus, G., Narayanan, S., & Onufriev, A. (2006). A simple clustering algorithm can be accurate enough for use in calculations of p K s in macromolecules. Proteins: Structure, Function, and Bioinformatics. https://doi.org/10.1002/prot.20922

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.