Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 253-264
- https://doi.org/10.1007/3-540-48447-7_26
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient database screening for rational drug design using pharmacophore-constrained conformational searchPublished by Association for Computing Machinery (ACM) ,1999
- Fast detection of common geometric substructure in proteinsPublished by Association for Computing Machinery (ACM) ,1999
- Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein MoleculesPublished by Springer Nature ,1999
- Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point SetsDiscrete & Computational Geometry, 1998
- Improvements on bottleneck matching and related problems using geometryPublished by Association for Computing Machinery (ACM) ,1996
- Combinatorial and experimental results for randomized point matching algorithmsPublished by Association for Computing Machinery (ACM) ,1996
- Approximate decision algorithms for approximate congruenceInformation Processing Letters, 1992
- 3-D substructure matching in protein MoleculesPublished by Springer Nature ,1992
- Data Structures and Algorithms 3Published by Springer Nature ,1984
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973