{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:31:36Z","timestamp":1768109496630,"version":"3.49.0"},"reference-count":71,"publisher":"American Chemical Society (ACS)","issue":"12","license":[{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-045"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Chem. Inf. Model."],"published-print":{"date-parts":[[2020,12,28]]},"DOI":"10.1021\/acs.jcim.0c00393","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T14:48:55Z","timestamp":1603464535000},"page":"6167-6184","source":"Crossref","is-referenced-by-count":5,"title":["Benchmark on Indexing Algorithms for Accelerating Molecular Similarity Search"],"prefix":"10.1021","volume":"60","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5227-3575","authenticated-orcid":true,"given":"Chun Jiang","family":"Zhu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0887-0767","authenticated-orcid":true,"given":"Minghu","family":"Song","sequence":"additional","affiliation":[]},{"given":"Qinqing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chlo\u00e9","family":"Becquey","sequence":"additional","affiliation":[]},{"given":"Jinbo","family":"Bi","sequence":"additional","affiliation":[]}],"member":"316","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"key":"ref1\/cit1","doi-asserted-by":"publisher","DOI":"10.1021\/jm401411z"},{"key":"ref2\/cit2","volume-title":"Concepts and Applications of Molecular Similarity","author":"Johnson M. A.","year":"1990"},{"key":"ref3\/cit3","doi-asserted-by":"publisher","DOI":"10.1021\/ci010132r"},{"key":"ref4\/cit4","doi-asserted-by":"publisher","DOI":"10.1021\/ci100050t"},{"key":"ref5\/cit5","doi-asserted-by":"publisher","DOI":"10.1021\/ci025531g"},{"key":"ref6\/cit6","doi-asserted-by":"publisher","DOI":"10.1016\/j.drudis.2006.10.005"},{"key":"ref7\/cit7","unstructured":"Omohundro, S. M.Five Balltree Construction Algorithms, Technical Report; UC: Berkeley, 1989."},{"key":"ref8\/cit8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"ref9\/cit9","unstructured":"Yianilos, P. InData Structures and Algorithms for Nearest Neighbor Searches in General Metric Spaces, Proceedings of the 4th annual ACM-SIAM Symposium on Discrete Algorithms, 1993; pp 311\u2013321."},{"key":"ref10\/cit10","doi-asserted-by":"crossref","unstructured":"Sebastian, T. B.; Kimia, B. B. InMetric-Based Shape Retrieval in Large Databases, Proceedings of the 16th International Conference on Pattern Recognition, 2002; pp 291\u2013296.","DOI":"10.1109\/ICPR.2002.1047852"},{"key":"ref11\/cit11","doi-asserted-by":"crossref","unstructured":"Dong, W.; Charikar, M.; Li, K. InEfficient K-Nearest Neighbor Graph Construction for Generic Similarity Measures, Proceedings of the 20th International Conference on World Wide Web, 2011; pp 577\u2013586.","DOI":"10.1145\/1963405.1963487"},{"key":"ref12\/cit12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref13\/cit13","doi-asserted-by":"publisher","DOI":"10.1021\/ci600358f"},{"key":"ref14\/cit14","doi-asserted-by":"crossref","unstructured":"Indyk, P.; Motwani, R. InApproximate Nearest Neighbors: Towards Removing the Curse of Dimensionality, Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1998; pp 604\u2013613.","DOI":"10.1145\/276698.276876"},{"key":"ref15\/cit15","unstructured":"Gionis, A.; Indyk, P.; Motwani, R. InSimilarity Search in High Dimensions via Hashing, Proceedings of the 25th International Conference on Very Large Data Bases, 1999; pp 518\u2013529."},{"key":"ref16\/cit16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of Massive Datasets","author":"Rajaraman A.","year":"2011"},{"key":"ref17\/cit17","doi-asserted-by":"publisher","DOI":"10.1021\/ci800076s"},{"key":"ref18\/cit18","doi-asserted-by":"publisher","DOI":"10.1021\/ci100132g"},{"key":"ref19\/cit19","doi-asserted-by":"publisher","DOI":"10.1021\/ci200552r"},{"key":"ref20\/cit20","doi-asserted-by":"publisher","DOI":"10.1021\/ci500150t"},{"key":"ref21\/cit21","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.9b00069"},{"key":"ref22\/cit22","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-5-9"},{"key":"ref23\/cit23","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref24\/cit24","doi-asserted-by":"crossref","unstructured":"Iwasaki, M. InPruned Bi-Directed k-Nearest Neighbor Graph for Proximity Search, Proceedings of International Conference on Similarity Search and Applications, 2016; pp 20\u201333.","DOI":"10.1007\/978-3-319-46759-7_2"},{"key":"ref25\/cit25","unstructured":"Iwasaki, M.; Miyazaki, D. Optimization of Indexing Based on K-Nearest Neighbor Graph for Proximity Search in High-Dimensional Data. 2018. arXiv:1810.07355. arXiv.org e-Print archive. https:\/\/arxiv.org\/abs\/1810.07355."},{"key":"ref26\/cit26","unstructured":"Johnson, J.; Douze, M.; J\u00e9gou, H. Billion-Scale Similarity Search with GPUs. 2017. arXiv1702.08734. arXiv.org e-Print archive. https:\/\/arxiv.org\/abs\/1702.08734."},{"key":"ref27\/cit27","doi-asserted-by":"crossref","unstructured":"Leonid, B.; Bilegsaikhan, N. InEngineering Efficient and Effective Non-Metric Space Library, Proceedings of International Conference on Similarity Search and Applications, 2013; pp 280\u2013293.","DOI":"10.1007\/978-3-642-41062-8_28"},{"key":"ref28\/cit28","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-019-1738-8"},{"key":"ref29\/cit29","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1006494"},{"key":"ref30\/cit30","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.8b00839"},{"key":"ref31\/cit31","unstructured":"Polykovskiy, D.; Zhebrak, A.; Sanchez-Lengeling, B.; Golovanov, S.; Tatanov, O. Molecular Sets (MOSES): A Benchmarking Platform for Molecular Generation Models. 2018. arXiv1811.12823. arXiv.org e-Print archive. https:\/\/arxiv.org\/abs\/1811.12823."},{"key":"ref32\/cit32","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-016-0148-0"},{"key":"ref33\/cit33","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-020-00445-4"},{"key":"ref34\/cit34","doi-asserted-by":"crossref","unstructured":"Aum\u00fcller, M.; Bernhardsson, E.; Faithfull, A. InANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms, Proceedings of International Conference on Similarity Search and Applications, 2017; pp 34\u201349.","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"ref35\/cit35","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-019-0398-8"},{"key":"ref36\/cit36","unstructured":"Datasketch: Big Data Looks Small. https:\/\/ekzhu.github.io\/datasketch (accessed May 31, 2019)."},{"key":"ref37\/cit37","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"ref38\/cit38","unstructured":"Brin, S. InNear Neighbor Search in Large Metric Spaces, Proceedings of the 21th International Conference on Very Large Data Bases, 1995; pp 574\u2013584."},{"key":"ref39\/cit39","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(86)90013-9"},{"key":"ref40\/cit40","unstructured":"FPSim2. http:\/\/chembl.blogspot.com\/2020\/06\/fpsim2-v020.html."},{"key":"ref41\/cit41","doi-asserted-by":"publisher","DOI":"10.1021\/ci900133j"},{"key":"ref42\/cit42","unstructured":"Broder, A. InOn the Resemblance and Containment of Documents, Proceedings of the Compression and Complexity of Sequences, 1997; pp 21\u201329."},{"key":"ref43\/cit43","doi-asserted-by":"crossref","unstructured":"Bawa, M.; Condie, T.; Ganesan, P. InLSH Forest: Self-Tuning Indexes for Similarity Search, Proceedings of the 14th International Conference on World Wide Web, 2005; pp 651\u2013660.","DOI":"10.1145\/1060745.1060840"},{"key":"ref44\/cit44","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-018-0321-8"},{"key":"ref45\/cit45","doi-asserted-by":"publisher","DOI":"10.1021\/ci00049a008"},{"key":"ref46\/cit46","doi-asserted-by":"crossref","unstructured":"Dalke, A. RISC and Dense Fingerprints, 2019. https:\/\/chemrxiv.org\/articles\/RISC_and_Dense_Fingerprints\/8218517\/1.","DOI":"10.26434\/chemrxiv.8218517"},{"key":"ref47\/cit47","doi-asserted-by":"publisher","DOI":"10.1145\/356789.356797"},{"key":"ref48\/cit48","doi-asserted-by":"crossref","unstructured":"Guttman, A. InR-Tree: A Dynamic Index Structure for Spatial Searching, Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, 1984; pp 47\u201357.","DOI":"10.1145\/971697.602266"},{"key":"ref49\/cit49","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"key":"ref50\/cit50","doi-asserted-by":"publisher","DOI":"10.1002\/minf.201100089"},{"key":"ref51\/cit51","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"Okabe A.","year":"1992"},{"key":"ref52\/cit52","first-page":"2825","volume":"12","author":"Pedregosa F.","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref53\/cit53","first-page":"2","volume":"2014","author":"Merkel D.","year":"2014","journal-title":"Linux J."},{"key":"ref54\/cit54","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0177459"},{"key":"ref55\/cit55","unstructured":"Docker compatibility with singularity for HPC. https:\/\/devblogs.nvidia.com\/docker-compatibility-singularity-hpc\/."},{"key":"ref56\/cit56","unstructured":"Jacobsen, D. M.; Canon, R. S. InContain This, Unleashing Docker for HPC, Proceedings of the Cray User Group, 2015."},{"key":"ref57\/cit57","doi-asserted-by":"crossref","unstructured":"Priedhorsky, R.; Randles, T. InCharliecloud: Unprivileged Containers for User-Defined Software Stacks in HPC, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, 2017; pp 1\u201310.","DOI":"10.1145\/3126908.3126925"},{"key":"ref58\/cit58","doi-asserted-by":"crossref","unstructured":"Benedicic, L.; Cruz, F. A.; Madonna, A.; Mariotti, K. S. InHighly Scalable Docker Containers for HPC Systems, ISC High Performance: International Conference on High Performance Computing, 2019; pp 46\u201360.","DOI":"10.1007\/978-3-030-34356-9_5"},{"key":"ref59\/cit59","doi-asserted-by":"crossref","unstructured":"Azab, A. InEnabling Docker Containers for High-Performance and Many-Task Computing, IEEE International Conference on Cloud Engineering, 2017; pp 279\u2013285.","DOI":"10.1109\/IC2E.2017.52"},{"key":"ref60\/cit60","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gky1075"},{"key":"ref61\/cit61","unstructured":"MolPort available compound database. https:\/\/www.molport.com\/shop\/database-download."},{"key":"ref62\/cit62","unstructured":"Landrum, G. RDKit: Open-source cheminformatics. https:\/\/www.rdkit.org."},{"key":"ref63\/cit63","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0686-2"},{"key":"ref64\/cit64","unstructured":"h5sparse 0.1.0. https:\/\/pypi.org\/project\/h5sparse\/."},{"key":"ref65\/cit65","volume-title":"Deep Learning","author":"Goodfellow I.","year":"2016"},{"key":"ref66\/cit66","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"ref67\/cit67","doi-asserted-by":"crossref","unstructured":"Brati\u0107, B.; Houle, M. E.; Kurbalija, V.; Oria, V.; Radovanovi\u0107, M. InNN-Descent on High-Dimensional Data, Proceedings of the 8th International Conference on Web Intelligence, Mining and Semantics, 2018; pp 1\u20138.","DOI":"10.1145\/3227609.3227643"},{"key":"ref68\/cit68","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213019600029"},{"key":"ref69\/cit69","first-page":"2487","volume":"11","author":"Radovanovi\u0107 M.","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref70\/cit70","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2365790"},{"key":"ref71\/cit71","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM47256.2019.8982950"}],"container-title":["Journal of Chemical Information and Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubs.acs.org\/doi\/pdf\/10.1021\/acs.jcim.0c00393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T10:06:15Z","timestamp":1723802775000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubs.acs.org\/doi\/10.1021\/acs.jcim.0c00393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,23]]},"references-count":71,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12,28]]}},"alternative-id":["10.1021\/acs.jcim.0c00393"],"URL":"https:\/\/doi.org\/10.1021\/acs.jcim.0c00393","relation":{},"ISSN":["1549-9596","1549-960X"],"issn-type":[{"value":"1549-9596","type":"print"},{"value":"1549-960X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,23]]}}}