{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:25Z","timestamp":1725544045925},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_7","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"60-71","source":"Crossref","is-referenced-by-count":11,"title":["On-Line Linear-Time Construction of Word Suffix Trees"],"prefix":"10.1007","author":[{"given":"Shunsuke","family":"Inenaga","sequence":"first","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"7_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.: Efficient string matching: An aid to bibliographic search. Comm. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Comm. ACM"},{"issue":"3","key":"7_CR2","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":"7_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume":"F12","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees. Combinatorial Algorithms on Words\u00a0F12, 85\u201396 (1985)","journal-title":"Combinatorial Algorithms on Words"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BFb0035751","volume-title":"Automata, Languages and Programming","author":"R. Baeza-Yates","year":"1989","unstructured":"Baeza-Yates, R., Gonnet, G.H.: Efficient text searching of regular expressions. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 46\u201362. Springer, Heidelberg (1989)"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1142\/S0219720004000612","volume":"2","author":"H. Bannai","year":"2004","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M., Miyano, S.: Efficiently finding regulatory elements using correlation with gene expression. Journal of Bioinformatics and Computational Biology\u00a02(2), 273\u2013288 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-44888-8_6","volume-title":"Combinatorial Pattern Matching","author":"R. Clifford","year":"2003","unstructured":"Clifford, R., Sergot, M.: Distributed and paged suffix trees for large genetic databases. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 70\u201382. Springer, Heidelberg (2003)"},{"key":"7_CR7","first-page":"128","volume-title":"Proc. 8th International Conference on Intelligent Systems for Molecular Biology (ISMB 2000)","author":"B. Dorohonceanu","year":"2000","unstructured":"Dorohonceanu, B., Nevill-Manning, C.G.: Accelerating protein classification using suffix trees. In: Proc. 8th International Conference on Intelligent Systems for Molecular Biology (ISMB 2000), pp. 128\u2013133. AAAI Press, Menlo Park (2000)"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"7_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-30214-8_3","volume-title":"Discovery Science","author":"S. Inenaga","year":"2004","unstructured":"Inenaga, S., Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: Finding optimal pairs of cooperative and competing patterns with bounded distance. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 32\u201346. Springer, Heidelberg (2004)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-39984-1_11","volume-title":"String Processing and Information Retrieval","author":"S. Inenaga","year":"2003","unstructured":"Inenaga, S., Funamoto, T., Takeda, M., Shinohara, A.: Linear-time off-line text compression by longest-first substitution. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 137\u2013152. Springer, Heidelberg (2003)"},{"key":"7_CR11","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-30219-3_39","volume-title":"Algorithms in Bioinformatics","author":"S. Inenaga","year":"2004","unstructured":"Inenaga, S., Kivioja, T., M\u00e4kinen, V.: Finding missing patterns. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 463\u2013474. Springer, Heidelberg (2004)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4nen","year":"1996","unstructured":"K\u00e4rkk\u00e4nen, 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":"7_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/DCC.1996.488324","volume-title":"Proc. Data Compression Conference 1996 (DCC 1996)","author":"N.J. Larsson","year":"1996","unstructured":"Larsson, N.J.: Extended application of suffix trees to data compression. In: Proc. Data Compression Conference 1996 (DCC 1996), pp. 190\u2013199. IEEE Computer Society, Los Alamitos (1996)"},{"key":"7_CR14","first-page":"210","volume-title":"Proc. 4th Annual International Conference on Computational Molecular Biology (RECOMB 2000)","author":"L. Marsan","year":"2000","unstructured":"Marsan, L., Sagot, M.-F.: Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification. In: Proc. 4th Annual International Conference on Computational Molecular Biology (RECOMB 2000), pp. 210\u2013219. ACM, New York (2000)"},{"issue":"2","key":"7_CR15","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. Journal of ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of ACM"},{"issue":"1\u20133","key":"7_CR16","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(1\u20133), 87\u2013101 (2003)","journal-title":"Theoretical Computer Science"},{"key":"7_CR17","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, pp. 170\u2013186. Springer, Heidelberg (2002)"},{"issue":"3","key":"7_CR18","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"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern-matching algorithms. In: Proc. of 14th IEEE Ann. Symp. on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:23Z","timestamp":1619507783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11780441_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}