Geometric hashing
From Proteinfunction.net
Geometric hashing, a technique originally developed in computer vision for matching geometric features against a database of such features, finds use in a number of other areas. Matching is possible even when the recognizable database objects have undergone transformations or when only partial information is present. The technique is highly effiecient and of low polynomical complexity. In the recognition of regions on the surface of one protein, this technique has been used.[edit]
SiteEngine
Recognition of regions on the surface of one protein, that are similar to a binding site of another is crucial for the prediction of molecular interactions and for functional classifications. They first describe a method, SiteEngine, that assumes no sequence or fold similarities and is able to recognize proteins that have similar binding sites and may perform similar functions. They produce a low-resolution surface representation via chemically important surface points, by hashing triangles of physico-chemical properties and by application of hierarchical scoring schemes for a thorough exploration of global and local similarities.
[edit]
Reference
Alexandra Shulman-Peleg, Ruth Nussinov and Haim J. Wolfson, Recognition of Functional Sites in Protein Structures, J. Mol. Biol. (2004) 339, 607–633
