A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules
[chapter]
1999
Lecture Notes in Computer Science
Identifying the common 3-D substructure between two drug or protein molecules is an important problem in synthetic drug design and molecular biology. This problem can be represented as the following geometric pattern matching problem: given two point sets A and B in three-dimensions, and a real number > 0, nd the maximum cardinality subset S A for which there is an isometry I, such that each point of I(S) is within distance of a distinct point of B. Since it is di cult to solve this problem
doi:10.1007/3-540-48447-7_26
fatcat:nii4c3q7evgmxm6xydlpbjicny