메뉴 건너뛰기




Volumn 48, Issue 2, 2010, Pages 287-289

Transforming Tanimoto queries on real valued vectors to range queries in Euclidian space

Author keywords

Range query; Real valued descriptors; Tanimoto coefficient

Indexed keywords


EID: 77954455522     PISSN: 02599791     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10910-010-9668-4     Document Type: Article
Times cited : (11)

References (11)
  • 2
    • 34247228558 scopus 로고    scopus 로고
    • Bounds and algorithms for fast exact searches of chemical fingerprints in linear and sublinear time
    • Swamidass S. J., Baldi P.: Bounds and algorithms for fast exact searches of chemical fingerprints in linear and sublinear time. J. Chem. Inf. Model. 47(2), 302-317 (2007).
    • (2007) J. Chem. Inf. Model. , vol.47 , Issue.2 , pp. 302-317
    • Swamidass, S.J.1    Baldi, P.2
  • 3
    • 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. 48(7), 1367-1378 (2008).
    • (2008) J. Chem. Inf. Model. , vol.48 , Issue.7 , pp. 1367-1378
    • Baldi, P.1    Hirschberg, D.S.2    Nasr, R.J.3
  • 4
    • 77649171863 scopus 로고    scopus 로고
    • A tree-based method for the rapid screening of chemical fingerprints
    • Kristensen T. G., Nielsen J., Pedersen C. N. S.: A tree-based method for the rapid screening of chemical fingerprints. Algorithms Mol Biol 5(1), 9 (2010).
    • (2010) Algorithms Mol Biol , vol.5 , Issue.1 , pp. 9
    • Kristensen, T.G.1    Nielsen, J.2    Pedersen, C.N.S.3
  • 6
    • 0034350524 scopus 로고    scopus 로고
    • A proof of the triangle inequality for the tanimoto distance
    • Lipkus A. H.: A proof of the triangle inequality for the tanimoto distance. J. Math. Chem. 26(1-3), 263-265 (1999).
    • (1999) J. Math. Chem. , vol.26 , Issue.1-3 , pp. 263-265
    • Lipkus, A.H.1
  • 7
    • 0344686480 scopus 로고    scopus 로고
    • Nearest neighbor search in general metric spaces using a tree data structure with a simple heuristic
    • Xu H., Agrafiotis D. K.: Nearest neighbor search in general metric spaces using a tree data structure with a simple heuristic. J. Chem. Inf. Model. 43(6), 1933-1941 (2003).
    • (2003) J. Chem. Inf. Model. , vol.43 , Issue.6 , pp. 1933-1941
    • Xu, H.1    Agrafiotis, D.K.2
  • 8
    • 0027188633 scopus 로고    scopus 로고
    • P. N. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms (1993).
  • 9
    • 84993661659 scopus 로고    scopus 로고
    • P. Ciaccia, M. Patella, P. Zezula, M-tree: An efficient access method for similarity search in metric spaces. In VLDB'97: Proceedings of 23rd International Conference on Very Large Data Bases (August 25-29, 1997, Athens, Greece), ed. by M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, M. A. Jeusfeld (Morgan Kaufmann, 1997), pp. 426-435.
  • 10
    • 77954459876 scopus 로고    scopus 로고
    • S. Brin, Near neighbor search in large metric spaces. VLDB J. 574-584 (1995).
  • 11
    • 0016557674 scopus 로고
    • Multidimensional binary search trees used for associative searching
    • Bentley J. L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509-517 (1975).
    • (1975) Commun. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.L.1


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