{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:23:44Z","timestamp":1740140624589,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1703489"],"award-info":[{"award-number":["CCF-1703489"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1109\/tcbb.2020.2968531","type":"journal-article","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T21:14:06Z","timestamp":1579641246000},"page":"138-148","source":"Crossref","is-referenced-by-count":2,"title":["An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2331-928X","authenticated-orcid":false,"given":"Daniel R.","family":"Allen","sequence":"first","affiliation":[{"name":"Zillow Group, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Central Florida, Orlando, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5642-6826","authenticated-orcid":false,"given":"Bojian","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Eastern Washington University, Cheney, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2015.0217"},{"key":"ref11","first-page":"193","article-title":"On k-mismatch shortest unique substring queries using GPU","author":"schultz","year":"2018","journal-title":"Proc Int Symp Bioinf Res Appl"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355547"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/11780441_5","article-title":"Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE","author":"fischer","year":"2006","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0221005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1198-x"},{"article-title":"libdivsufsort: A lightweight suffix-sorting library","year":"0","author":"mori","key":"ref17"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","article-title":"From theory to practice: Plug and play with succinct data structures","author":"gog","year":"2014","journal-title":"Proc Int Symp Experimental Algorithms"},{"key":"ref19","first-page":"1","article-title":"Efficient alignment free sequence comparison with bounded mismatches","author":"aluru","year":"2015","journal-title":"Proc Int Conf Res Comput Mol Biol"},{"key":"ref4","first-page":"503","article-title":"Shortest unique substrings queries in optimal time","author":"tsuruta","year":"2014","journal-title":"Proc Int Conf Current Trends Theory Pract Comput Sci"},{"key":"ref3","first-page":"937","article-title":"On shortest unique substring queries","author":"pei","year":"2013","journal-title":"Proc IEEE Int Conf Data Eng"},{"key":"ref6","first-page":"161","article-title":"Shortest unique queries on strings","author":"hu","year":"2014","journal-title":"Proc Int Symp String Process Inf Retrieval"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.004"},{"key":"ref8","first-page":"24:1","article-title":"Tight bounds on the maximum number of shortest unique substrings","author":"mieno","year":"2017","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref7","first-page":"1","article-title":"Shortest unique substring queries on run-length encoded strings","author":"mieno","year":"2016","journal-title":"Proc Int Symp Math Found Comput Sci"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-6-123"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.032"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2015.0235"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3233547.3233564"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89929-9_14"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8857\/9346082\/8964484-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/9346082\/08964484.pdf?arnumber=8964484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T20:24:48Z","timestamp":1722457488000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8964484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":22,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2020.2968531","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"type":"print","value":"1545-5963"},{"type":"electronic","value":"1557-9964"},{"type":"electronic","value":"2374-0043"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}