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

1. Willett P., Barnard J.M., Downs G.M.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6), 983–996 (1998)

   CAS  Google Scholar 

2. 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)

   Article  CAS  Google Scholar 

3. 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)

   Article  CAS  Google Scholar 

4. 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)

   Article  Google Scholar 

5. Späth H.: Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwood, Chicester (1980)

   Google Scholar 

6. Lipkus A.H.: A proof of the triangle inequality for the tanimoto distance. J. Math. Chem. 26(1–3), 263–265 (1999)

   Article  Google Scholar 

7. 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)

   Article  CAS  Google Scholar 

8. 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. 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. S. Brin, Near neighbor search in large metric spaces. VLDB J. 574–584 (1995)

11. Bentley J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)

    Article  Google Scholar 

Download references