Superstructure searching algorithm for generic reaction retrieval

Chemical reaction knowledge is usually summarized and retrieved by chemists from references, journals, and reaction databases. To rigorously extract chemical reaction knowledge from large data sets, computer algorithms become much more important. This paper presents a new approach, superstructure searching (SSS) algorithm, for generic reaction retrieval. The algorithm considers all known reaction patterns from the targeted structure and assigns synthetic routes for new chemical compounds. This algorithm consists of screening, atom-by-atom comparison, and computation of R-groups' similarity.     

Mathematical foundation of a global strategy for searching reaction paths

For the determination of reaction paths and critical points on the potential energy hypersurface of chemical reactions, a rigorous mathematical background for the theory of a global searching procedure based on the catchment regions of the gradient field is given.     

Strategies for computing chemical reactivity indices

 Two recent articles [(2000) J Am Chem Soc 122: 2010, (2001) J Am Chem Soc 123: 2007] have explored electron-density-based and external-potential-based chemical reactivity indices. In this article, methods are presented for computing these indices from the output of a Kohn–Sham density functional theory calculation. Received: 18 October 2000 / Accepted: 4 April 2001 / Published online: 9 August 2001     

Efficient substructure searching of large chemical libraries: the ABCD chemical cartridge

Efficient substructure searching is a key requirement for any chemical information management system. In this paper, we describe the substructure search capabilities of ABCD, an integrated drug discovery informatics platform developed at Johnson & Johnson Pharmaceutical Research & Development, L.L.C. The solution consists of several algorithmic components: 1) a pattern mapping algorithm for solving the subgraph isomorphism problem, 2) an indexing scheme that enables very fast substructure searches on large structure files, 3) the incorporation of that indexing scheme into an Oracle cartridge to enable querying large relational databases through SQL, and 4) a cost estimation scheme that allows the Oracle cost-based optimizer to generate a good execution plan when a substructure search is combined with additional constraints in a single SQL query. The algorithm was tested on a public database comprising nearly 1 million molecules using 4,629 substructure queries, the vast majority of which were submitted by discovery scientists over the last 2.5 years of user acceptance testing of ABCD. 80.7% of these queries were completed in less than a second and 96.8% in less than ten seconds on a single CPU, while on eight processing cores these numbers increased to 93.2% and 99.7%, respectively. The slower queries involved extremely generic patterns that returned the entire database as screening hits and required extensive atom-by-atom verification.     

Accelerating chemical database searching using graphics processing units

The utility of chemoinformatics systems depends on the accurate computer representation and efficient manipulation of chemical compounds. In such systems, a small molecule is often digitized as a large fingerprint vector, where each element indicates the presence/absence or the number of occurrences of a particular structural feature. Since in theory the number of unique features can be exceedingly large, these fingerprint vectors are usually folded into much shorter ones using hashing and modulo operations, allowing fast "in-memory" manipulation and comparison of molecules. There is increasing evidence that lossless fingerprints can substantially improve retrieval performance in chemical database searching (substructure or similarity), which have led to the development of several lossless fingerprint compression algorithms. However, any gains in storage and retrieval afforded by compression need to be weighed against the extra computational burden required for decompression before these fingerprints can be compared. Here we demonstrate that graphics processing units (GPU) can greatly alleviate this problem, enabling the practical application of lossless fingerprints on large databases. More specifically, we show that, with the help of a ~$500 ordinary video card, the entire PubChem database of ~32 million compounds can be searched in ~0.2-2 s on average, which is 2 orders of magnitude faster than a conventional CPU. If multiple query patterns are processed in batch, the speedup is even more dramatic (less than 0.02-0.2 s/query for 1000 queries). In the present study, we use the Elias gamma compression algorithm, which results in a compression ratio as high as 0.097.     

Sign patterns for chemical reaction networks

Most differential equations found in chemical reaction networks (CRNs) have the form:

Advanced exact structure searching in large databases of chemical compounds

