Protein ligand-binding site comparison by a reduced vector representation derived from multidimensional scaling of generalized description of binding sites.

Proteins serve various functions in living cells. When they exert their functions, physical contact with other molecules occurs. A close connection therefore exists between their functions and structures. Therefore, comparison and classification about known and predicted protein structures provides important insight into the structural features of proteins, elucidating their functions and structures. Analyzing the mutual interactions between proteins and small molecules is important to predict the ligands which bind to parts of putative ligand binding sites. Such analysis demands a fast and efficient method for comparing ligand binding sites because of the recent increase of protein structure information. A method has been developed for representing a ligand binding site with one reduced vector for binding site comparison. Using our method, one can calculate the similarity between ligand binding sites merely by calculating the inner product of 11-dimensional vectors. The method explained herein shows higher performance of the similarity between binding sites than metrics used in existing alignment-free methods. It also shows performance that is comparable to accurate methods developed recently, which employ solving the optimization problem: APoc. Moreover, these study results suggest that this new method can provide similarities faster than our previous method.

[1]  Yasuo Tabei,et al.  PoSSuM: a database of similar protein–ligand binding and putative pockets , 2011, Nucleic Acids Res..

[2]  Yasuo Tabei,et al.  PDB‐scale analysis of known and putative ligand‐binding sites with structural sketches , 2012, Proteins.

[3]  S. Miyazawa,et al.  Two types of amino acid substitutions in protein evolution , 1979, Journal of Molecular Evolution.

[4]  Vladimir A. Ivanisenko,et al.  PDBSiteScan: a program for searching for active, binding and posttranslational modification sites in the 3D structures of proteins , 2004, Nucleic Acids Res..

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

[6]  Kalidas Yeturu,et al.  PocketMatch: A new algorithm to compare binding sites in protein structures , 2008, BMC Bioinformatics.

[7]  Nathanael Weill,et al.  Alignment-Free Ultra-High-Throughput Comparison of Druggable Protein-Ligand Binding Sites , 2010, J. Chem. Inf. Model..

[8]  Nathan Halko,et al.  Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..

[9]  Daisuke Kihara,et al.  Structure- and sequence-based function prediction for non-homologous proteins , 2012, Journal of Structural and Functional Genomics.

[10]  Kenji Mizuguchi,et al.  PoSSuM v.2.0: data update and a new function for investigating ligand analogs and target proteins of small-molecule drugs , 2014, Nucleic Acids Res..

[11]  Jeffrey Skolnick,et al.  APoc: large-scale identification of similar protein pockets , 2013, Bioinform..

[12]  Daisuke Kihara,et al.  Large-scale binding ligand prediction by improved patch-based method Patch-Surfer2.0 , 2015, Bioinform..

[13]  Janet M. Thornton,et al.  Real spherical harmonic expansion coefficients as 3D shape descriptors for protein binding pocket and ligand comparisons , 2005, Bioinform..

[14]  Jeffrey Skolnick,et al.  A Comprehensive Survey of Small-Molecule Binding Pockets in Proteins , 2013, PLoS Comput. Biol..