{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:45:09Z","timestamp":1758638709914},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":3426,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s1570-8667(03)00064-9","type":"journal-article","created":{"date-parts":[[2003,12,31]],"date-time":"2003-12-31T07:13:11Z","timestamp":1072854791000},"page":"33-51","source":"Crossref","is-referenced-by-count":7,"title":["Compact directed acyclic word graphs for a sliding window"],"prefix":"10.1016","volume":"2","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":"78","reference":[{"key":"10.1016\/S1570-8667(03)00064-9_BIB001","series-title":"Combinatorial Algorithm on Words","first-page":"85","article-title":"The myriad virtues of subword trees","volume":"vol. 12","author":"Apostolico","year":"1985"},{"issue":"3","key":"10.1016\/S1570-8667(03)00064-9_BIB002","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","article-title":"Complete inverted files for efficient text retrieval and analysis","volume":"34","author":"Blumer","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB003","series-title":"Proc. Data Compression Conference '95 (DCC'95)","first-page":"52","article-title":"Unbounded length contexts for PPM","author":"Cleary","year":"1995"},{"issue":"4","key":"10.1016\/S1570-8667(03)00064-9_BIB004","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","article-title":"Data compression using adaptive coding and partial string matching","volume":"32","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S1570-8667(03)00064-9_BIB005","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB006","series-title":"Structures in Logic and Computer Science","first-page":"192","article-title":"On compact directed acyclic word graphs","volume":"vol. 1261","author":"Crochemore","year":"1997"},{"issue":"4","key":"10.1016\/S1570-8667(03)00064-9_BIB007","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/63334.63341","article-title":"Data compression with finite windows","volume":"32","author":"Fiala","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB008","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"issue":"1","key":"10.1016\/S1570-8667(03)00064-9_BIB009","first-page":"52","article-title":"Bidirectional construction of suffix trees","volume":"10","author":"Inenaga","year":"2003","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S1570-8667(03)00064-9_BIB010","series-title":"Proc. The Prague Stringology Conference '01 (PSC'01)","article-title":"Construction of the CDAWG for a trie","author":"Inenaga","year":"2001"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB011","series-title":"Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE'01)","first-page":"96","article-title":"On-line construction of symmetric compact directed acyclic word graphs","author":"Inenaga","year":"2001"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB012","series-title":"Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM'01)","first-page":"169","article-title":"On-line construction of compact directed acyclic word graphs","volume":"vol. 2089","author":"Inenaga","year":"2001"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB013","series-title":"Proc. 9th International Symposium on String Processing and Information Retrieval (SPIRE'02)","first-page":"310","article-title":"Compact directed acyclic word graphs for a sliding window","volume":"vol. 2476","author":"Inenaga","year":"2002"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB014","series-title":"Proc. 27th International Symposium on Mathematical Foundations of Computer Science (MFCS'02)","first-page":"341","article-title":"Space-economical construction of index structures for all suffixes of a string","volume":"vol. 2420","author":"Inenaga","year":"2002"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB015","series-title":"Proc. Data Compression Conference '96 (DCC'96)","first-page":"190","article-title":"Extended application of suffix trees to data compression","author":"Jesper Larsson","year":"1996"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB016","unstructured":"N. Jesper Larsson, Structures of string matching and data compression, PhD Thesis, Lund University, 1999"},{"issue":"2","key":"10.1016\/S1570-8667(03)00064-9_BIB017","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"issue":"11","key":"10.1016\/S1570-8667(03)00064-9_BIB018","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1109\/26.61469","article-title":"Implementing the PPM data compression scheme","volume":"38","author":"Moffat","year":"1990","journal-title":"IEEE Trans. Comm."},{"issue":"3","key":"10.1016\/S1570-8667(03)00064-9_BIB019","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S1570-8667(03)00064-9_BIB020","series-title":"Proc. 14th Annual Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T15:25:31Z","timestamp":1550244331000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S1570866703000649"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00064-9","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}