메뉴 건너뛰기




Volumn 39, Issue 1, 1999, Pages 51-58

An efficient implementation of distance-based diversity measures based on k-d trees

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0001916126     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci980100c     Document Type: Article
Times cited : (57)

References (25)
  • 4
    • 0031502511 scopus 로고    scopus 로고
    • Does combinatorial chemistry obviate computer-aided drug design? in
    • Lipkowitz, K. B.; Boyd, D. B., Eds.; VCH: New York, Chapter 2
    • Martin, E. J.; Spellmeyer, D. C.; Critchlow, R. E., Jr.; Blaney, J. M. Does combinatorial chemistry obviate computer-aided drug design? In Reviews in Computational Chemistry; Lipkowitz, K. B.; Boyd, D. B., Eds.; VCH: New York, 1997; Vol. 10, Chapter 2, p 75.
    • (1997) Reviews in Computational Chemistry , vol.10 , pp. 75
    • Martin, E.J.1    Spellmeyer, D.C.2    Critchlow Jr., R.E.3    Blaney, J.M.4
  • 5
    • 0002647926 scopus 로고    scopus 로고
    • Rapid quantification of molecular diversity for selective database aqcuisition
    • Turner, D. B.; Tyrrell, S. M.; Willett, P. Rapid quantification of molecular diversity for selective database aqcuisition. J. Chem. Inf. Comput. Sci. 1997, 37, 18-22.
    • (1997) J. Chem. Inf. Comput. Sci. , vol.37 , pp. 18-22
    • Turner, D.B.1    Tyrrell, S.M.2    Willett, P.3
  • 9
    • 0000191614 scopus 로고    scopus 로고
    • Stochastic algorithms for maximizing molecular diversity
    • Agrafiotis, D. K. Stochastic algorithms for maximizing molecular diversity. J. Chem. Inf. Comput. Sci. 1997, 37(5), 841-851.
    • (1997) J. Chem. Inf. Comput. Sci. , vol.37 , Issue.5 , pp. 841-851
    • Agrafiotis, D.K.1
  • 11
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Bentley, J. L. Multidimensional binary search trees used for associative searching. Comm. ACM 1975, 18(9), 509-517.
    • (1975) Comm. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1
  • 12
    • 84945709355 scopus 로고
    • An algorithm for finding best matches in logarithmic expected time
    • Friedman, J. H.; Bentley, J. L.; Finkel, R. A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Soft. 1977, 3(3), 209-226.
    • (1977) ACM Trans. Math. Soft. , vol.3 , Issue.3 , pp. 209-226
    • Friedman, J.H.1    Bentley, J.L.2    Finkel, R.A.3
  • 13
    • 0025796458 scopus 로고
    • Refinements to nearest-neighbor searching in kdimensional trees
    • Sproull, R. F. Refinements to nearest-neighbor searching in kdimensional trees. Algorithmica 1991, 6, 579-589.
    • (1991) Algorithmica , vol.6 , pp. 579-589
    • Sproull, R.F.1
  • 14
    • 0003241739 scopus 로고
    • Bump trees for efficient function, constraint and classification learning
    • Lippmann, Moody, Touretzky, Eds.; Morgan-Kaufmann: San Mateo, CA
    • Omohundro, S. M. Bump trees for efficient function, constraint and classification learning. In Advances in Neural Information Processing Systems 3; Lippmann, Moody, Touretzky, Eds.; Morgan-Kaufmann: San Mateo, CA, 1991; pp 693-699.
    • (1991) Advances in Neural Information Processing Systems 3 , pp. 693-699
    • Omohundro, S.M.1
  • 16
    • 0021644214 scopus 로고
    • The quad-tree and related hierarchical data structures
    • Samet, H. The quad-tree and related hierarchical data structures. ACM Comput. Surveys 1984, 16(2), 187-260.
    • (1984) ACM Comput. Surveys , vol.16 , Issue.2 , pp. 187-260
    • Samet, H.1
  • 17
    • 0027188633 scopus 로고
    • Data structures and algorithms for nearest neighbor search in general metric spaces
    • Yanilos, P. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. Fourth ACM-SIAM Sympos. Discrete Algorithms 1993, 311-321.
    • (1993) Proc. Fourth ACM-SIAM Sympos. Discrete Algorithms , pp. 311-321
    • Yanilos, P.1
  • 19
    • 85034563087 scopus 로고    scopus 로고
    • Copyright 3-Dimensional Pharmaceuticals, Inc., 1994-1998
    • Copyright 3-Dimensional Pharmaceuticals, Inc., 1994-1998.
  • 21
    • 0000709242 scopus 로고    scopus 로고
    • On the use of information theory for assessing molecular diversity
    • Agrafiotis, D. K. On the use of information theory for assessing molecular diversity. J. Chem. Inf. Comput. Sci. 1997, 37(3), 576-580.
    • (1997) J. Chem. Inf. Comput. Sci. , vol.37 , Issue.3 , pp. 576-580
    • Agrafiotis, D.K.1
  • 22
    • 85138962150 scopus 로고    scopus 로고
    • Molecular diversity assessment: Logarithmic relations of information and species diversity and logarithmic relations of entropy and indistinguishability after rejection of Gibbs paradox of entropy mixing
    • Lin, S. K. Molecular diversity assessment: logarithmic relations of information and species diversity and logarithmic relations of entropy and indistinguishability after rejection of Gibbs paradox of entropy mixing. Molecules 1996, 1, 57-67.
    • (1996) Molecules , vol.1 , pp. 57-67
    • Lin, S.K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.