{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:28:04Z","timestamp":1725593284423},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21458-5_22","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T17:11:27Z","timestamp":1309194687000},"page":"246-260","source":"Crossref","is-referenced-by-count":5,"title":["Sparse and Truncated Suffix Trees on Variable-Length Codes"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Uemura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J.\u00a0of Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"J.\u00a0of Discrete Algorithms"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11780441_18","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2006","unstructured":"Amir, A., Chencinski, E., Iliopoulos, C.S., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 188\u2013199. Springer, Heidelberg (2006)"},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/PL00009260","volume":"23","author":"A. Andersson","year":"1999","unstructured":"Andersson, A., Larsson, N.J., Swanson, K.: Suffix trees on words. Algorithmica\u00a023(3), 246\u2013260 (1999)","journal-title":"Algorithmica"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology: Text Algorithms (2002)","DOI":"10.1142\/4838"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-540-73437-6_33","volume-title":"Combinatorial Pattern Matching","author":"P. Ferragina","year":"2007","unstructured":"Ferragina, P., Fischer, J.: Suffix arrays on words. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 328\u2013339. Springer, Heidelberg (2007)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences, \u2013 Computer Science and Computational Biology, Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"22_CR7","unstructured":"IETF, UTF-8, a transformation format of ISO 10646, RFC 3629 (2003), http:\/\/tools.ietf.org\/html\/rfc3629"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11780441_7","volume-title":"Combinatorial Pattern Matching","author":"S. Inenaga","year":"2006","unstructured":"Inenaga, S., Takeda, M.: On-line linear-time construction of word suffix trees. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 60\u201371. Springer, Heidelberg (2006)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11880561_6","volume-title":"String Processing and Information Retrieval","author":"S. Inenaga","year":"2006","unstructured":"Inenaga, S., Takeda, M.: Sparse directed acyclic word graphs. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol.\u00a04209, pp. 61\u201373. Springer, Heidelberg (2006)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Inenaga, S., Takeda, M.: Sparse compact directed acyclic word graphs. In: Holub, J., Zdarek, J. (eds.) Proc. PSC 2006, pp. 197\u2013211 (2006)","DOI":"10.1007\/11880561_6"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4inen","year":"1996","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Sparse suffix trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 219\u2013230. Springer, Heidelberg (1996)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G.H., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM\u00a023, 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(03)00053-7","volume":"304","author":"J.C. Na","year":"2003","unstructured":"Na, J.C., Apostolico, A., Iliopoulos, C.S., Park, K.: Truncated suffix trees and their application to data compression. Theoretical Computer Science\u00a0304, 87\u2013101 (2003)","journal-title":"Theoretical Computer Science"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45735-6_16","volume-title":"String Processing and Information Retrieval","author":"M. Takeda","year":"2002","unstructured":"Takeda, M., Miyamoto, S., Kida, T., Shinohara, A., Fukamachi, S., Shinohara, T., Arikawa, S.: Processing text files as is: Pattern matching over compressed texts, multi-byte character texts, and semi-structured texts. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, p. 170. Springer, Heidelberg (2002)"},{"issue":"3","key":"22_CR16","first-page":"595","volume":"J91-D","author":"T. Uemura","year":"2008","unstructured":"Uemura, T., Arimura, H.: A linear-time off-line construction of property suffix trees. IEICE Trans. Inf.\u00a0& Syst.\u00a0J91-D(3), 595\u2013607 (2008) (in Japanese). An English version appears in Chapter\u00a04, T.\u00a0Uemura, Efficient Construction of Constrained Suffix Trees, Ph.D thesis, IST, Hokkaido Univ. (February 2011) (submitting)","journal-title":"IEICE Trans. Inf.\u00a0& Syst."},{"issue":"3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix-trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T08:04:51Z","timestamp":1560326691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}