GALAHAD: 1. Pharmacophore identification by hypermolecular alignment of ligands in 3D

SummaryAlignment of multiple ligands based on shared pharmacophoric and pharmacosteric features is a long-recognized challenge in drug discovery and development. This is particularly true when the spatial overlap between structures is incomplete, in which case no good template molecule is likely to exist. Pair-wise rigid ligand alignment based on linear assignment (the LAMDA algorithm) has the potential to address this problem (Richmond et al. in J Mol Graph Model 23:199–209, 2004). Here we present the version of LAMDA embodied in the GALAHAD program, which carries out multi-way alignments by iterative construction of hypermolecules that retain the aggregate as well as the individual attributes of the ligands. We have also generalized the cost function from being purely atom-based to being one that operates on ionic, hydrogen bonding, hydrophobic and steric features. Finally, we have added the ability to generate useful partial-match 3D search queries from the hypermolecules obtained. By running frozen conformations through the GALAHAD program, one can utilize the extended version of LAMDA to generate pharmacophores and pharmacosteres that agree well with crystal structure alignments for a range of literature datasets, with minor adjustments of the default parameters generating even better models. Allowing for inclusion of partial match constraints in the queries yields pharmacophores that are consistently a superset of full-match pharmacophores identified in previous analyses, with the additional features representing points of potentially beneficial interaction with the target.

[1]  R. Cramer,et al.  Comparative molecular field analysis (CoMFA). 1. Effect of shape on binding of steroids to carrier proteins. , 1988, Journal of the American Chemical Society.

[2]  S. Pickett,et al.  GRid-INdependent descriptors (GRIND): a novel class of alignment-independent three-dimensional molecular descriptors. , 2000, Journal of medicinal chemistry.

[3]  Robin Taylor,et al.  Comparing protein–ligand docking programs is difficult , 2005, Proteins.

[4]  Peter Willett,et al.  Alignment of three-dimensional molecules using an image recognition algorithm. , 2004, Journal of molecular graphics & modelling.

[5]  H. Kubinyi,et al.  3D QSAR in drug design. , 2002 .

[6]  A. Good,et al.  3-D pharmacophores in drug discovery. , 2001, Current pharmaceutical design.

[7]  Valerie J. Gillet,et al.  Generation of multiple pharmacophore hypotheses using multiobjective optimisation techniques , 2004, J. Comput. Aided Mol. Des..

[8]  Allan M. Ferguson,et al.  EVA: A new theoretically based molecular descriptor for use in QSAR/QSPR analysis , 1997, J. Comput. Aided Mol. Des..

[9]  G M Crippen,et al.  Quantitative structure-activity relationship by distance geometry: quinazolines as dihydrofolate reductase inhibitors. , 1982, Journal of medicinal chemistry.

[10]  Christian Lemmen,et al.  Computational methods for the structural alignment of molecules , 2000, J. Comput. Aided Mol. Des..

[11]  G. Klebe,et al.  Molecular similarity indices in a comparative analysis (CoMSIA) of drug molecules to correlate and predict their biological activity. , 1994, Journal of medicinal chemistry.

[12]  Robert D. Clark,et al.  Efficient Generation, Storage, and Manipulation of Fully Flexible Pharmacophore Multiplets and Their Use in 3-D Similarity Searching , 2003, J. Chem. Inf. Comput. Sci..

[13]  Fionn Murtagh,et al.  A Survey of Recent Advances in Hierarchical Clustering Algorithms , 1983, Comput. J..

[14]  Nikolai S. Zefirov,et al.  Molecular Field Topology Analysis Method in QSAR Studies of Organic Compounds , 2000, J. Chem. Inf. Comput. Sci..

[15]  Andrew R. Leach,et al.  A comparison of the pharmacophore identification programs: Catalyst, DISCO and GASP , 2002, J. Comput. Aided Mol. Des..

[16]  Gareth Jones,et al.  A genetic algorithm for flexible molecular overlay and pharmacophore elucidation , 1995, J. Comput. Aided Mol. Des..

[17]  Peter Willett,et al.  Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..

[18]  Gareth Jones,et al.  Hyperstructure model for chemical structure handling: Techniques for substructure searching , 1994, J. Chem. Inf. Comput. Sci..

[19]  Peter Willett,et al.  Generation and Display of Activity-Weighted Chemical Hyperstructures , 2003, J. Chem. Inf. Comput. Sci..

[20]  John M. Barnard,et al.  Clustering of chemical structures on the basis of two-dimensional similarity measures , 1992, J. Chem. Inf. Comput. Sci..