{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:05Z","timestamp":1725664085727},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58218-5_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:37:28Z","timestamp":1330252648000},"page":"350-358","source":"Crossref","is-referenced-by-count":0,"title":["Efficient preprocessing of simple binary pattern forests"],"prefix":"10.1007","author":[{"given":"Mikkel","family":"Thorup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0304-3975(92)90277-M","volume":"106","author":"J. Cai","year":"1992","unstructured":"Cai, J., Paige, R., and Tarjan, R., More efficient bottom-up multi-pattern matching in trees. Theor. Comp. Sci.106 (1992) 21\u201360.","journal-title":"Theor. Comp. Sci."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Dietz, P.F. Maintaining order in a linked list. In: Proc. 14th STOC (ACM, 1982) 122\u2013127.","DOI":"10.1145\/800070.802184"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Dietz, P.F. and Sleator, D.D. Two algorithms for maintaining order in a list. In: Proc. 19th STOC (ACM, 1987) 365\u2013372.","DOI":"10.1145\/28395.28434"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Hoffmann, C. and O'Donnell, J. An interpreter generator using tree pattern matching. In: Proc. 6th. POPL (ACM, 1979) 169\u2013179.","DOI":"10.1145\/567752.567768"},{"issue":"1","key":"32_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. Hoffman","year":"1982","unstructured":"Hoffman, C. and O'Donnell, J., Pattern matching in trees. J. ACM29:1 (1982) 68\u201395.","journal-title":"J. ACM"},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J. and Pratt, V., Fast pattern matching in strings. SIAM J. Comput.6:2 (1977) 323\u2013350.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"32_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(75)90046-0","volume":"3","author":"B. Wegbreit","year":"1975","unstructured":"Wegbreit, B., Retrieval from context trees. Inf. Proc. Lett.3:4 (1975) 119\u2013120.","journal-title":"Inf. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:13:00Z","timestamp":1619557980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}