A Point-Matching Based Algorithm for 3D Surface Alignment of Drug-Sized Molecules
Molecular shapes play an important role in molecular interactions, e.g., between a protein and a ligand. The ‘outer’ shape of a molecule can be approximated by its solvent excluded surface (SES). In this article we present a new approach to molecular surface alignment which is capable of identifying partial similarities. The approach utilizes an iterative point matching scheme which is applied to the points representing the SES. Our algorithm belongs to the multi-start methods. We first generate a number of initial alignments that are locally optimized by an iterative surface point matching algorithm which tries to maximize the number of matched points while minimizing the distance between the matched points. The algorithm identifies similar surface regions given by the matched surface points. This makes it well suited for multiple alignment of molecular surfaces. The subalgorithm proposed for distributing points uniformly across a surface might be of general interest for the comparison of molecular surfaces.
KeywordsVoronoi Diagram Geodesic Distance Surface Point Voronoi Cell Molecular Surface
Unable to display preview. Download preview PDF.
- 3.Goldman, B.B., Wipke, W.T.: Quadratic shape descriptors. 1. rapid superposition of dissimilar molecules using geometrically invariant surface descriptors. J. Chem. Inf. Comp. Sci. 40(3), 644–658 (2000)Google Scholar
- 6.Hofbauer, C.: Molecular Surface Comparison. A Versatile Drug Discovery Tool. PhD thesis, Technische Universität Wien (2004)Google Scholar
- 11.Akutsu, T.: Protein structure alignment using a graph matching technique. Genome Informatics 6, 1–8 (1995)Google Scholar
- 12.Kirchner, S.: Ein Approximationsalgorithmus zur Berechnung der Ähnlichkeit dreidimensionaler Punktmengen. Diploma Thesis, Department of Computer Science. Humboldt University, Berlin (2003)Google Scholar
- 15.AmiraMol, AmiraDeconv - Extensions for Amira 3.1. Zuse Institute Berlin (ZIB) and Mercury Computer Systems - TGS Group (2003), http://amira.zib.de/Amira31-MolDeconv-manual.pdf
- 16.Karypis, G., Kumar, V.: METIS, a Software Package for Partitioning Unstructured Graphs and Computing Fill-Reduced Orderings of Sparse Matrices. University of Minnesota, Department of Computer Science (1998)Google Scholar
- 17.Deussen, O., Hiller, S., van Overveld, C.W.A.M., Strothotte, T.: Floating points: A method for computing stipple drawings. Comput. Graph. Forum 19(3) (2000)Google Scholar
- 18.Surazhsky, V., Gotsman, C.: Explicit surface remeshing. In: Symposium on Geometry Processing, pp. 20–30 (2003)Google Scholar
- 20.Protein Data Bank (PBD), http://www.rcsb.org/pdb/