The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
BINANA: A novel algorithm for ligand-binding characterization
Open accessAbstract
Computational chemists and structural biologists are often interested in characterizing ligand-receptor complexes for hydrogen-bond, hydrophobic, salt-bridge, van der Waals, and other interactions in order to assess ligand binding. When done by hand, this characterization can become tedious, especially when many complexes need be analyzed. In order to facilitate the characterization of ligand binding, we here present a novel Python-implemented computer algorithm called BINANA (BINding ANAlyzer), which is freely available for download at http://www.nbcr.net/binana/. To demonstrate the utility of the new algorithm, we use BINANA to confirm that the number of hydrophobic contacts between a ligand and its protein receptor is positively correlated with ligand potency. Additionally, we show how BINANA can be used to search through a large ligand-receptor database to identify those complexes that are remarkable for selected binding features, and to identify lead candidates from a virtual screen with specific, desirable binding characteristics. We are hopeful that BINANA will be useful to computational chemists and structural biologists who wish to automatically characterize many ligand-receptor complexes for key binding characteristics.
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
VMD: visual molecular dynamics
Humphrey, W., Dalke, A., & Schulten, K. (1996) · Journal of Molecular Graphics · doi:10.1016/0263-7855(96)00018-5 · Cited by 66,952
Trott, O., & Olson, A. J. (2010) · Journal of Computational Chemistry · doi:10.1002/jcc.21334 · Cited by 38,412
The PDBbind database: methodologies and updates
Wang, R., Fang, X., Lu, Y., Yang, C.-Y., & Wang, S. (2005) · Journal of Medicinal Chemistry · doi:10.1021/jm048957q · Cited by 933
Binding MOAD (Mother Of All Databases)
Hu, L., Benson, M. L., Smith, R. D., Lerner, M. G., & Carlson, H. A. (2005) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20512 · Cited by 328
Cited by
PLIP: fully automated protein–ligand interaction profiler
Salentin, S., Schreiber, S., Haupt, V. J., Adasme, M. F., & Schroeder, M. (2015) · Nucleic Acids Research · doi:10.1093/nar/gkv315 · Cited by 2,340
Finding the sweet spot: the role of nature and nurture in medicinal chemistry
Hann, M. M., & Keserü, G. M. (2012) · Nature Reviews Drug Discovery · doi:10.1038/nrd3701 · Cited by 411
Ain, Q. U., Aleksandrova, A., Roessler, F. D., & Ballester, P. J. (2015) · WIREs Computational Molecular Science · doi:10.1002/wcms.1225 · Cited by 357
Li, H., Leung, K., Wong, M., & Ballester, P. J. (2015) · Molecular Informatics · doi:10.1002/minf.201400132 · Cited by 252
Discovery of High-Affinity Noncovalent Allosteric KRAS Inhibitors That Disrupt Effector Binding
McCarthy, M. J., Pagba, C. V., Prakash, P., Naji, A. K., van der Hoeven, D., Liang, H., Gupta, A. K., Zhou, Y., Cho, K.-J., Hancock, J. F., et al. (2019) · ACS Omega · doi:10.1021/acsomega.8b03308 · Cited by 90
Metadata
- Authors
- Durrant, J. D., & McCammon, J. A.
- Venue
- Journal of Molecular Graphics and Modelling
- Publisher
- Elsevier BV
- Published
- 2011-04
- Volume
- 29
- Issue
- 6
- Pages
- 888-893
- ISSN
- 1093-3263 (ISSN-L)
- OpenAlex
- W1992947643
- Cited by
- 227
- References
- 4
- FWCI
- 8.67
- Type
- journal article
- Language
- en
- Open access
- green
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: BINANA: A novel algorithm for ligand-binding characterization. https://app.cochat.ai/papers/10.1016/j.jmgm.2011.01.004
- The paper
- Durrant, J. D., & McCammon, J. A. (2011). BINANA: A novel algorithm for ligand-binding characterization. Journal of Molecular Graphics and Modelling. https://doi.org/10.1016/j.jmgm.2011.01.004
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.