Similarity searching in databases of flexible 3D structures using smoothed bounded distance matrices

This paper describes a method for calculating the similarity between pairs of chemical structures represented by 3D molecular graphs. The method is based on a graph matching procedure that accommodates conformational flexibility by using distance ranges between pairs of atoms, rather than fixing the atom pair distances. These distance ranges are generated using triangle and tetrangle bound smoothing techniques from distance geometry. The effectiveness of the proposed method in retrieving other compounds of like biological activity is evaluated, and the results are compared with those obtained from other, 2D-based methods for similarity searching.     

CLIP: similarity searching of 3D databases using clique detection

This paper describes a program for 3D similarity searching, called CLIP (for Candidate Ligand Identification Program), that uses the Bron-Kerbosch clique detection algorithm to find those structures in a file that have large structures in common with a target structure. Structures are characterized by the geometric arrangement of pharmacophore points and the similarity between two structures calculated using modifications of the Simpson and Tanimoto association coefficients. This modification takes into account the fact that a distance tolerance is required to ensure that pairs of interatomic distances can be regarded as equivalent during the clique-construction stage of the matching algorithm. Experiments with HIV assay data demonstrate the effectiveness and the efficiency of this approach to virtual screening.     

Similarity searching in databases of flexible 3D structures using autocorrelation vectors derived from smoothed bounded distance matrices

This paper presents an exploratory study of a novel method for flexible 3-D similarity searching based on autocorrelation vectors and smoothed bounded distance matrices. Although the new approach is unable to outperform an existing 2-D similarity searching in terms of enrichment factors, it is able to retrieve different compounds at a given percentage of the hit-list and so may be a useful adjunct to other similarity searching methods.     

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.     

A framework for the evaluation of chemical structure databases

Access to desk-top structure and reaction databases through applications such as Chemical Abstracts' SciFinder, MDL's Beilstein CrossFire, and ISIS Reaction Browser has led to changes in information seeking habits of research chemists, the impact of which has implications when database purchasing decisions are made. A semiquantitative assessment is proposed which takes into account key aspects of structure and reaction databases. Assessment criteria are identified which can be weighted according to an organization's information needs. Values are then assigned to criteria for each data source, after which a formula is applied which leads to an indication of the relative value of systems under consideration. The formula takes into account the cost of database products and also the incremental benefit of adding a new system to an existing collection. This work is presented as a generic approach to the evaluation of databases and is not limited in scope to only structure and reactions databases.     

Thermodynamic limitations in searching for regions of optimal performance of complex chemical reactions (exemplified by conversion of hydrocarbons)

An algorithm of searching for optimal nonequilibrium reaction mixture compositions accounting for thermodynamic limitations is suggested. It is exemplified by the analysis of a steam conversion of hydrocarbons.

---

, . .

     

Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases

This paper reports an evaluation of both graph-based and fingerprint-based measures of structural similarity, when used for virtual screening of sets of 2D molecules drawn from the MDDR and ID Alert databases. The graph-based measures employ a new maximum common edge subgraph isomorphism algorithm, called RASCAL, with several similarity coefficients described previously for quantifying the similarity between pairs of graphs. The effectiveness of these graph-based searches is compared with that resulting from similarity searches using BCI, Daylight and Unity 2D fingerprints. Our results suggest that graph-based approaches provide an effective complement to existing fingerprint-based approaches to virtual screening.     

Computational study of carbon atom (3P and 1D) reaction with CH2O. Theoretical evaluation of 1B1 methylene production by C (1D)

Singlet and triplet free energy surfaces for the reactions of C atom ((3)P and (1)D) with CH(2)O are studied computationally to evaluate the excited singlet ((1)B(1)) methylene formation from deoxygenation of CH(2)O by C ((1)D) atom as suggested by Shevlin et al. Carbon atoms can react by addition to the oxygen lone pair or to the C=O double bond on both the triplet and singlet surfaces. Triplet C ((3)P) atoms will deoxygenate to give CO plus CH(2) ((3)B(1)) as the major products, while singlet C ((1)D) reactions will form ketene and CO plus CH(2) ((1)A(1)). No definitive evidence of the formation of excited singlet ((1)B(1)) methylene was found on the singlet free energy surface. A conical intersection between the (1)A' and (1)A' ' surfaces located near an exit channel may play a role in product formation. The suggested (1)B(1) state of methylene may form via the (1)A' ' surface only if dynamic effects are important. In an effort to interpret experimental observation of products trapped by (Z)-2-butene, formation of cis- and trans-1,2-dimethylcyclopropane is studied computationally. The results suggests that "hot" ketene may react with (Z)-2-butene nonstereospecifically.     

Explicitly correlated Gaussian calculations of the (2)D Rydberg states of the boron atom

Accurate non-relativistic variational calculations are performed for the seven lowest members of the (2)D Rydberg series (1s(2)2s2p(2), and 1s(2)2s(2)nd, n = 3, [ellipsis (horizontal)], 8) of the boron atom. The wave functions of the states are expanded in terms of all-electron explicitly correlated Gaussian basis functions and the effect of the finite nuclear mass is directly included in the calculations allowing for determining the isotopic shifts of the energy levels. The Gaussian basis is optimized independently for each state with the aid of the analytic energy gradient with respect to the Gaussian parameters. The calculations represent the highest accuracy level currently achievable for the considered states. The computed energies are compared with the available experimental data.     

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.