{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T17:52:20Z","timestamp":1676915540408},"reference-count":46,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5495,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1016\/s0304-3975(97)00243-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"249-262","source":"Crossref","is-referenced-by-count":6,"title":["On updating suffix tree labels"],"prefix":"10.1016","volume":"201","author":[{"given":"Paolo","family":"Ferragina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberta","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuela","family":"Montangero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00243-0_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB2","series-title":"IEEE Symp. on Foundations of Computer Science","first-page":"760","article-title":"Adaptive dictionary matching","author":"Amir","year":"1991"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB3","series-title":"ACM-SIAM Symp. on Discrete Algorithms","first-page":"212","article-title":"Efficient 2-dimensional approximate matching of non rectangular figures","author":"Amir","year":"1991"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB4","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","article-title":"Dynamic dictionary matching","volume":"49","author":"Amir","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB5","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/inco.1995.1090","article-title":"Improved dictionary matching","volume":"119","author":"Amir","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","article-title":"Structural properties of the string statistics problem","volume":"31","author":"Apostolico","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB8","series-title":"ACM Symp. on Theory of Computing","first-page":"71","article-title":"A theory of parameterized pattern matching: algorithms and applications","author":"Baker","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(97)00243-0_BIB9","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/5684.5688","article-title":"A locally adaptive data compression scheme","volume":"29","author":"Bentley","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB10","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1006\/jagm.1995.1011","article-title":"Dictionary matching on unbounded alphabets: uniform length dictionaries","volume":"18","author":"Breslauer","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB11","series-title":"Combinatorial Pattern Matching","first-page":"116","article-title":"The suffix tree of a tree and minimizing sequential transducers","author":"Breslauer","year":"1996"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01185431","article-title":"Sublinear approximate string matching and biological applications","volume":"12","author":"Chang","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB13","series-title":"IEEE Data Compression Conf.","first-page":"52","article-title":"Unbounded length contexts for PPM","author":"Cleary","year":"1995"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB14","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. Commun."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/nar\/14.1.141","article-title":"Sequences landscapes","volume":"4","author":"Clift","year":"1986","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB16_1","series-title":"European Symp. on Algorithms","first-page":"495","article-title":"Incremental text editing: a new data structure","volume":"vol. 855","author":"Ferragina","year":"1994"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB16_2","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1006\/jagm.1996.0814","article-title":"Dynamic text indexing under string updates","volume":"22","author":"Ferragina","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB17","series-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms","first-page":"531","article-title":"Fast incremental text editing","author":"Ferragina","year":"1995"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB18","unstructured":"Also, Improved dynamic text editing, J. Algorithms, to appear."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB19","series-title":"IEEE Symp. on Foundations of Computer Science","first-page":"604","article-title":"Optimal on-line search and sublinear time update in string matching","author":"Ferragina","year":"1995"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB20","unstructured":"Also, SIAM J. Comput., to appear."},{"issue":"4","key":"10.1016\/S0304-3975(97)00243-0_BIB21","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/63334.63341","article-title":"Data compression with finite window","volume":"32","author":"Fiala","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB22","series-title":"digital libraries","first-page":"4","volume":"38","year":"1995"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/125490.125492","article-title":"The human genome project and informatics","volume":"34","author":"Frenkel","year":"1991","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB24","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1137\/S0097539792231982","article-title":"A generalization of the suffix tree to square matrices, with applications","volume":"24","author":"Giancarlo","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB25","series-title":"Sequences II: Methods in Communication, Security and Computer Science","first-page":"245","article-title":"Coding trees as strings for approximate tree matching","author":"Grossi","year":"1992"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB26","series-title":"ACM-SIAM Symp. on Discrete Algorithms","first-page":"697","article-title":"An efficient algorithm for dynamic text indexing","author":"Gu","year":"1994"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB27","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","article-title":"An efficient algorithm for all pairs suffix-prefix problem","volume":"41","author":"Gusfield","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB28","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(94)90176-7","article-title":"Dynamic dictionary matching with failure functions","volume":"131","author":"Idury","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB29","article-title":"The Art of Computer Programming","volume":"vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB30","series-title":"IEEE Foundations of Computer Science","first-page":"178","article-title":"Efficient tree pattern matching","author":"Kosaraju","year":"1989"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB31","series-title":"Combinatorial Pattern Matching","first-page":"146","article-title":"Computation of squares in a string","author":"Kosaraju","year":"1994"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB32","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","article-title":"Fast string matching with k differences","volume":"37","author":"Landau","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB33","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","article-title":"Fast parallel and serial approximate string matching","volume":"10","author":"Landau","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB34","series-title":"IEEE Data Compression Conf.","first-page":"180","article-title":"Extended application of suffix trees to data compression","author":"Larsson","year":"1996"},{"issue":"2","key":"10.1016\/S0304-3975(97)00243-0_BIB35","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"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB36","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. Commun."},{"key":"10.1016\/S0304-3975(97)00243-0_BIB37","series-title":"Structure dati persistent; per problemi di ricerca su stringhe","author":"Montangero","year":"1996"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB38","article-title":"The Design of Dynamic Data Structures","volume":"vol. 156","author":"Overmars","year":"1983"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB39","series-title":"Proc. IEEE Symp. on Foundations of Computer Science","first-page":"320","article-title":"Efficient approximate and dynamic matching of patterns using a labeling paradigm","author":"Sahinalp","year":"1996"},{"issue":"4","key":"10.1016\/S0304-3975(97)00243-0_BIB40","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1145\/322344.322346","article-title":"Data compression via textual substitution","volume":"29","author":"Storer","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB41","series-title":"Principles of Text Processing","author":"Teskey","year":"1983"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB42","series-title":"Combinatorial Pattern Matching","first-page":"228","article-title":"Approximate string-matching over suffix trees","author":"Ukkonen","year":"1993"},{"key":"10.1016\/S0304-3975(97)00243-0_BIB43","series-title":"IEEE Symp. on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithm","author":"Weiner","year":"1973"},{"issue":"3","key":"10.1016\/S0304-3975(97)00243-0_BIB44","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"10.1016\/S0304-3975(97)00243-0_BIB45","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:26:43Z","timestamp":1556522803000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0304397597002430"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00243-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}