{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:35:45Z","timestamp":1772760945290,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1109\/icde.2013.6544887","type":"proceedings-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T19:02:52Z","timestamp":1372273372000},"page":"937-948","source":"Crossref","is-referenced-by-count":13,"title":["On shortest unique substring queries"],"prefix":"10.1109","author":[{"family":"Jian Pei","sequence":"first","affiliation":[]},{"given":"W. C-H","family":"Wu","sequence":"additional","affiliation":[]},{"family":"Mi-Yen Yeh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1126\/science.270.5235.397"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.60"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45728-3_14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/DASFAA.2003.1192375"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0038-2"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1186\/1471-2105-6-123","article-title":"Genome comparison without alignment using shortest unique substrings","volume":"6","author":"haubold","year":"2005","journal-title":"BMC Bioinformatics"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.4172\/jpb.1000127"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02441-2_6"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1242471.1242472"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646102"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/FI-2011-536","article-title":"Minimum unique substrings and maximum repeats","volume":"110","author":"ilie","year":"2011","journal-title":"Fundamenta Informaticae"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"}],"event":{"name":"2013 29th IEEE International Conference on Data Engineering (ICDE 2013)","location":"Brisbane, QLD","start":{"date-parts":[[2013,4,8]]},"end":{"date-parts":[[2013,4,12]]}},"container-title":["2013 IEEE 29th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6530811\/6544790\/06544887.pdf?arnumber=6544887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T05:16:36Z","timestamp":1595999796000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6544887\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icde.2013.6544887","relation":{},"subject":[],"published":{"date-parts":[[2013,4]]}}}