title: Common pharmacophore identification using frequent clique detection algorithm.
abstract: The knowledge of a pharmacophore, or the 3D arrangement of features in the biologically active molecule that is responsible for its pharmacological activity, can help in the search and design of a new or better drug acting upon the same or related target. In this paper, we describe two new algorithms based on the frequent clique detection in the molecular graphs. The first algorithm mines all frequent cliques that are present in at least one of the conformers of each (or a portion of all) molecules. The second algorithm exploits the similarities among the different conformers of the same molecule and achieves an order of magnitude performance speedup compared to the first algorithm. Both algorithms are guaranteed to find all common pharmacophores in the data set, which is confirmed by the validation on the set of molecules for which pharmacophores have been determined experimentally. In addition, these algorithms are able to scale to data sets with arbitrarily large number of conformers per molecule and identify multiple ligand binding modes or multiple binding sites of the target.
authors.affiliation: University of Minnesota, Department of Computer Science and Computer Engineering, Minneapolis, Minnesota 55455, USA.
authors.forename: Yevgeniy
authors.initials: Y
authors.lastname: Podolyan
authors.forename: George
authors.initials: G
authors.lastname: Karypis
mesh_terms: D000465:Algorithms; D001665:Binding Sites; D015195:Drug Design; D048088:Informatics; D008024:Ligands; D008968:Molecular Conformation; D004364:Pharmaceutical Preparations / Q000737:chemistry* / Q000378:metabolism
chemical_list: D008024:Ligands; D004364:Pharmaceutical Preparations