Crossref
journal-article
Springer Science and Business Media LLC
Journal of Mathematical Chemistry (297)
References
11
Referenced
9
-
Willett P., Barnard J.M., Downs G.M.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6), 983–996 (1998)
(
10.1021/ci9800211
) / J. Chem. Inf. Comput. Sci. by P. Willett (1998) -
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)
(
10.1021/ci600358f
) / J. Chem. Inf. Model. by S.J. Swamidass (2007) -
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)
(
10.1021/ci800076s
) / J. Chem. Inf. Model. by P. Baldi (2008) -
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)
(
10.1186/1748-7188-5-9
) / Algorithms Mol Biol by T.G. Kristensen (2010) - Späth H.: Cluster Analysis Algorithms for Data Reduction and Classification of Objects. Ellis Horwood, Chicester (1980) / Cluster Analysis Algorithms for Data Reduction and Classification of Objects by H. Späth (1980)
-
Lipkus A.H.: A proof of the triangle inequality for the tanimoto distance. J. Math. Chem. 26(1–3), 263–265 (1999)
(
10.1023/A:1019154432472
) / J. Math. Chem. by A.H. Lipkus (1999) - 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) / J. Chem. Inf. Model. by H. Xu (2003)
- 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)
- 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
- S. Brin, Near neighbor search in large metric spaces. VLDB J. 574–584 (1995)
-
Bentley J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)
(
10.1145/361002.361007
) / Commun. ACM by J.L. Bentley (1975)
Dates
Type | When |
---|---|
Created | 15 years, 5 months ago (March 6, 2010, 1:32 a.m.) |
Deposited | 6 years, 3 months ago (June 2, 2019, 12:33 a.m.) |
Indexed | 1 year, 8 months ago (Dec. 2, 2023, 5:40 p.m.) |
Issued | 15 years, 5 months ago (March 7, 2010) |
Published | 15 years, 5 months ago (March 7, 2010) |
Published Online | 15 years, 5 months ago (March 7, 2010) |
Published Print | 15 years, 1 month ago (Aug. 1, 2010) |
@article{Kristensen_2010, title={Transforming Tanimoto queries on real valued vectors to range queries in Euclidian space}, volume={48}, ISSN={1572-8897}, url={http://dx.doi.org/10.1007/s10910-010-9668-4}, DOI={10.1007/s10910-010-9668-4}, number={2}, journal={Journal of Mathematical Chemistry}, publisher={Springer Science and Business Media LLC}, author={Kristensen, Thomas G.}, year={2010}, month=mar, pages={287–289} }