Efficient recognition of tautomeric compound forms in large corporate or commercially available compound databases is a difficult and labor intensive task. Our data indicate that up to 0.5% of commercially available compound collections for bioscreening contain tautomers. Though in the large registry databases, such as Beilstein and CAS, the tautomers are found in an automated fashion using high-performance computational technologies, their real-time recognition in the nonregistry corporate databases, as a rule, remains problematic. We have developed an effective algorithm for tautomer searching based on the proprietary chemoinformatics platform. This algorithm reduces the compound to a canonical structure. This feature enables rapid, automated computer searching of most of the known tautomeric transformations that occur in databases of organic compounds. Another useful extension of this methodology is related to the ability to effectively search for different forms of compounds that contain ionic and semipolar bonds. The computations are performed in the Windows environment on a standard personal computer, a very useful feature. The practical application of the proposed methodology is illustrated by several examples of successful recovery of tautomers and different forms of ionic compounds from real commercially available nonregistry databases.     

Similarity searching in files of three-dimensional chemical structures: Representation and searching of molecular electrostatic potentials using field-graphs

This paper reports a method for the identification of those molecules in a database of rigid 3D structures with molecular electrostatic potential (MEP) grids that are most similar to that of a user-defined target molecule. The most important features of an MEP grid are encoded in field-graphs, and a target molecule is matched against a database molecule by a comparison of the corresponding field-graphs. The matching is effected using a maximal common subgraph isomorphism algorithm, which provides an alignment of the target molecule's field- graph with those of each of the database molecules in turn. These alignments are used in the second stage of the search algorithm to calculate the intermolecular MEP similarities. Several different ways of generating field-graphs are evaluated, in terms of the effectiveness of the resulting similarity measures and of the associated computational costs. The most appropriate procedure has been implemented in an operational system that searches a corporate database, containing ca. 173,000 3D structures.     

Molecular potential-energy surfaces for chemical reaction dynamics

This paper reviews the construction of molecular potential-energy surfaces by an interpolation method which has been developed over the last several years. The method uses ab initio quantum chemistry calculations of the molecular electronic energy in an automated procedure to construct global potential- energy surfaces which can be used to simulate chemical reactions with either classical or quantum dynamics. The methodology is explained and several applications are presented to illustrate the approach. Received: 22 February 2002 / Accepted: 2 May 2002 / Published online: 6 November 2002 Correspondence to: M. A. Collins e-mail: collins@rsc.anu.edu.au Acknowledgements. The methods described in this overview are the result of collaborations with former members of my group, in particular with Josef Ischtwan, Meredith Jordon, Keiran Thompson and Ryan Bettens. I am also indebted for inspiration gained from many discussions with my colleagues Leo Radom and Donghui Zhang (National University of Singapore). This work has been supported by the Supercomputer Facility of the Australian National University and the Australian Partnership for Advanced Computing.     

Combined chemical equation for a multiple reaction

A simple procedure has been proposed for obtaining a combined chemical equation for a multiple reaction as defined by Temkin. The procedure is based on the concept of a normal basis for chemical equations which is introduced in the present paper. In some cases the proposed method makes it possible to obtain a form of combined chemical equation which is more convenient for practical use than that obtained by the familiar method.Translated from Teoreticheskaya i Éksperimental'naya Khimiya, Vol. 30, No. 5, pp. 289–292, September–October, 1994.     

Coordinate reduction for exploring chemical reaction paths

The potential energy surface for the reaction of a typical molecular system composed of N atoms is defined uniquely by 3N-6 coordinates. These coordinates can be defined by the Cartesian coordinates of the atomic centers (minus overall translation and rotation), or a set of internally defined coordinates such as bond stretches, angle bends, and torsions. By applying principal component analysis to the geometries along a reaction path, a reduced set of coordinates, d ≪ 3N-6, can be obtained. This reduced set of coordinates can reproduce the changes in geometry along the reaction path with chemical accuracy and may help improve the efficiency of reaction path optimization algorithms.     

Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm

