@inproceedings{cb226d5a0de449ad9d51b5e1aedd431b,
title = "Determining similarity of conformational polymorphs",
abstract = "Conformational polymorphs are identical molecules that crystallize in different spatial formations. Understanding the amount of difference between the polymorphs might aid drug design as there is a widespread assumption that there exists a direct connection between the conformations in the crystallized form of the molecule and the conformations in the solvent. We define a measure of similarity between conformational polymorphs and present an algorithm to compute it. For this end we weave together in a novel way our graph isomorphism method and substructure matching. We tested our algorithm on conformational polymorphs from the Cambridge Structural Database. Our experiments show that our method is very efficient in practice and has already yielded an important insight on the polymorphs stored in the data base.",
author = "Angela Enosh and Klara Kedem and Joel Bernstein",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 10th Annual European Symposium on Algorithms, ESA 2002 ; Conference date: 17-09-2002 Through 21-09-2002",
year = "2002",
month = jan,
day = "1",
doi = "10.1007/3-540-45749-6_40",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "436--448",
editor = "Rolf M{\"o}hring and Rajeev Raman",
booktitle = "Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings",
address = "Germany",
}