{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:53Z","timestamp":1725483713045},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441588"},{"type":"electronic","value":"9783540457350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45735-6_27","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:12:38Z","timestamp":1178212358000},"page":"310-324","source":"Crossref","is-referenced-by-count":4,"title":["Compact Directed Acyclic Word Graphs for a Sliding Window"],"prefix":"10.1007","author":[{"given":"Shunsuke","family":"Inenaga","sequence":"first","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithm on Words, volume 12 of NATO Advanced Science Institutes, Series F, pages 85\u201396. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_6"},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. J. ACM, 34(3):578\u2013595, 1987.","journal-title":"J. ACM"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"J. G. Cleary, W. J. Teahan, and I. H. Witten. Unbounded length contexts for PPM. In Proc. Data Compression Conference\u2019 95 (DCC\u201995), pages 52\u201361. IEEE Computer Society, 1995.","DOI":"10.1109\/DCC.1995.515495"},{"issue":"4","key":"27_CR4","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"J. G. Cleary","year":"1984","unstructured":"J. G. Cleary and I. H. Witten. Data compression using adaptive coding and partial string matching. IEEE Trans. Commun., 32(4):396\u2013402, 1984.","journal-title":"IEEE Trans. Commun."},{"key":"27_CR5","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994."},{"key":"27_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-63246-8_12","volume-title":"Structures in Logic and Computer Science","author":"M. Crochemore","year":"1997","unstructured":"M. Crochemore and R. V\u00e9rin. On compact directed acyclic word graphs. In J. Mycielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, volume 1261 of Lecture Notes in Computer Science, pages 192\u2013211. Springer-Verlag, 1997."},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"E. R. Fiala","year":"1989","unstructured":"E. R. Fiala and D. H. Greene. Data compression with finite windows. Commun. ACM, 32(4):490\u2013505, 1989.","journal-title":"Commun. ACM"},{"key":"27_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, 1997."},{"key":"27_CR9","unstructured":"S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. Construction of the CDAWG for a trie. In Proc. The Prague Stringology Conference\u2019 01 (PSC\u201901). Czech Technical University, 2001."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. On-line construction of symmetric compact directed acyclic word graphs. In Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE\u201901), pages 96\u2013110. IEEE Computer Society, 2001.","DOI":"10.1109\/SPIRE.2001.989743"},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-48194-X_16","volume-title":"Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM\u201901)","author":"S. Inenaga","year":"2001","unstructured":"S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi. On-line construction of compact directed acyclic word graphs. In A. Amir and G. M. Landau, editors, Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM\u201901), volume 2089 of Lecture Notes in Computer Science, pages 169\u2013180. Springer-Verlag, 2001."},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 27th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201902)","author":"S. Inenaga","year":"2002","unstructured":"S. Inenaga, A. Shinohara, M. Takeda, H. Bannai, and S. Arikawa. Space-economical construction of index structures for all suffixes of a string. In Proc. 27th International Symposium on Mathematical Foundations of Computer Science (MFCS\u201902), Lecture Notes in Computer Science. Springer-Verlag, 2002. (to appear)."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"N. J. Larsson. Extended application of suffix trees to data compression. In Proc. Data Compression Conference\u2019 96 (DCC\u201996), pages 190\u2013199. IEEE Computer Society, 1996.","DOI":"10.1109\/DCC.1996.488324"},{"key":"27_CR14","unstructured":"N. J. Larsson. Structures of String Matching and Data Compression. PhD thesis, Lund University, 1999."},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262\u2013272, 1976.","journal-title":"J. ACM"},{"issue":"11","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/26.61469","volume":"38","author":"A. Moffat","year":"1990","unstructured":"A. Moffat. Implementing the PPM data compression scheme. IEEE Trans. Commun., 38(11):1917\u20131921, 1990.","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"27_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249\u2013260, 1995.","journal-title":"Algorithmica"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithms. In Proc. 14th Annual Symposium on Switching and Automata Theory, pages 1\u201311, 1973","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45735-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T11:51:44Z","timestamp":1550317904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45735-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441588","9783540457350"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45735-6_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}