Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing

Bioinformatics

Volumn 26, Issue 7, 2010, Pages 953-959

  Cao, Yiqun ^a   Jiang, Tao ^a   Girke, Thomas ^b  

^a University of California Riverside   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; AUTOMATED PATTERN RECOGNITION; BIOLOGY; CLUSTER ANALYSIS; INFORMATION RETRIEVAL; METHODOLOGY;

CLUSTER ANALYSIS; COMPUTATIONAL BIOLOGY; INFORMATION STORAGE AND RETRIEVAL; PATTERN RECOGNITION, AUTOMATED;

EID: 77951946180     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq067     Document Type: Article

References (45)

1. Agrafiotis, D. (2003) Stochastic proximity embedding. J. Comput. Chem., 24, 1215-1221.
2. Agrafiotis, D. and Lobanov, V. (1999) An efficient implementation of distance-based diversity measures based on kd trees. J. Chem. Inf. Comput. Sci., 39, 51-58
3. Agrafiotis, D. et al. (2001) Multidimensional scaling and visualization of large molecular similarity tables. J. Comput. Chem., 22, 488-500
4. Agrafiotis, D.K. and Xu, H. (2002) A self-organizing principle for learning nonlinear manifolds. Proc. Natl Acad. Sci. USA, 99, 15869-15872
5. Austin, C.P. et al. (2004) NIH molecular libraries initiative. Science, 306, 1138-1139
6. Baldi, P. et al. (2008) Speeding up chemical database searches using a proximity filter based on the logical exclusive OR. J. Chem. Inf. Model., 48, 1367-1378
7. Bentley, J. (1975) Multidimensional binary search trees used for associative searching. Comm. ACM, 18, 509-517
8. Bohm, C. et al. (2001) Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput. Surv., 33, 322-373
9. Brinkhoff, T. et al. (1993) Efficient processing of spatial joins using R-trees. In Proceedings of ACM SIGMOD Conference on Management of Data. ACM, New York, NY, pp. 237-246
10. Cao, Y. et al. (2008) A maximum common substructure-based algorithm for searching and predicting drug-like compounds. Bioinformatics, 24, i366
11. Chang, C. and Lee, R. (1973) A heuristic relaxation method for nonlinear mapping in cluster analysis. IEEE Trans. Syst. Man Cybernet., 3, 197200
12. Chen, J.H. et al. (2007) ChemDB update-full-text search and virtual chemical space. Bioinformatics, 23, 2348-2351
13. Chen, X. and Reynolds, C. (2002) Performance of similarity measures in 2D fragment-based similarity searching: comparison of structural descriptors and similarity coefficients. J. Chem. Inf. Comput. Sci., 42, 1407-1414
14. Cheng, A.C. et al. (2007) Structure-based maximal affinity model predicts small-molecule druggability. Nat. Biotechnol., 25, 71-75
15. Datar, M. et al. (2004) Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the Twentieth Annual Symposium on Computational Geometry. ACM, New York, NY, pp. 253-262
16. Downs, G. and Barnard, J. (2002) Clustering methods and their uses in computational chemistry. Rev. Comput. Chem., 18, 1-40
17. Faloutsos, C. and Lin, K. (1995) Fast Map: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of the ACM SIGMOD Conference on Management of Data. ACM, New York, NY, pp. 163-174
18. Fu, A. et al. (2000) Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB J., 9, 154-173
19. Gionis, A. et al. (1999) Similarity search in high dimensions via hashing. In Proceedings of the International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., San Francisco, pp. 518-529
20. Girke, T. et al. (2005) ChemMine.Acompound mining database for chemical genomics. Plant Physiol., 138, 573-577
21. Haggarty, S.J. (2005) The principle of complementarity: chemical versus biological space. Curr. Opin. Chem. Biol., 9, 296-303
22. Ihlenfeldt, W.D. et al. (2002) Enhanced CACTVS browser of the open NCI database. J. Chem. Inf . Comput. Sci., 42, 46-57
23. Irwin, J.J. and Shoichet, B.K. (2005) ZINC-a free database of commercially available compounds for virtual screening. J. Chem. Inf. Model., 45, 177-182
24. Katayama, N. (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In Proceedings of the ACM SIGMOD Conference on Management of Data. ACM, New York, NY, pp. 369-380
25. Kruskal, J. and Wish, M. (1978) Multidimensional Scaling. Sage Publications
26. Lv, Q. et al. (2007) Multi-probe LSH: efficient indexing for high-dimensional similarity search. In Proceedings of the International Conference on Very Large Data Bases. VLDB Endowment, pp. 950-961.
27. NIH Chemical Genomics Center (2009) PubChem Fingerprint for JChem. Available at http://ncgc.nih.gov/resources/software.html (last accessed date March 1, 2010).
28. Oprea, T.I. (2002) Chemical space navigation in lead discovery. Curr. Opin. Chem. Biol., 6, 384-389
29. Oprea, T.I. et al. (2007) Systems chemical biology. Nat. Chem. Biol., 3, 447-450
30. Raymond, J.W. et al. (2003) Comparison of chemical clustering methods using graph-and fingerprint-based similarity measures. J. Mol. Graph Model., 21, 421-433
31. Roweis, S. and Saul, L. (2000) Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2323
32. Savchuk, N.P. et al. (2004) Exploring the chemogenomic knowledge space with annotated chemical libraries. Curr. Opin. Chem. Biol., 8, 412-417
33. Seiler, K.P. et al. (2008) ChemBank: a small-molecule screening and cheminformatics resource database. Nucleic Acids. Res., 36 (Database issue), 351-359
34. Sheridan, R.P. and Kearsley, S.K. (2002) Why do we need so many chemical similarity search methods? Drug Discov. Today, 7, 903-911
35. Smellie, A. et al. (2006) Visualization and interpretation of high content screening data. J. Chem. Inf. Model., 46, 201-207
36. Strausberg, R.L. and Schreiber, S.L. (2003) From knowing to controlling: a path from genomics to drugs using small molecule probes. Science, 300, 294-295
37. Swamidass, S. and Baldi, P. (2007) Bounds and algorithms for fast exact searches of chemical fingerprints in linear and sub-linear time. J. Chem. Inf. Model., 47, 302
38. Tenenbaum, J. et al. (2000) A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319
39. Vaidya, P. (1989) An O (n logn) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4, 101-115
40. Weber, R. et al. (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the International Conference on Very Large Data Bases. IEEE, pp. 194-205
41. Willett, P. Similarity and Clustering in Chemical Information Systems. John Wiley & Sons, Inc., New York
42. Willett, P. (2005) Searching techniques for databases of two-and three-dimensional chemical structures. J. Med. Chem., 48, 4183-4199
43. Willett, P. (1998) Chemical similarity searching. J. Chem. Inf. Comput. Sci., 38, 983-996
44. Xu, H. and Agrafiotis, D. (2003). Nearest neighbor search in general metric spaces using a tree data structure with a simple heuristic. J. Chem. Inf. Comput. Sci., 43, 1933-1941
45. Zhu, C. (1997) L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization. ACM Trans. Math. Softw., 23, 550-560