Common pharmacophore identification using frequent clique detection algorithm

Yevgeniy Podolyan, George Karypis

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)13-21
Number of pages9
JournalJournal of Chemical Information and Modeling
Volume49
Issue number1
DOIs
StatePublished - Jan 2009

Fingerprint

Dive into the research topics of 'Common pharmacophore identification using frequent clique detection algorithm'. Together they form a unique fingerprint.

Cite this