{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:44Z","timestamp":1750220924887,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,17]]},"DOI":"10.1145\/3321408.3322844","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Measuring similarity between sequential datasets"],"prefix":"10.1145","author":[{"given":"Xiaohui","family":"Zhang","sequence":"first","affiliation":[{"name":"Sichuan University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Zuo","sequence":"additional","affiliation":[{"name":"Sichuan University, Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"volume-title":"Topham","year":"2018","author":"Anderson Christopher S.","key":"e_1_3_2_1_1_1"},{"unstructured":"Pierre Fran?ois Marteau. 2018. Sequence Covering Similarity for Symbolic Sequence Comparison. (2018).  Pierre Fran?ois Marteau. 2018. Sequence Covering Similarity for Symbolic Sequence Comparison. (2018).","key":"e_1_3_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.4249\/scholarpedia.1883"},{"volume-title":"Protecting Genomic Privacy by a Sequence-Similarity Based Obfuscation Method. CoRR abs\/1708.02629","year":"2017","author":"Wan Shibiao","key":"e_1_3_2_1_4_1"},{"volume-title":"Database Systems for Advanced Applications","author":"Wang Xianming","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","first-page":"2994","article-title":"Mining top-k distinguishing sequential paRerns with gap constraint","volume":"26","author":"Hu B","year":"2015","journal-title":"Jouraal ofSoftware"},{"key":"e_1_3_2_1_7_1","first-page":"427","article-title":"Biological sequence classification algorithm based on density-aware patterns","volume":"38","author":"Yaowei HU","year":"2018","journal-title":"Journal of Computer Applications"},{"volume-title":"SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning 42, 1 (01","year":"2001","author":"Zaki Mohammed J.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1267066.1267068"}],"event":{"acronym":"ACM TURC 2019","name":"ACM TURC 2019: ACM Turing Celebration Conference - China","location":"Chengdu China"},"container-title":["Proceedings of the ACM Turing Celebration Conference - China"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321408.3322844","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3321408.3322844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:12Z","timestamp":1750204392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3321408.3322844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,17]]},"references-count":9,"alternative-id":["10.1145\/3321408.3322844","10.1145\/3321408"],"URL":"https:\/\/doi.org\/10.1145\/3321408.3322844","relation":{},"subject":[],"published":{"date-parts":[[2019,5,17]]},"assertion":[{"value":"2019-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}