3D Molecular Similarity: Method and Algorithms

  • URSU O
  • V. DIUDEA M
  • NAKAYAMA S
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This study presents a method and algorithms for calculation of 3D similarity between pairs of chemical structures represented as 3D molecular graphs. Similarity searching in chemical databases is widely used for virtual screening, lead discovery and optimization, and most recently protein amino-acid sequences studies to discover and determine the functionality of a new isolated protein. This method has obvious advantages over other known methods due to the following: (i) the superposition method does not depend on the preliminary alignments of the chemical structures; (ii) entire conformational space is searched without generation of each conformer; (iii) excellent discrimination between geometrical isomers. Although it is a computationally demanding method, recent implementation of maximum clique algorithm and bound smoothing algorithm made possible the optimization of this method and application to similarity searching in chemical databases of non trivial size.

Cite

CITATION STYLE

APA

URSU, O., V. DIUDEA, M., & NAKAYAMA, S. (2006). 3D Molecular Similarity: Method and Algorithms. Journal of Computer Chemistry, Japan, 5(1), 39–46. https://doi.org/10.2477/jccj.5.39

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