Chemical algorithms

Keywords Chemical reactions Optimization algorithm Chemical algorithm... 

Analog to some other nature inspired algorithms for example, genetic algorithms, where genes are the basic units and are encoded as strings or chromosomes, in this proposed chemical algorithm, the basic units or candidate solutions are represented by elements or/and compounds, and the metaphor of chemical reactions is used as a procedure to approximate the solution to a desired optima. 

Fig. 6.2 a/j b/4, convergence of the chemical algorithm applying the parameters of set 2 and 256 dimensions applied to the test functions mentioned in Table 6.2... 

The most important property of azo dyes is their maximum absorption wavelength (Amax) because it determines the color of azo dyes. Theoretically speaking, A.n,ax of azo dyes is dependent on the electronic structure of azo dye molecules. Quantum chemical calculation has been applied to estimate A ax of some azo dyes. For planar dye molecules, PPP method of quantum chemistry can be used for A.max estimation. But PPP method is not suitable for the estimation of the A,n,ax of azo dyes with non-planar molecules. For azo dyes with non-planar molecules, the application of more sophisticated quantum chemical algorithms has been investigated. Although the calculation of the A,n,ax of some other dye by ZINDO/S algorithm has certain degree of success, the application of... 

In order to find some more effective estimation method for the Amax of azo dyes, we have tried to combine the quantum chemical algorithm with the data processing technique together. This is performed by two following ways [150]. 

Bennett C H 1977 Molecular dynamics and transition state theory the simulation of infrequent events Algorithms for Chemical Computation (ACS Symposium Series No 46) ed R E Christofferson (Washington, DC American Chemical Society)... 

Fast P L and Truhlar D G 1998 Variational reaction path algorithm J. Chem. Phys. 109 3721 Billing G D 1992 Quantum classical reaction-path model for chemical reactions Chem. Phys. 161 245... 

An excellent, up-to-date treatise on geometry optimization and reaction path algorithms for ab initio quantum chemical calculations, including practical aspects. 

The Helgaker-Chen algorithm results in very large steps being possible, and despite the extra cost of the required second derivatives, this is the method of choice for direct dynamics calculations. A number of systems have been treated, and a review of the method as applied to chemical reactions is given in [2]. 

The basic scheme of this algorithm is similar to cell-to-cell mapping techniques [14] but differs substantially In one important aspect If applied to larger problems, a direct cell-to-cell approach quickly leads to tremendous computational effort. Only a proper exploitation of the multi-level structure of the subdivision algorithm (also for the eigenvalue problem) may allow for application to molecules of real chemical interest. But even this more sophisticated approach suffers from combinatorial explosion already for moderate size molecules. In a next stage of development [19] this restriction will be circumvented using certain hybrid Monte-Carlo methods. 

Another approach applies graph theory. The analogy between a structure diagram and a topological graph is the basis for the development of graph theoretical algorithms to process chemical structure information [33-35]. 

Now, chemists have acquired much of their knowledge on chemical reactions by inductive learning from a large set of individual reaction instances. How has this been done And how can we build on these methods and knowledge and perform it in a more systematic manner by algorithmic techniques ... 

A substructure search algorithm is usually the first step in the implementation of other important topological procedures for the analysis of chemical structures such as identification of equivalent atoms, determination of maximal common substructure, ring detection, calculation of topological indices, etc. 

The spectral signals are assigned to the HOSE codes that represent the corresponding carbon atom. This approach has been used to create algorithms that allow the automatic creation of "substructure-sub-spectrum databases that are now used in systems for predicting chemical structures directly from NMR. 

The comparison For identity of chemical structures is peiTormed on the basis of a hashcode algorithm, Hashcode are unique integer numbers which can be calculated for each chemical structure within the WODCA system [55], Further exam-... 

Figure 5.29 from Gonzalez C and H B Schlegel 1988. An Improved Algorithm for Reaction Path Following. The Journal of Chemical Physics 90 2154-2161. 

Figure 5,30 reprinted from Chemical Physical Letters, 194, Fischer S and M Karplus. Conjugate Peak Refinement An Algorithm for Finding Reaction Paths and Accurate Transition States in Systems with Many Degrees of Freedom. 252-261, 1992, with permission from Elsevier Science. 

Fig. 5.29 Method for correcting the path followed by a steepest descents algorithm to generate the intrinsic reaction coordinate. The solid line shows the real path and the dotted line shows the algorithmic approximation to it. (Figure redrawn from Gonzalez C and H B Schlegel 1988. An Improved Algorithm for Reaction Path Following. Journal of Chemical Physics 90 2154-2161.)...

Deserno M and C Holm 1998b. How to Mesh Up Ewald Sums. II. An Accurate Error Estimate for the Particle-Particle-Particle-Mesh Algorithm. Journal of Chemical Physics 109 7694-7701. 

Zhou R and B J Berne 1995. A New Molecular Dynamics Method Combining the Reference Sys Propagator Algorithm with a Fast Multipole Method for Simulating Proteins and Ol Complex Systems. Journal of Chemical Physics 103 9444-9459. 

A R, D P Dolata and K Prout 1990. Automated Conformational Analysis and Structure Generation Algorithms for Molecular Perception. Journal of Chemical Information and Computer Science 30 316-324. 

---