{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:33:40Z","timestamp":1783150420717,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540890966","type":"print"},{"value":"9783540890973","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89097-3_12","type":"book-chapter","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T11:16:29Z","timestamp":1226315789000},"page":"109-120","source":"Crossref","is-referenced-by-count":4,"title":["Sliding CDAWG Perfection"],"prefix":"10.1007","author":[{"given":"Martin","family":"Senft","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom\u00e1\u0161","family":"Dvo\u0159\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., McConnell, R.M., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. Journal of the ACM\u00a034(3), 578\u2013595 (1987)","journal-title":"Journal of the ACM"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S1570-8667(03)00064-9","volume":"2","author":"S. Inenaga","year":"2004","unstructured":"Inenaga, S., Shinohara, A., Takeda, M., Arikawa, S.: Compact directed acyclic word graphs for a sliding window. Journal of Discrete Algorithms\u00a02(1), 33\u201351 (2004)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.dam.2004.04.012","volume":"146","author":"S. Inenaga","year":"2005","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics\u00a0146(2), 156\u2013179 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR4","unstructured":"Larsson, N.J.: Structures of String Matching and Data Compression. Ph.D thesis, Department of Computer Science, Lund University, Sweden (1999)"},{"key":"12_CR5","first-page":"183","volume-title":"DCC","author":"M. Senft","year":"2006","unstructured":"Senft, M.: Compressed by the suffix tree. In: Storer, J.A., Cohn, M. (eds.) DCC, pp. 183\u2013192. IEEE Computer Society, Los Alamitos (2006)"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"E.R. Fiala","year":"1989","unstructured":"Fiala, E.R., Greene, D.H.: Data compression with finite windows. Communications of the ACM\u00a032(4), 490\u2013505 (1989)","journal-title":"Communications of the ACM"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0196-6774(87)90045-9","volume":"8","author":"J. Blumer","year":"1987","unstructured":"Blumer, J.: How much is that DAWG in the window? Journal of Algorithms\u00a08, 451\u2013469 (1987)","journal-title":"Journal of Algorithms"},{"key":"12_CR8","volume-title":"Computing Patterns in Strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing Patterns in Strings. Addison-Wesley, Reading (2003)"},{"key":"12_CR9","first-page":"41","volume-title":"WDS 2005","author":"M. Senft","year":"2005","unstructured":"Senft, M.: Suffix tree for a sliding window: An overview. In: \u0160afr\u00e1nkov\u00e1, J. (ed.) WDS 2005, pp. 41\u201346. Matfyzpress, Praha (2005)"}],"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-540-89097-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T01:19:15Z","timestamp":1551662355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89097-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540890966","9783540890973"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89097-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}