{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T12:40:01Z","timestamp":1748608801836,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238258"},{"type":"electronic","value":"9783319238265"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23826-5_22","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Space-Efficient Detection of Unusual Words"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Belazzougui","sequence":"first","affiliation":[]},{"given":"Fabio","family":"Cunial","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Bock, M.E., Lonardi, S.: Monotony of surprise and large-scale quest for unusual words. Journal of Computational Biology 10(3\u20134), 283\u2013311 (2003)","DOI":"10.1089\/10665270360688020"},{"issue":"1\u20132","key":"22_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1089\/10665270050081397","volume":"7","author":"A Apostolico","year":"2000","unstructured":"Apostolico, A., Bock, M.E., Lonardi, S., Xu, X.: Efficient detection of unusual words. Journal of Computational Biology 7(1\u20132), 71\u201394 (2000)","journal-title":"Journal of Computational Biology"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Bock, M.E., Xu, X.: Annotated statistical indices for sequence analysis. In: Proceedgins of Compression and Complexity of Sequences 1997, pp. 215\u2013229. IEEE (1998)","DOI":"10.1109\/SEQUEN.1997.666917"},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/BF02944783","volume":"19","author":"A Apostolico","year":"2004","unstructured":"Apostolico, A., Gong, F.-C., Lonardi, S.: Verbumculus and the discovery of unusual words. Journal of Computer Science and Technology 19(1), 22\u201341 (2004)","journal-title":"Journal of Computer Science and Technology"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Belazzougui, D.: Linear time construction of compressed text indices in compact space. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 148\u2013193. ACM, New York (2014)","DOI":"10.1145\/2591796.2591885"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-19929-0_2","volume-title":"Combinatorial Pattern Matching","author":"D Belazzougui","year":"2015","unstructured":"Belazzougui, D., Cunial, F.: A framework for space-efficient string kernels. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 13\u201325. Springer, Heidelberg (2015)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jda.2012.07.005","volume":"18","author":"D Belazzougui","year":"2013","unstructured":"Belazzougui, D., Navarro, G., Valenzuela, D.: Improved compressed indexes for full-text document retrieval. Journal of Discrete Algorithms 18, 3\u201313 (2013)","journal-title":"Journal of Discrete Algorithms"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2012.04.031","volume":"450","author":"S Chairungsee","year":"2012","unstructured":"Chairungsee, S., Crochemore, M.: Using minimal absent words to build phylogeny. Theoretical Computer Science 450, 109\u2013116 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Information Processing Letters 67(3), 111\u2013117 (1998)","journal-title":"Information Processing Letters"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific (2002)","DOI":"10.1142\/4838"},{"key":"22_CR11","unstructured":"Gog, S.: Compressed suffix trees: design, construction, and applications. PhD thesis, University of Ulm, Germany (2011)"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1186\/1471-2105-9-167","volume":"9","author":"J Herold","year":"2008","unstructured":"Herold, J., Kurtz, S., Giegerich, R.: Efficient computation of absent words in genomic sequences. BMC Bioinformatics 9(1), 167 (2008)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"22_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"CAR Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. The Computer Journal 5(1), 10\u201316 (1962)","journal-title":"The Computer Journal"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Ileri, A.M., K\u00fclekci, M.O., Xu, B.: A simple yet time-optimal and linear-space algorithm for shortest unique substring queries. Theoretical Computer Science 562, 621\u2013633 (2015)","DOI":"10.1016\/j.tcs.2014.11.004"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Keogh, E., Lonardi, S., Chiu, B.Y.-C.: Finding surprising patterns in a time series database in linear time and space. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 550\u2013556. ACM, New York (2002)","DOI":"10.1145\/775047.775128"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10618-007-0064-z","volume":"15","author":"J Lin","year":"2007","unstructured":"Lin, J., Keogh, E., Wei, L., Lonardi, S.: Experiencing SAX: a novel symbolic representation of time series. Data Mining and Knowledge Discovery 15(2), 107\u2013144 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"22_CR17","unstructured":"Morris, J.H., Pratt, V.R.: A linear pattern-matching algorithm. Technical Report 40, University of California, Berkeley (1970)"},{"key":"22_CR18","unstructured":"Simon, I.: String matching algorithms and automata. In: First South American Workshop on String Processing, Belo Horizonte, Brazil, pp. 151\u2013157 (1993)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23826-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T12:13:18Z","timestamp":1748607198000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}