{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:57Z","timestamp":1750221297805,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,15]],"date-time":"2018-08-15T00:00:00Z","timestamp":1534291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. National Science Foundation","award":["CCF-1703489"],"award-info":[{"award-number":["CCF-1703489"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,15]]},"DOI":"10.1145\/3233547.3233564","type":"proceedings-article","created":{"date-parts":[[2018,8,24]],"date-time":"2018-08-24T12:05:17Z","timestamp":1535112317000},"page":"428-437","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem"],"prefix":"10.1145","author":[{"given":"Daniel R.","family":"Allen","sequence":"first","affiliation":[{"name":"Eastern Washington University, Cheney, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojian","family":"Xu","sequence":"additional","affiliation":[{"name":"Eastern Washington University, Cheney, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,8,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221005"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355547"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_5"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Gusfield D.: Algorithms on Strings Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)   Gusfield D.: Algorithms on Strings Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-6-123"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3143045.3143198"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11918-2_16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.004"},{"key":"e_1_3_2_1_10_1","unstructured":"Mori Y.: libdivsufsort: A lightweight suffix-sorting library. https:\/\/github.com\/y-256\/libdivsufsort  Mori Y.: libdivsufsort: A lightweight suffix-sorting library. https:\/\/github.com\/y-256\/libdivsufsort"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544887"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2015.0235"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2015.0217"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04298-5_44"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"}],"event":{"name":"BCB '18: 9th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"location":"Washington DC USA","acronym":"BCB '18"},"container-title":["Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3233547.3233564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3233547.3233564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:13Z","timestamp":1750212793000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3233547.3233564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,15]]},"references-count":15,"alternative-id":["10.1145\/3233547.3233564","10.1145\/3233547"],"URL":"https:\/\/doi.org\/10.1145\/3233547.3233564","relation":{},"subject":[],"published":{"date-parts":[[2018,8,15]]},"assertion":[{"value":"2018-08-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}