No abstract

A problem common to computer programs for structure elucidation is the efficient and prospective use of the input information to constrain the structure generation process. The input may consist of potentially overlapping substructure requirements and alternative substructure interpretations of spectral data. Other useful information may be structural features that must not be present in the output structures. All of these may interact in a complex manner that is impossible to determine by use of a bond-by-bond structure assembly algorithm. A new method is described called structure reduction. In contrast to structure assembly, this method begins with a set of all bonds and removes inconsistent bonds as structure generation progresses. This results in a more efficient use of the input information and the ability to use potentially overlapping required substructures. Several examples illustrate the application of our computer program COCOA, which uses this method to solve real-world structure elucidation problems.

No abstract

From REACCS, to MDL ISIS/Host Reaction Gateway, and most recently to MDL Relational Chemistry Server, a new product based on Oracle data cartridge technology, MDL's reaction database management and retrieval systems have undergone great changes. The evolution of the system architecture is briefly discussed. The evolution of MDL reaction substructure search (RSS) algorithms is detailed. This article mainly describes a novel RSS algorithm. This algorithm is based on a depth-first search approach and is able to fully and prospectively use reaction specific information, such as reacting center and atom-atom mapping (AAM) information. The new algorithm has been used in the recently released MDL Relational Chemistry Server and allows the user to precisely find reaction instances in databases while minimizing unrelated hits. Finally, the existing and new RSS algorithms are compared with several examples.

No abstract