CoChat

Detection of pockets on protein surfaces using small and large probe spheres to find putative ligand binding sites

Kawabata, Takeshi, Go, Nobuhiro · 2007 · Proteins: Structure, Function, and Bioinformatics
Cited by 117

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

Abstract

One of the simplest ways to predict ligand binding sites is to identify pocket‐shaped regions on the protein surface. Many programs have already been proposed to identify these pocket regions. Examination of their algorithms revealed that a pocket intrinsically has two arbitrary properties, “size” and “depth”. We proposed a new definition for pockets using two explicit adjustable parameters that correspond to these two arbitrary properties. A pocket region is defined as a space into which a small probe can enter, but a large probe cannot. The radii of small and large probe spheres are the two parameters that correspond to the “size” and “depth” of the pockets, respectively. These values can be adjusted individual putative ligand molecule. To determine the optimal value of the large probe spheres radius, we generated pockets for thousands of protein structures in the database, using several size of large probe spheres, examined the correspondence of these pockets with known binding site positions. A new measure of shallowness, a minimum inaccessible radius, Rinaccess, indicated that binding sites of coenzymes are very deep, while those for adenine/guanine mononucleotide have only medium shallowness and those for short peptides and oligosaccharides are shallow. The optimal radius of large probe spheres was 3–4 Å for the coenzymes, 4 Å for adenine/guanine mononucleotides, and 5 Å or more for peptides/oligosaccharides. Comparison of our program with two other popular pocket‐finding programs showed that our program had a higher performance of detecting binding pockets, although it required more computational time. Proteins 2007. © 2007 Wiley‐Liss, Inc.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1002/prot.21283

Cites

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cited by

See all 117

Metadata

Authors
Kawabata, T., & Go, N.
Venue
Proteins: Structure, Function, and Bioinformatics
Publisher
Wiley
Published
2007-04-19
Volume
68
Issue
2
Pages
516-529
ISSN
  • 0887-3585 (ISSN-L)
  • 1097-0134
OpenAlex
W2112794559
Cited by
117
References
1
FWCI
7.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

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.