An Efficient Implementation of Distance-Based Diversity Measures Based on k−d Trees
- 17 November 1998
- journal article
- research article
- Published by American Chemical Society (ACS) in Journal of Chemical Information and Computer Sciences
- Vol. 39 (1) , 51-58
- https://doi.org/10.1021/ci980100c
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Stochastic Algorithms for Maximizing Molecular DiversityJournal of Chemical Information and Computer Sciences, 1997
- On the Use of Information Theory for Assessing Molecular DiversityJournal of Chemical Information and Computer Sciences, 1997
- Rapid Quantification of Molecular Diversity for Selective Database AcquisitionJournal of Chemical Information and Computer Sciences, 1997
- Optimization and visualization of molecular diversity of combinatorial librariesMolecular Diversity, 1996
- Does Combinatorial Chemistry Obviate Computer-Aided Drug Design?Reviews in Computational Chemistry, 1996
- Refinements to nearest-neighbor searching ink-dimensional treesAlgorithmica, 1991
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975