{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:35:21Z","timestamp":1760016921015,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319949673"},{"type":"electronic","value":"9783319949680"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94968-0_18","type":"book-chapter","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T18:13:51Z","timestamp":1531419231000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On k-Mismatch Shortest Unique Substring Queries Using GPU"],"prefix":"10.1007","author":[{"given":"Daniel W.","family":"Schultz","sequence":"first","affiliation":[]},{"given":"Bojian","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,13]]},"reference":[{"key":"18_CR1","unstructured":"A lightweight suffix-sorting library. https:\/\/code.google.com\/p\/libdivsufsort"},{"key":"18_CR2","unstructured":"Compressed indexes and their testbeds. http:\/\/pizzachili.dcc.uchile.cl\/texts.html"},{"key":"18_CR3","unstructured":"Cuda data parallel primitives library. http:\/\/cudpp.github.io\/"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1186\/1471-2105-6-123","volume":"6","author":"B Haubold","year":"2005","unstructured":"Haubold, B., Pierstorff, N., M\u00f6ller, F., Wiehe, T.: Genome comparison without alignment using shortest unique substrings. BMC Bioinf. 6(1), 123 (2005)","journal-title":"BMC Bioinf."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2017.05.032","volume":"690","author":"WK Hon","year":"2017","unstructured":"Hon, W.K., Thankachan, S.V., Xu, B.: In-place algorithms for exact and approximate shortest unique substring problems. Theor. Comput. Sci. 690, 12\u201325 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-11918-2_16","volume-title":"String Processing and Information Retrieval","author":"X Hu","year":"2014","unstructured":"Hu, X., Pei, J., Tao, Y.: Shortest Unique queries on strings. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 161\u2013172. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11918-2_16"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.tcs.2014.11.004","volume":"562","author":"AM \u0130leri","year":"2015","unstructured":"\u0130leri, A.M., K\u00fclekci, M.O., Xu, B.: A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. Theor. Comput. Sci. 562, 621\u2013633 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Proceedings of the Symposium on Combinatorial Pattern Matching, pp. 181\u2013192 (2001)","DOI":"10.1007\/3-540-48194-X_17"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Pei, J., Wu, W.C.H., Yeh, M.Y.: On shortest unique substring queries. In: Proceedings of IEEE International Conference on Data Engineering (ICDE), pp. 937\u2013948 (2013)","DOI":"10.1109\/ICDE.2013.6544887"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-319-18120-2_19","volume-title":"Database Systems for Advanced Applications","author":"Y Tian","year":"2015","unstructured":"Tian, Y., Xu, B.: On longest repeat queries using GPU. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 316\u2013333. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18120-2_19"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-319-04298-5_44","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"K Tsuruta","year":"2014","unstructured":"Tsuruta, K., Inenaga, S., Bannai, H., Takeda, M.: Shortest unique substrings queries in optimal time. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 503\u2013513. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04298-5_44"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-662-48096-0_44","volume-title":"Euro-Par 2015: Parallel Processing","author":"L Wang","year":"2015","unstructured":"Wang, L., Baxter, S., Owens, J.D.: Fast parallel suffix array on the GPU. In: Tr\u00e4ff, J.L., Hunold, S., Versaci, F. (eds.) Euro-Par 2015. LNCS, vol. 9233, pp. 573\u2013587. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48096-0_44"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94968-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T19:16:13Z","timestamp":1751742973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94968-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319949673","9783319949680"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94968-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alan.cs.gsu.edu\/isbra18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}