Recently a method (RASCAL) for determining graph similarity using a maximum common edge subgraph algorithm has been proposed which has proven to be very efficient when used to calculate the relative similarity of chemical structures represented as graphs. This paper describes heuristics which simplify a RASCAL similarity calculation by taking advantage of certain properties specific to chemical graph representations of molecular structure. These heuristics are shown experimentally to increase the efficiency of the algorithm, especially at more distant values of chemical graph similarity.     

Fluctuation theorem for entropy production in a chemical reaction channel

Fluctuation theorem for entropy production in a mesoscopic chemical reaction network is discussed. When the system size is sufficiently large, it is found that, by defining a kind of coarse-grained dissipation function, the entropy production in a reversible reaction channel can be approximately described by a type of detailed fluctuation theorem. Such a fluctuation relation has been successfully tested by direct simulations in a linear reaction model consisting of two reversible channels and in an oscillat...     

Identifiability of chemical reaction networks

We consider the dynamics of chemical reaction networks under the assumption of mass-action kinetics. We show that there exist reaction networks for which the reaction rate constants are not uniquely identifiable, even if we are given complete information on the dynamics of concentrations for all chemical species of . Also, we show that there exist reaction networks such that their dynamics are identical under appropriate choices of reaction rate constants, and present theorems that characterize the properties of , , that make this possible. We use these facts to show how we can determine dynamical properties of some chemical networks by analyzing other chemical networks.     

Atoms of multistationarity in chemical reaction networks

Chemical reaction systems are dynamical systems that arise in chemical engineering and systems biology. In this work, we consider the question of whether the minimal (in a precise sense) multistationary chemical reaction networks, which we propose to call ‘atoms of multistationarity,’ characterize the entire set of multistationary networks. Our main result states that the answer to this question is ‘yes’ in the context of fully open continuous-flow stirred-tank reactors (CFSTRs), which are networks in which all chemical species take part in the inflow and outflow. In order to prove this result, we show that if a subnetwork admits multiple steady states, then these steady states can be lifted to a larger network, provided that the two networks share the same stoichiometric subspace. We also prove an analogous result when a smaller network is obtained from a larger network by ‘removing species.’ Our results provide the mathematical foundation for a technique used by Siegal- Gaskins et al. of establishing bistability by way of ‘network ancestry.’ Additionally, our work provides sufficient conditions for establishing multistationarity by way of atoms and moreover reduces the problem of classifying multistationary CFSTRs to that of cataloging atoms of multistationarity. As an application, we enumerate and classify all 386 bimolecular and reversible two-reaction networks. Of these, exactly 35 admit multiple positive steady states. Moreover, each admits a unique minimal multistationary subnetwork, and these subnetworks form a poset (with respect to the relation of ‘removing species’) which has 11 minimal elements (the atoms of multistationarity).     

Non-meanfield deterministic limits in chemical reaction kinetics

A general mechanism is proposed by which small intrinsic fluctuations in a system far from equilibrium can result in nearly deterministic dynamical behaviors which are markedly distinct from those realized in the meanfield limit. The mechanism is demonstrated for the kinetic Monte Carlo version of the Schnakenberg reaction where we identified a scaling limit in which the global deterministic bifurcation picture is fundamentally altered by fluctuations. Numerical simulations of the model are found to be in quantitative agreement with theoretical predictions.     

Applications of reaction calorimetry in chemical engineering

Reaction calorimetry strongly penetrated process development laboratories in the fine chemicals industry. Applications of calorimetry to different fields of process optimization, chemical reactions and physical unit operations were developed. Applications were first developed in the field of process safety. The thermal data of reaction obtained in the calorimeters allow us to check if a reaction will be controllable at full scale under normal operating conditions and in case of equipment failure. Further, the accurate temperature control and heat flow measurement opened the door to more engineering related data, in the fields of phase equilibria like vapour liquid, solubilities, crystallization and also in the mixing techniques. Some examples of developments in these different fields will be reviewed.     

Electron beam stimulated chemical reaction in solids

Use of electron beams allows to obtain new effects in high temperature chemistry of solid state. A stimulated influence of irradiation at comparable temperature conditions may be a subject of technological interest taking into account that increase of reaction rate can reach significant values.