메뉴 건너뛰기




Volumn 49, Issue 8, 2009, Pages 1866-1870

An intersection inequality sharper than the tanimoto triangle inequality for efficiently searching large databases

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL ENGINEERING; CHEMISTRY;

EID: 69549086567     PISSN: 15499596     EISSN: 1549960X     Source Type: Journal    
DOI: 10.1021/ci900133j     Document Type: Article
Times cited : (17)

References (13)
  • 1
    • 0015531930 scopus 로고
    • Some approaches to best-match file searching
    • Burkhard, W.; Keller, R. Some Approaches to Best-Match File Searching. Commun. ACM 1973, 16, 230-236.
    • (1973) Commun. ACM , vol.16 , pp. 230-236
    • Burkhard, W.1    Keller, R.2
  • 2
    • 0017494854 scopus 로고
    • The choice of reference points in best-match file searching
    • Shapiro, M. The Choice of Reference Points in Best-Match File Searching. Commun. ACM 1977, 20, 339-343.
    • (1977) Commun. ACM , vol.20 , pp. 339-343
    • Shapiro, M.1
  • 3
    • 0025406349 scopus 로고
    • New techniques for best-match retrieval
    • Shasha, D.; Wang, T.-L. New Techniques for Best-Match Retrieval. ACM Trans. Inf. Syst. 1990, 8, 140-158.
    • (1990) ACM Trans. Inf. Syst. , vol.8 , pp. 140-158
    • Shasha, D.1    Wang, T.-L.2
  • 4
    • 0028496956 scopus 로고
    • Similarity searching and clustering of chemical-structure databases using molecular property data
    • Downs, G. M.; Willett, P. Similarity Searching and Clustering of Chemical-Structure Databases Using Molecular Property Data. J. Chem. Inf. Comput. Sci. 1994, 34, 1094-1102.
    • (1994) J. Chem. Inf. Comput. Sci. , vol.34 , pp. 1094-1102
    • Downs, G.M.1    Willett, P.2
  • 5
    • 34247228558 scopus 로고    scopus 로고
    • Bounds and algorithms for exact searches of chemical fingerprints in linear and sub-linear time
    • Swamidass, S.; Baldi, P. Bounds and Algorithms for Exact Searches of Chemical Fingerprints in Linear and Sub-Linear Time. J. Chem. Inf. Model. 2007, 47, 302-317.
    • (2007) J. Chem. Inf. Model. , vol.47 , pp. 302-317
    • Swamidass, S.1    Baldi, P.2
  • 8
    • 27944507949 scopus 로고    scopus 로고
    • ChemDB: A public database of small molecules and related chemoinformatics resources
    • Chen, J.; Swamidass, S. J.; Dou, Y.; Bruand, J.; Baldi, P. ChemDB: a Public Database of Small Molecules and Related Chemoinformatics Resources. Bioinformatics 2005, 21, 4133-4139.
    • (2005) Bioinformatics , vol.21 , pp. 4133-4139
    • Chen, J.1    Swamidass, S.J.2    Dou, Y.3    Bruand, J.4    Baldi, P.5
  • 9
    • 49449099341 scopus 로고    scopus 로고
    • Speeding up chemical database searches using a proximity filter based on the logical exclusive-OR
    • Baldi, P.; Hirschberg, D. S.; Nasr, R. J. Speeding Up Chemical Database Searches Using a Proximity Filter Based on the Logical Exclusive-OR. J. Chem. Inf. Model. 2008, 48, 1367-1378.
    • (2008) J. Chem. Inf. Model. , vol.48 , pp. 1367-1378
    • Baldi, P.1    Hirschberg, D.S.2    Nasr, R.J.3
  • 11
    • 0034350524 scopus 로고    scopus 로고
    • A proof of the triangle inequality for the tanimoto distance
    • Lipkus, A. A Proof of the Triangle Inequality for the Tanimoto Distance. J. Math. Chem. 1999, 26, 263-265.
    • (1999) J. Math. Chem. , vol.26 , pp. 263-265
    • Lipkus, A.1
  • 12
    • 0036249270 scopus 로고    scopus 로고
    • Grouping of coefficients for the calculation of inter-molecular similarity and dissimilarity using 2D fragment bit-strings
    • (12) Holliday, J. D.; Hu, C. Y.; Willett, P. Grouping of Coefficients for the Calculation of Inter-Molecular Similarity and Dissimilarity Using 2D Fragment Bit-Strings. Comb. Chem. High Throughput Screening 2002, 5, 155-166. (Pubitemid 34475167)
    • (2002) Combinatorial Chemistry and High Throughput Screening , vol.5 , Issue.2 , pp. 155-166
    • Holliday, J.D.1    Hu, C.-Y.2    Willett, P.3
  • 13


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