An efficient mechanism for prediction of protein-ligand interactions based on analysis of protein tertiary substructures

Analysis of protein-ligand interactions is a fundamental issue in drug design. As the detailed and accurate analysis of protein-ligand interactions involves calculation of binding free energy based on thermodynamics and even quantum mechanics, which is highly expensive in terms of computing time, conformational and structural analysis of proteins and ligands has been widely employed as a screening process in computer-aided drug design. In this paper, an efficient mechanism for identifying possible protein-ligand interactions based on analysis of protein tertiary substructures is proposed. In one experiment reported in this paper, the proposed prediction mechanism has been exploited to obtain some clues about a hypothesis that the biochemists have been speculating. The main distinction in the design of the prediction mechanism is the filtering process incorporated to expedite the analysis. The filtering process extracts the residues located in a cave of the protein tertiary structure for analysis and operates with O(nlogn) time complexity, where n is the number of residues in the protein. In comparison, the /spl alpha/hull algorithm, which is a widely used algorithm in computer graphics for identifying those instances that are on the contour of a 3-dimensional object, features O(n/sup 2/) time complexity. Experimental results show that the filtering process presented in this paper is able to speed up the analysis by a factor ranging from 3.11 to 9.79 times.

[1]  Nicholas Ayache,et al.  An 0(n2) algorithm for 3D substructure matching of proteins , 1994 .

[2]  Yen-Jen Oyang,et al.  A novel learning algorithm for data classification with radial basis function networks , 2002, Proceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02..

[3]  D. Krane,et al.  Fundamental Concepts of Bioinformatics , 2002 .

[4]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[5]  S. Wodak,et al.  Optimal protein structure alignments by multiple linkage clustering: application to distantly related proteins. , 1995, Protein engineering.

[6]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1994, ACM Trans. Graph..

[7]  M. Muir Physical Chemistry , 1888, Nature.

[8]  David A. Fenstermacher,et al.  Introduction to bioinformatics , 2005, J. Assoc. Inf. Sci. Technol..

[9]  S. Altschul Amino acid substitution matrices from an information theoretic perspective , 1991, Journal of Molecular Biology.

[10]  Robert C. Liddington,et al.  Faculty Opinions recommendation of Crystal structure of the extracellular segment of integrin alpha Vbeta3 in complex with an Arg-Gly-Asp ligand. , 2002 .

[11]  Haim J. Wolfson,et al.  Geometric hashing: an overview , 1997 .

[12]  Nicholas Ayache,et al.  A geometric algorithm to find small but highly similar 3D substructures in proteins , 1998, Bioinform..

[13]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[14]  김삼묘,et al.  “Bioinformatics” 특집을 내면서 , 2000 .

[15]  Philip E. Bourne,et al.  Structural Bioinformatics: Bourne/Structural Bioinformatics , 2005 .

[16]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[17]  Yen-Jen Oyang,et al.  Expediting protein structural analysis with an efficient kernel density estimation algorithm , 2003, Fifth International Symposium on Multimedia Software Engineering, 2003. Proceedings..

[18]  Thilo Stehle,et al.  Crystal Structure of the Extracellular Segment of Integrin αVβ3 in Complex with an Arg-Gly-Asp Ligand , 2002, Science.

[19]  W R Taylor,et al.  SSAP: sequential structure alignment program for protein structure comparison. , 1996, Methods in enzymology.