A point-matching based algorithm for 3D surface alignment of drug-sized molecules

7Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Baum, D., & Hege, H. C. (2006). A point-matching based algorithm for 3D surface alignment of drug-sized molecules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4216 LNBI, pp. 183–193). Springer Verlag. https://doi.org/10.1007/11875741_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free