๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A combinatorial algorithm for calculating ligand binding

โœ Scribed by F. S. Kuhl; G. M. Crippen; D. K. Friesen

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
884 KB
Volume
5
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

โœฆ Synopsis

We consider the problem of predicting the mode of binding of a small molecule to a receptor site on a protein. One plausible approach, given a rigid molecule and its geometry, is to search directly for the orientation in space that maximizes the degree of contact. The computation time required for such a naive procedure is proportional to n3m3, where n is the number of points in the site where binding can occur, and m is the number of atoms in the ligand. We give an alternative, combinatorial approach, in which only "contact-no-contact" criteria are considered. We relate this problem to the well-known combinatorial problem of finding cliques in a graph and show that we can use a solution to the clique problem not only to solve our original problem, but also the problem of avoiding energetically unfavorable matches. Our experience with this method indicates that the computation time required is proportional to nm2.8, with a lower constant of proportionality than that of the naive procedure.

๐Ÿ“œ SIMILAR VOLUMES

A combinatorial algorithm for max csp
A combinatorial algorithm for max csp
โœ Mayur Datar; Tomรกs Feder; Aristides Gionis; Rajeev Motwani; Rina Panigrahy ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

We consider the problem MAX CSP over multi-valued domains with variables ranging over sets of size s i s and constraints involving k j k variables. We study two algorithms with approximation ratios A and B, respectively, so we obtain a solution with approximation ratio max(A, B). The first algorith

A vectorisable algorithm for calculating
A vectorisable algorithm for calculating three-body interactions
โœ Luis Javier Alvarez; Ali Alavi; Jรถrn Ilja Siepmann ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 391 KB

A new vectorisable algorithm is proposed for identifying the triads of particles required in the calculation of three-body interactions. Tests of this algorithm on a glassy silicate show a five-fold reduction of CPU time per configuration with respect to a simple triple-loop procedure. The calculati

Combinatorial methods for discovery of p
Combinatorial methods for discovery of peptide ligands which bind to antibody-like molecules
โœ Gordon Tribbick; Stuart Rodda ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 78 KB

## Abstract In the 1980s, new methods of parallel peptide synthesis were used to make large libraries of peptides, which were then screened for binding to Benceโ€“Jones dimers. Subsequent Xโ€ray crystallography of the Benceโ€“Jones proteins, which had been infiltrated with peptide ligand, was used to de