Big Chemical Encyclopedia

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

Articles Figures Tables About

Molecular dynamics search method

The input to a minimisation program consists of a set of initial coordinates for the system. The initial coordinates may come from a variety of sources. They may be obtained from an experimental technique, such as X-ray crystallography or NMR. In other cases a theoretical method is employed, such as a conformational search algorithm. A combination of experimenfal and theoretical approaches may also be used. For example, to study the behaviour of a protein in water one may take an X-ray structure of the protein and immerse it in a solvent bath, where the coordinates of the solvent molecules have been obtained from a Monte Carlo or molecular dynamics simulation. [Pg.275]

A key feature of the Car-Parrinello proposal was the use of molecular dynamics a simulated annealing to search for the values of the basis set coefficients that minimise I electronic energy. In this sense, their approach provides an alternative to the traditioi matrix diagonalisation methods. In the Car-Parrinello scheme, equations of motion ... [Pg.633]

To overcome the limitations of the database search methods, conformational search methods were developed [95,96,109]. There are many such methods, exploiting different protein representations, objective function tenns, and optimization or enumeration algorithms. The search algorithms include the minimum perturbation method [97], molecular dynamics simulations [92,110,111], genetic algorithms [112], Monte Carlo and simulated annealing [113,114], multiple copy simultaneous search [115-117], self-consistent field optimization [118], and an enumeration based on the graph theory [119]. [Pg.286]

The most serious problem with MM as a method to predict molecular structure is convergence to a false, rather than the global minimum in the Born-Oppenheimer surface. The mathematical problem is essentially still unsolved, but several conformational searching methods for approaching the global minimum, and based on either systematic or random searches have been developed. These searches work well for small to medium-sized molecules. The most popular of these techniques that simulates excitation to surmount potential barriers, has become known as Molecular Dynamics [112]. [Pg.404]

The main driver behind developing LFMM is computational efficiency. Although DFT has undoubtedly revolutionized the theoretical treatment of TM systems, there are many instances where all QM methods, even DFT, are simply not viable. Comprehensive conformational searching, molecular dynamics, and virtual screening represent hundreds of thousands of individual calculations and QM methods are too expensive. We are forced to turn to classical models but, for TM centers, this presents a whole new set of challenges. However, since we cannot easily make QM orders of magnitude faster, our only option is to make MM smarter and thus able to cope with the extra demands of coordination complexes. [Pg.36]


See other pages where Molecular dynamics search method is mentioned: [Pg.541]    [Pg.305]    [Pg.492]    [Pg.541]    [Pg.305]    [Pg.492]    [Pg.134]    [Pg.165]    [Pg.370]    [Pg.178]    [Pg.86]    [Pg.270]    [Pg.47]    [Pg.349]    [Pg.412]    [Pg.276]    [Pg.2950]    [Pg.171]    [Pg.97]    [Pg.11]    [Pg.291]    [Pg.473]    [Pg.474]    [Pg.492]    [Pg.669]    [Pg.345]    [Pg.76]    [Pg.286]    [Pg.2]    [Pg.117]    [Pg.35]    [Pg.8]    [Pg.467]    [Pg.142]    [Pg.293]    [Pg.47]    [Pg.59]    [Pg.300]    [Pg.301]    [Pg.148]    [Pg.192]    [Pg.50]    [Pg.51]    [Pg.37]    [Pg.431]    [Pg.125]    [Pg.220]   
See also in sourсe #XX -- [ Pg.541 , Pg.543 ]

See also in sourсe #XX -- [ Pg.492 , Pg.493 ]




SEARCH



Dynamic method

Molecular dynamics method

Search methods

Searching methods

© 2024 chempedia.info