Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Dixon algorithm

C M, 1D Kuntz and J S Dixon 1995. Flexible Ligand Docking Using a Genetic Algorithm. Journal Zomputer-Aided Molecular Design 9 113-130. [Pg.740]

Feature trees have been described by Rarey and Dixon [106] as a new way of analyzing the similarity of molecules. This approach is based on building trees that represent molecules. These trees describe the major building blocks of molecules, in addition to their overall arrangement. They are conformation independent. Different types of pairwise comparison algorithms are available to compare trees of different molecules. [Pg.44]

Dixon, L.C.W., "Quasi-Newton Algorithms Generate Identical Points. Math. Programming, 1972, 2 (3), 383-387. [Pg.53]

L. C. W. Dixon, SIAM J. Opt., 1,475 (1991). On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms. [Pg.67]

Oshiro, C.M., Kuntz, I.D. and Dixon, J.S. Flexible ligand docking using a genetic algorithm. / Comput.-Aided Mol. Des., 1995,9, 113-30. [Pg.171]

It will be shown that the restriction above allows one to consider the linear response of a phase variable coupled to nearly all the NEMD algorithms in the literature to date. The one known exception is the thermal conductivity algorithm due to Gillan and Dixon. Thus, the present formulation will provide a template for the computation of the linear response of any phase variable coupled to an external field of the form given by Eqs. [91] under the conditions specified by Eq. [94]. [Pg.325]

C. M. Oshiro, I. D. Kuntz, and J. S. Dixon. Flexible ligand docking using a genetic algorithm. Journal of Computer-Aided Molecular Design, 9 113-130, 1995. [Pg.368]

Evaluate the cycle decomposition of the permutation 0 induced by on X which gives the orbits of ( ) on X. Construct a y e 7 that is constant on these orbits and takes values y 7 on these orbits which are distributed uniformly at random over 7. The Dixon-Wilf algorithm shows that this y 7 is distributed uniformly over the symmetry classes of G. [Pg.53]

Peishoff, C.E., Dixon, J.S. and Kopple, K.D. (1990) Application of the Distance Geometry Algorithm to Cyclic Oligopeptide Conformation Searches, Biopolymers, 30, 45-56. [Pg.173]


See other pages where Dixon algorithm is mentioned: [Pg.677]    [Pg.183]    [Pg.284]    [Pg.68]    [Pg.175]    [Pg.9]    [Pg.45]    [Pg.39]    [Pg.417]    [Pg.176]    [Pg.78]    [Pg.661]    [Pg.59]    [Pg.65]    [Pg.118]    [Pg.25]    [Pg.70]    [Pg.256]    [Pg.256]    [Pg.281]    [Pg.115]    [Pg.116]    [Pg.53]    [Pg.54]    [Pg.57]    [Pg.27]    [Pg.49]    [Pg.365]    [Pg.566]    [Pg.396]    [Pg.2325]   
See also in sourсe #XX -- [ Pg.53 ]




SEARCH



Dixon

© 2024 chempedia.info