{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:19Z","timestamp":1761611359864,"version":"3.40.4"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119175"},{"type":"electronic","value":"9783319119182"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11918-2_16","type":"book-chapter","created":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T09:09:45Z","timestamp":1412932185000},"page":"161-172","source":"Crossref","is-referenced-by-count":13,"title":["Shortest Unique Queries on Strings"],"prefix":"10.1007","author":[{"given":"Xiaocheng","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"16_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. CACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"CACM"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-02927-1_29","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Landau, G.M., Weimann, O.: On cartesian trees and range minimum queries. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 341\u2013353. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Dementiev, R., K\u00e4rkk\u00e4inen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. ACM Journal of Experimental Algorithmics,\u00a012 (2008)","key":"16_CR3","DOI":"10.1145\/1227161.1402296"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11780441_5","volume-title":"Combinatorial Pattern Matching","author":"J. Fischer","year":"2006","unstructured":"Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 36\u201348. Springer, Heidelberg (2006)"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. of Comp.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. of Comp."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-07566-2_18","volume-title":"Combinatorial Pattern Matching","author":"A.M. \u0130leri","year":"2014","unstructured":"\u0130leri, A.M., K\u00fclekci, M.O., Xu, B.: Shortest unique substring query revisited. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol.\u00a08486, pp. 172\u2013181. Springer, Heidelberg (2014)"},{"issue":"1-4","key":"16_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/FI-2011-536","volume":"110","author":"L. Ilie","year":"2011","unstructured":"Ilie, L., Smyth, W.F.: Minimum unique substrings and maximum repeats. Fundam. Inform.\u00a0110(1-4), 183\u2013195 (2011)","journal-title":"Fundam. Inform."},{"issue":"5","key":"16_CR8","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. of Comp.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. of Comp."},{"doi-asserted-by":"crossref","unstructured":"Pei, J., Wu, W.C.-H., Yeh, M.-Y.: On shortest unique substring queries. In: ICDE, pp. 937\u2013948 (2013)","key":"16_CR9","DOI":"10.1109\/ICDE.2013.6544887"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a08327, pp. 503\u2013513. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11918-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T03:02:53Z","timestamp":1746414173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11918-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319119175","9783319119182"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11918-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}