The atom assignment problem in automated de novo drug design. 2. A method for molecular graph and fragment perception

Summary If atom assignment onto 3D molecular graphs is to be optimized, an efficient scheme for placement must be developed. The strategy adopted in this paper is to analyze the molecular graphs in terms of cyclical and non-cyclical nodes; the latter are further divided into terminal and non-terminal nodes. Molecular fragments, from a fragments database, are described in a similar way. A canonical numbering scheme for the fragments and the local subgraph of the molecular graph enables fragments to be placed efficiently onto the molecular graph. Further optimization is achieved by placing similar fragments into bins using a hashing scheme based on the canonical numbering. The graph perception algorithm is illustrated in detail.