BRUTUS:: Optimization of a grid-based similarity function for rigid-body molecular superposition.: 1.: Alignment and virtual screening applications

We have developed a fast grid-based algorithm, BRUTUS, for rigid-body molecular superposition and similarity searching. BRUTUS aligns molecules using field information derived from charge distributions and van der Waals shapes of the compounds. Molecules can have similar biological properties if their charge distributions and shapes are similar, even though they have different chemical structures; that is, BRUTUS can identify compounds possessing similar properties, regardless of their structures. In this paper, we present two applications of BRUTUS. First, BRUTUS was used to superimpose five sets of inhibitors. Second, two sets of known inhibitors were searched from a database, and the results were analyzed using self-organizing maps. We demonstrate that BRUTUS is successful in superimposing compounds using molecular fields and, importantly, is fast and accurate enough for virtual screening of chemical databases using a standard personal computer. This fast and efficient molecular-field-based algorithm is applicable for virtual screening of structurally diverse, active molecules.