{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:16Z","timestamp":1742617156361,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560241"},{"type":"electronic","value":"9783540473572"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56024-6_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:54:01Z","timestamp":1330253641000},"page":"276-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic dictionary matching with failure functions"],"prefix":"10.1007","author":[{"given":"Ramana M.","family":"Idury","sequence":"first","affiliation":[]},{"given":"Alejandro A.","family":"Sch\u00e4ffer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"22_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., Corasick, M. J.: Efficient String Matching: An Aid to Bibliographic Search, Comm. ACM 18 (1975), 333\u2013340.","journal-title":"Comm. ACM"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Amir, A., Farach, M.: Adaptive Dictionary Matching, Proc. 32nd IEEE Symp. Found. Comp. Sci., (1991), 760\u2013766.","DOI":"10.1109\/SFCS.1991.185445"},{"key":"22_CR3","unstructured":"Amir, A., Farach, M.:, Two Dimensional Dictionary Matching, submitted for publication, 1991."},{"key":"22_CR4","unstructured":"Amir, A., Farach, M., Galil, Z., Giancarlo, R., Park, K.: Dynamic Dictionary Matching, manuscript, 1991."},{"key":"22_CR5","unstructured":"Amir, A., Farach, M., Idury, R. M., La Poutr\u00e9, J. A., Sch\u00e4ffer, A. A.: Improved Dynamic Dictionary Matching, manuscript, 1992."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Amir, A., Farach, M., Matias, Y., Efficient Randomized Dictionary Algorithms, Proc. 3rd Symp. Combinatorial Pattern Matching, (1992).","DOI":"10.1007\/3-540-56024-6_21"},{"key":"22_CR7","series-title":"NATO ASI Series, Vol. F12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-642-82456-2_7","volume-title":"Combinatorial Algorithms on Words","author":"M. T. Chen","year":"1985","unstructured":"Chen, M. T., Seiferas, J.: Efficient and Elegant Subword-Tree Construction, in: Apostolico A., Galil, Z. eds.: Combinatorial Algorithms on Words, NATO ASI Series, Vol. F12, (Springer-Verlag, Heidelberg, 1985), 97\u2013107. Vol. 71 (Springer, Berlin, 1979) 118\u2013132."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Dietz, P., Sleator, D. D.: Two Algorithms for Maintaining Order in a List, Proc. 19th ACM Symp. Theor. Comp. Sci., (1987), 365\u2013372.","DOI":"10.1145\/28395.28434"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"Knuth, D. E., Morris, J. H., Pratt, V. B.: Fast Pattern Matching in Strings, SIAM J. Comp. 6(1977), 323\u2013350.","journal-title":"SIAM J. Comp."},{"key":"22_CR10","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, J. ACM, 23(1976), 262\u2013272.","journal-title":"J. ACM"},{"key":"22_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms 1: Sorting and Searching, (Springer-Verlag, Berlin), 1984."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithms, Proc. 14th IEEE Symp. on Switching and Automata Theory, (1973), 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56024-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:45:56Z","timestamp":1742593556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56024-6_22"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560241","9783540473572"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56024-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}