Protein Surface Matching by Combining Local and Global Geometric Information

Leif Ellingson, Jinfeng Zhang

Research output: Contribution to journalArticlepeer-review


Comparison of the binding sites of proteins is an effective means for predicting protein functions based on their structure information. Despite the importance of this problem and much research in the past, it is still very challenging to predict the binding ligands from the atomic structures of protein binding sites. Here, we designed a new algorithm, TIPSA (Triangulation-based Iterative-closest-point for Protein Surface Alignment), based on the iterative closest point (ICP) algorithm. TIPSA aims to find the maximum number of atoms that can be superposed between two protein binding sites, where any pair of superposed atoms have 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 found that, due to the plasticity of protein binding sites, matching the rigid body of point clouds of protein binding sites is not adequate
Original languageEnglish
Pages (from-to)14 pages
JournalPLoS ONE
StatePublished - Jul 17 2012


Dive into the research topics of 'Protein Surface Matching by Combining Local and Global Geometric Information'. Together they form a unique fingerprint.

Cite this