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.
Description
BINANA: A novel algorithm for ligand-binding characterization
%0 Journal Article
%1 Durrant2011BINANA
%A Durrant, Jacob D.
%A McCammon, J. Andrew
%D 2011
%J Journal of Molecular Graphics and Modelling
%K ligand-binding ligand-profiling noncovalent-interactions software
%N 6
%P 888 - 893
%R http://dx.doi.org/10.1016/j.jmgm.2011.01.004
%T BINANA: A novel algorithm for ligand-binding characterization
%U http://www.sciencedirect.com/science/article/pii/S1093326311000076
%V 29
%X 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.
@article{Durrant2011BINANA,
abstract = {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. },
added-at = {2016-04-21T01:03:41.000+0200},
author = {Durrant, Jacob D. and McCammon, J. Andrew},
biburl = {https://www.bibsonomy.org/bibtex/238a9699efe2f01b3a9a893426fe7bb08/salotz},
description = {BINANA: A novel algorithm for ligand-binding characterization},
doi = {http://dx.doi.org/10.1016/j.jmgm.2011.01.004},
interhash = {cc12f815e646eebdae6c3dca29610445},
intrahash = {38a9699efe2f01b3a9a893426fe7bb08},
issn = {1093-3263},
journal = {Journal of Molecular Graphics and Modelling },
keywords = {ligand-binding ligand-profiling noncovalent-interactions software},
number = 6,
pages = {888 - 893},
timestamp = {2016-04-21T01:03:41.000+0200},
title = {BINANA: A novel algorithm for ligand-binding characterization },
url = {http://www.sciencedirect.com/science/article/pii/S1093326311000076},
volume = 29,
year = 2011
}