{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:25:04Z","timestamp":1794378304719,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405450","type":"print"},{"value":"9783540450788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_30","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:23:52Z","timestamp":1277227432000},"page":"340-352","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Text and Static Pattern Matching"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dina","family":"Sokol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts. In: Proc. of the Symposium on Discrete Algorithms, pp. 819\u2013828 (2000)"},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1016\/S0304-3975(02)00041-5","volume":"290","author":"A. Amir","year":"2003","unstructured":"Amir, A., Landau, G., Sokol, D.: Inplace run-length 2d compressed search. Theoretical Computer Science\u00a0290(3), 1361\u20131383 (2003)","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Buchsbaum, A., Goodrich, M., Westbrook, J.: Range searching over tree cross products. In: Proc. of European Symposium of Algorithms, pp. 120\u2013131 (2000)","DOI":"10.1007\/3-540-45253-2_12"},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1137\/S009753979324694X","volume":"26","author":"R. Cole","year":"1997","unstructured":"Cole, R., Hariharan, R.: Tighter upper bounds on the exact complexity of string matching. SIAM J. on Computing\u00a026(3), 803\u2013856 (1997)","journal-title":"SIAM J. on Computing"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. of the Symposium on Foundations of Computer Science, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Farach, M., Muthukrishnan, S.: Perfect hashing for strings: formalization and algorithms. In: Proc. of Combinatorial Pattern Matching, pp. 130\u2013140 (1996)","DOI":"10.1007\/3-540-61258-0_11"},{"key":"30_CR7","unstructured":"Ferragina, P., Grossi, R.: Fast incremental text editing. In: Proc. of the Symposium on Discrete Algorithms, pp. 531\u2013540 (1995)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J., Tarjan, R.E.: Scaling and related techniques for geometric problems. In: Proc. of the Symposium on Theory of Computing, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"30_CR9","unstructured":"Gu, M., Farach, M., Beigel, R.: An efficient algorithm for dynamic text indexing. In: Proc. of the Symposium on Discrete Algorithms, pp. 697\u2013704 (1994)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1171","volume":"41","author":"T. Hagerup","year":"2000","unstructured":"Hagerup, T., Miltersen, P.B., Pagh, R.: Deterministic dictionaries. J. of Algorithms\u00a041, 69\u201385 (2000)","journal-title":"J. of Algorithms"},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. on Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G.M. Landau","year":"1988","unstructured":"Landau, G.M., Vishkin, U.: Fast string matching with k differences. Journal of Computer and System Sciences\u00a037(1), 63\u201378 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR14","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. of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"J. of the ACM"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proc. of the Symposium on Foundations of Computer Science, pp. 320\u2013328 (1996)","DOI":"10.1109\/SFCS.1996.548491"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014, 249\u2013260","DOI":"10.1007\/BF01206331"},{"key":"30_CR17","unstructured":"van Emde Boas, P.: An $O(n \\ {\\log} \\ {\\log} \\ n)$ on-line algorithm for the insert-extract min problem. Technical Report, Department of Computer Science, Cornell University, Number TR 74-221 (1974)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proc. of the Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D.E. Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst case range queries are possible in space \u03b8(n). Information Processing Letters\u00a017, 81\u201384 (1983)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:48:41Z","timestamp":1559195321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_30","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b11837","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}