{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T09:19:34Z","timestamp":1775899174825,"version":"3.50.1"},"reference-count":30,"publisher":"American Chemical Society (ACS)","issue":"13","license":[{"start":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T00:00:00Z","timestamp":1750118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T00:00:00Z","timestamp":1750118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T00:00:00Z","timestamp":1750118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-045"}],"funder":[{"DOI":"10.13039\/100000057","name":"National Institute of General Medical Sciences","doi-asserted-by":"publisher","award":["R35GM150620"],"award-info":[{"award-number":["R35GM150620"]}],"id":[{"id":"10.13039\/100000057","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Chem. Inf. Model."],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1021\/acs.jcim.5c00392","type":"journal-article","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T03:51:30Z","timestamp":1750132290000},"page":"6968-6975","source":"Crossref","is-referenced-by-count":3,"title":["CADENCE: Clustering Algorithm\u2500Density-Based Exploration and Novelty Clustering with Efficiency"],"prefix":"10.1021","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9528-942X","authenticated-orcid":true,"given":"Lexin","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Chemistry","place":["Gainesville, United States"]},{"name":"University of Florida","place":["Gainesville, United States"]},{"name":"Quantum Theory Project","place":["Gainesville, United States"]},{"name":"University of Florida","place":["Gainesville, United States"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2447","authenticated-orcid":true,"given":"Daniel R.","family":"Roe","sequence":"additional","affiliation":[{"name":"Laboratory of Computational Biology, National Heart, Lung, and Blood Institute","place":["Bethesda, United States"]},{"name":"National Institutes of Health","place":["Bethesda, United States"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2121-4449","authenticated-orcid":true,"given":"Ram\u00f3n Alain","family":"Miranda-Quintana","sequence":"additional","affiliation":[{"name":"Department of Chemistry","place":["Gainesville, United States"]},{"name":"University of Florida","place":["Gainesville, United States"]},{"name":"Quantum Theory Project","place":["Gainesville, United States"]},{"name":"University of Florida","place":["Gainesville, United States"]}]}],"member":"316","published-online":{"date-parts":[[2025,6,17]]},"reference":[{"key":"ref1\/cit1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.chemrev.0c01195"},{"key":"ref2\/cit2","doi-asserted-by":"publisher","DOI":"10.1021\/jacsau.1c00254"},{"key":"ref3\/cit3","doi-asserted-by":"publisher","DOI":"10.1021\/jacs.7b12191"},{"key":"ref4\/cit4","doi-asserted-by":"publisher","DOI":"10.1063\/1.3216567"},{"key":"ref5\/cit5","doi-asserted-by":"publisher","DOI":"10.1063\/1.5109531"},{"key":"ref6\/cit6","doi-asserted-by":"publisher","DOI":"10.1063\/1.3301140"},{"key":"ref7\/cit7","doi-asserted-by":"publisher","DOI":"10.3390\/a11020019"},{"key":"ref8\/cit8","unstructured":"Arthur, D.; Vassilvitskii, S. k-means++: the Advantages of Careful Seeding; Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms; ACM: USA, 2007; pp 1027\u20131035."},{"key":"ref9\/cit9","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jctc.4c00308"},{"key":"ref10\/cit10","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"Kaufman L.","year":"1990"},{"key":"ref11\/cit11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0134(19990215)34:33.0.CO;2-3"},{"key":"ref12\/cit12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3773(19990115)38:1\/2<236::AID-ANIE236>3.0.CO;2-M"},{"key":"ref13\/cit13","unstructured":"Ester, M.; Kriegel, H.P.; Sander, J.; Xu, X. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise; Proceedings of the Second International Conference on Knowledge Discovery and Data Mining; ACM, 1996; pp 226\u2013231."},{"key":"ref14\/cit14","doi-asserted-by":"crossref","unstructured":"Xie, Y.; Shekhar, S. Significant DBSCAN towards Statistically Robust Clustering; Proceedings of the 16th International Symposium on Spatial and Temporal Databases; ACM: Vienna Austria, 2019; pp 31\u201340.","DOI":"10.1145\/3340964.3340968"},{"key":"ref15\/cit15","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03524-3"},{"key":"ref16\/cit16","doi-asserted-by":"publisher","DOI":"10.1145\/2733381"},{"key":"ref17\/cit17","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"ref18\/cit18","doi-asserted-by":"crossref","unstructured":"Chen, L.; Smith, M.; Roe, D. R.; Miranda-Quintana, R. A. Extended Quality (eQual): Radial threshold clustering based on n-ary similarity, 2024. http:\/\/biorxiv.org\/lookup\/doi\/10.1101\/2024.12.05.627001.","DOI":"10.1101\/2024.12.05.627001"},{"key":"ref19\/cit19","doi-asserted-by":"publisher","DOI":"10.1021\/ja9090353"},{"key":"ref20\/cit20","doi-asserted-by":"publisher","DOI":"10.1063\/1.4965440"},{"key":"ref21\/cit21","doi-asserted-by":"publisher","DOI":"10.1039\/D4DD00041B"},{"key":"ref22\/cit22","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-021-00505-3"},{"key":"ref23\/cit23","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-021-00504-4"},{"key":"ref24\/cit24","doi-asserted-by":"publisher","DOI":"10.1039\/D5DD00030K"},{"key":"ref25\/cit25","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jctc.4c00362"},{"key":"ref26\/cit26","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.9b00558"},{"key":"ref27\/cit27","unstructured":"Gonz\u00e1lez-Alem\u00e1n, R. Graph-Based Approach to the Quality Threshold Clustering of Molecular Dynamics 2022 https:\/\/github.com\/LQCT\/BitQT. Accessed on 21 February, 2024."},{"key":"ref28\/cit28","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.2c01079"},{"key":"ref29\/cit29","unstructured":"Case, D. Amber 2020; University of California: San Francisco, 2020."},{"key":"ref30\/cit30","doi-asserted-by":"publisher","DOI":"10.1021\/ct400341p"}],"container-title":["Journal of Chemical Information and Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubs.acs.org\/doi\/pdf\/10.1021\/acs.jcim.5c00392","content-type":"application\/pdf","content-version":"vor","intended-application":"unspecified"},{"URL":"https:\/\/pubs.acs.org\/doi\/pdf\/10.1021\/acs.jcim.5c00392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,19]],"date-time":"2025-07-19T07:26:24Z","timestamp":1752909984000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubs.acs.org\/doi\/10.1021\/acs.jcim.5c00392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":30,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2025,7,14]]}},"alternative-id":["10.1021\/acs.jcim.5c00392"],"URL":"https:\/\/doi.org\/10.1021\/acs.jcim.5c00392","relation":{},"ISSN":["1549-9596","1549-960X"],"issn-type":[{"value":"1549-9596","type":"print"},{"value":"1549-960X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}