Mining Molecular Fragments: Finding Relevant Substructures of Molecules Christian Borgelt and Michael R. Berthold   View Paper (PDF)   Return to Main-Track Regular Papers Abstract We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instead of carrying out a brute-force search, our method generates fragments by embedding them in all appropriate molecules in parallel and prunes the search tree based on a local order of the atoms and bonds, which results in substantially faster search by eliminating the need for frequent, computationally expensive reembeddings and by suppressing redundant search. We prove the usefulness of our algorithm by demonstrating the discovery of activity-related groups of chemical compounds in the well-known National Cancer Institute's HIV-screening dataset. DiSC'03 © 2003 Association for Computing Machinery