{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:40Z","timestamp":1725664960783},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625926"},{"type":"electronic","value":"9783540683230"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62592-5_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:26Z","timestamp":1330278206000},"page":"181-192","source":"Crossref","is-referenced-by-count":3,"title":["A note on updating suffix tree labels"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuela","family":"Montangero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"Aho, A. V., and Corasick, M. J. Efficient string matching: an aid to bibliographic search. Communication of the ACM 18 (1975), 333\u2013340.","journal-title":"Communication of the ACM"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., and Farach, M. Adaptive dictionary matching. In IEEE Symposium on Foundations of Computer Science (1991), pp. 760\u2013766.","DOI":"10.1109\/SFCS.1991.185445"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/inco.1995.1090","volume":"119","author":"A. Amir","year":"1995","unstructured":"Amir, A., Farach, M., Idury, R. M., Poutr\u00e9, H. L., and Sch\u00e4ffer, A. A. Improved dictionary matching. Information and Computation 119 (1995), 258\u2013282.","journal-title":"Information and Computation"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A., and Preparata, F. Optimal off-line detection of repetitions in a string. Theoretical Computer Science 22 (1983), 297\u2013315.","journal-title":"Theoretical Computer Science"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Baker, B. S. A theory of parameterized pattern matching: Algorithms and applications. In ACM Symposium on Theory of Computing (1993), pp. 71\u201380.","DOI":"10.1145\/167088.167115"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Breslauer, D. The suffix tree of a tree and minimizing sequential transducers. In Combinatorial Pattern Matching (1996).","DOI":"10.1007\/3-540-61258-0_10"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"W. I. Chang","year":"1994","unstructured":"Chang, W. I., and Lawler, E. L. Sublinear approximate string matching and biological applications. Algorithmica 12 (1994), 327\u2013344.","journal-title":"Algorithmica"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Cleary, J. G., Teehan, W. J., and Witten, I. H. Unbounded length contexts for PPM. In IEEE Data Compression Conference (1995), pp. 52\u201361.","DOI":"10.1109\/DCC.1995.515495"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Ferragina, P., and Grossi, R. Optimal on-line search and sublinear time update in string matching. In IEEE Symposium on Foundations of Computer Science, 604\u2013612, 1995. Also SIAM Journal on Computing (to appear).","DOI":"10.1109\/SFCS.1995.492590"},{"issue":"4","key":"17_CR10","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"E. R. Fiala","year":"1989","unstructured":"Fiala, E. R., and Green, D. H. Data compression with finite window. Communication of the ACM 32, 4 (1989), 490\u2013505.","journal-title":"Communication of the ACM"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Fox, A. E., Et al. (eds.) Special Issue on \u201cDigital Libraries\u201d Comm. ACM, 38:4 (1995).","DOI":"10.1145\/205323.205325"},{"key":"17_CR12","first-page":"41","volume":"34","author":"K. A. Frenkel","year":"1991","unstructured":"Frenkel, K. A. The human genome project and informatics. Communication of the ACM 34 (1991), 41\u201351.","journal-title":"Communication of the ACM"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/S0097539792231982","volume":"24","author":"R. Giancarlo","year":"1995","unstructured":"Giancarlo, R. A generalization of the suffix tree to square matrices, with applications. SIAM Journal on Computing 24 (1995), 520\u2013562.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR14","unstructured":"Gu, M., Farach, M., and Beigel, R. An efficient algorithm for dynamic text indexing. In ACM-SIAM Symposium on Discrete Algorithms (1994), pp. 697\u2013704."},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","volume":"41","author":"D. Gusfield","year":"1992","unstructured":"Gusfield, D., Landau, G. M., and Schieber, B. An efficient algorithm for all pairs suffix-prefix problem. Information Processing Letters 41 (1992), 181\u2013185.","journal-title":"Information Processing Letters"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R. Efficient tree pattern matching. In IEEE Foundations of Computer Science (1989), 178\u2013183.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. M. Landau","year":"1989","unstructured":"Landau, G. M., and Vishkin, U. Fast parallel and serial approximate string matching. Journal of Algorithms 10 (1989), 157\u2013169.","journal-title":"Journal of Algorithms"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Larsson, N. J. Extended application of suffix trees to data compression. In IEEE Data Compression Conference (1996).","DOI":"10.1109\/DCC.1996.488324"},{"issue":"2","key":"17_CR19","doi-asserted-by":"crossref","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 the ACM 23, 2 (1976), 262\u2013272.","journal-title":"Journal of the ACM"},{"key":"17_CR20","unstructured":"Overmars, M. H. The design of Dynamic Data Structures. Springer-Verlag Lecture Notes in Computer Science #156, 1983."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Sahinalp S. C. and Vishkin U. Efficient approximate and dynamic matching of patterns using a labeling paradigm. In Proc. of IEEE Symposium on Foundations of Computer Science, 1996.","DOI":"10.1109\/SFCS.1996.548491"},{"issue":"4","key":"17_CR22","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"J. Storer","year":"1982","unstructured":"Storer, J., and Szymanski, T. Data compression via textual substitution. Journal of the ACM 29, 4 (1982), 928\u2013951.","journal-title":"Journal of the ACM"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Weiner, P. Linear pattern matching algorithm. In IEEE Symp. on Switching and Automata Theory (1973), pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"issue":"3","key":"17_CR24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., and Lempel, A. A universal algorithm for sequential data compression. IEEE Trans. Info. Theory 23, 3 (1977), 337\u2013343.","journal-title":"IEEE Trans. Info. Theory"},{"issue":"5","key":"17_CR25","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., and Lempel, A. Compression of individual sequences via variable-rate coding. IEEE Trans. Info. Theory 24, 5 (1978), 530\u2013536.","journal-title":"IEEE Trans. Info. Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62592-5_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:13:33Z","timestamp":1605629613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62592-5_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625926","9783540683230"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-62592-5_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}