The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Open accessAbstract
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, pockets and cavities in dynamic and static protein structures to the outside solvent. Results: The algorithm to perform a skeleton search was based on a reciprocal distance function grid that was developed and implemented for the CAVER program. The program identifies and visualizes routes from the interior of the protein to the bulk solvent. CAVER was primarily developed for proteins, but the algorithm is sufficiently robust to allow the analysis of any molecular system, including nucleic acids or inorganic material. Calculations can be performed using discrete structures from crystallographic analysis and NMR experiments as well as with trajectories from molecular dynamics simulations. The fully functional program is available as a stand-alone version and as plug-in for the molecular modeling program PyMol. Additionally, selected functions are accessible in an online version. Conclusion: The algorithm developed automatically finds the path from a starting point located within the interior of a protein. The algorithm is sufficiently rapid and robust to enable routine analysis of molecular dynamics trajectories containing thousands of snapshots. The algorithm is based on reciprocal metrics and provides an easy method to find a centerline, i.e. the spine, of complicated objects such as a protein tunnel. It can also be applied to many other molecules. CAVER is freely available from the web site http://loschmidt.chemi.muni.cz/caver/.
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.
Integrity signals
Registry
Cites
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.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
The quickhull algorithm for convex hulls
Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. (1996) · ACM Transactions on Mathematical Software · doi:10.1145/235815.235821 · Cited by 5,359
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Liang, J., Woodward, C., & Edelsbrunner, H. (1998) · Protein Science · doi:10.1002/pro.5560070905 · Cited by 1,057
Q-SiteFinder: an energy-based method for the prediction of protein-ligand binding sites
Laurie, A. T. R., & Jackson, R. M. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti315 · Cited by 1,047
Detection, delineation, measurement and display of cavities in macromolecular structures
Kleywegt, G. J., & Jones, T. A. (1994) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s0907444993011333 · Cited by 969
Crystallographic analysis of the catalytic mechanism of haloalkane dehalogenase
Verschueren, K. H. G., Seljée, F., Rozeboom, H. J., Kalk, K. H., & Dijkstra, B. W. (1993) · Nature · doi:10.1038/363693a0 · Cited by 467
Penalized-distance volumetric skeleton algorithm
Bitter, I., Kaufman, A. E., & Sato, M. (2001) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.942688 · Cited by 248
Cited by
Ligand docking and binding site analysis with PyMOL and Autodock/Vina
Seeliger, D., & de Groot, B. L. (2010) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-010-9352-6 · Cited by 2,623
Crystal structure of the channelrhodopsin light-gated cation channel
Kato, H. E., Zhang, F., Yizhar, O., Ramakrishnan, C., Nishizawa, T., Hirata, K., Ito, J., Aita, Y., Tsukazaki, T., Hayashi, S., et al. (2012) · Nature · doi:10.1038/nature10870 · Cited by 527
Crystal structure of a copper-transporting PIB-type ATPase
Gourdon, P., Liu, X.-Y., Skjørringe, T., Morth, J. P., Møller, L. B., Pedersen, B. P., & Nissen, P. (2011) · Nature · doi:10.1038/nature10191 · Cited by 344
Computational Prediction of Metabolism: Sites, Products, SAR, P450 Enzyme Dynamics, and Mechanisms
Kirchmair, J., Williamson, M. J., Tyzack, J. D., Tan, L., Bond, P. J., Bender, A., & Glen, R. C. (2012) · Journal of Chemical Information and Modeling · doi:10.1021/ci200542m · Cited by 289
Druggable pockets and binding site centric chemical space: a paradigm shift in drug discovery
Pérot, S., Sperandio, O., Miteva, M. A., Camproux, A.-C., & Villoutreix, B. O. (2010) · Drug Discovery Today · doi:10.1016/j.drudis.2010.05.015 · Cited by 276
Metadata
- Authors
- Petřek, M., Otyepka, M., Banáš, P., Košinová, P., Koča, J., & Damborský, J.
- Venue
- BMC Bioinformatics
- Published
- 2006-06-22
- Volume
- 7
- Issue
- 1
- Pages
- 316-316
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2131080603
- Cited by
- 521
- References
- 25
- FWCI
- 12.28
- Type
- journal article
- Language
- en
- Open access
- gold
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: CAVER: a new tool to explore routes from protein clefts, pockets and cavities. https://app.cochat.ai/papers/10.1186/1471-2105-7-316
- The paper
- Petřek, M., Otyepka, M., Banáš, P., Košinová, P., Koča, J., & Damborský, J. (2006). CAVER: a new tool to explore routes from protein clefts, pockets and cavities. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-7-316
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.