title: Recursive distance partitioning algorithm for common pharmacophore identification.
abstract: An improved method for exhaustively identifying common pharmacophores from a given list of 3D conformers is proposed. The method partitions feature lists into multidimensional boxes according to the distances between the pharmacophore centers. Unlike some existing techniques, each feature list is mapped into multiple boxes to ensure that good matches will never be missed due to the partitioning. To circumvent the computational complexity of the problem, a recursive distance partitioning (RDP) algorithm is introduced, in which the partitioning and the elimination of unqualified feature lists are carried out at multiple levels. The method is demonstrated to be both accurate and efficient.
authors.affiliation: Johnson & Johnson Pharmaceutical Research and Development, L.L.C. 665 Stockton Drive, Exton, Pennsylvania 19341, USA. fzhu2@prdus.jnj.com
authors.forename: Fangqiang
authors.initials: F
authors.lastname: Zhu
authors.forename: Dimitris K
authors.initials: DK
authors.lastname: Agrafiotis
mesh_terms: D000465:Algorithms; D008024:Ligands; D015394:Molecular Structure; D004364:Pharmaceutical Preparations / Q000737:chemistry*
chemical_list: D008024:Ligands; D004364:Pharmaceutical Preparations