An efficient algorithm for matching protein binding sites for protein function prediction

Authors:
Leif Ellingson;Jinfeng Zhang
Affiliations:
Florida State University, Tallahassee, FL;Florida State University, Tallahassee, FL
Venue:
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Year:
2011

Citing 5
Cited 0

A Method for Registration of 3-D Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Efficient similarity search in protein structure databases by k-clique hashing

Bioinformatics
Real spherical harmonic expansion coefficients as 3D shape descriptors for protein binding pocket and ligand comparisons

Bioinformatics
Analysis of binding site similarity, small-molecule similarity and experimental binding profiles in the human cytosolic sulfotransferase family

Bioinformatics
The Poisson Index

Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Comparing the binding sites of proteins is effective for predicting protein functions based on their structure information. However, it is still very challenging to predict the binding ligands from the atomic structures of protein binding sites. In this study, we designed a new algorithm based on the iterative closest point (ICP) algorithm. Our algorithm aims to find the maximum number of atoms that can be superposed between two protein binding sites, where any pair of matched superposed atoms has a distance smaller than a given threshold. The search starts from similar tetrahedra between two binding sites obtained from 3D Delaunay triangulation and uses the Hungarian algorithm to find additional matched atoms. We show that our method finds more matched atoms than a leading method. For benchmark data, we use the Tanimoto Index as a similarity measure and the nearest neighbor classifier to achieve a classification performance comparable to the best methods in the literature among those that provide both the common atom set and atom correspondences.