{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:10Z","timestamp":1725664750229},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634935"},{"type":"electronic","value":"9783540695820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3540634932_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:27:26Z","timestamp":1330298846000},"page":"381-384","source":"Crossref","is-referenced-by-count":0,"title":["Suffix tree automata in state space search"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,8]]},"reference":[{"issue":"6","key":"32_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333\u2013340, 1975.","journal-title":"Communications of the ACM"},{"issue":"2","key":"32_CR2","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","volume":"49","author":"A. Amir","year":"1994","unstructured":"A. Amir, M. Farach, Z. Galil, R. Giancarlo, and K. Park. Dynamic dictionary matching. J. Comput. Syst. Sci., 49(2):208\u2013222, 1994.","journal-title":"J. Comput. Syst. Sci."},{"key":"32_CR3","first-page":"100","volume":"4","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC, 4:100, 1968.","journal-title":"IEEE Trans. on SSC"},{"issue":"2","key":"32_CR4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(85)90088-2","volume":"21","author":"B. Meyer","year":"1985","unstructured":"B. Meyer. Incremental string matching. Inf. Process. Lett., 21:219\u2013227, 1985.","journal-title":"Inf. Process. Lett."},{"key":"32_CR6","unstructured":"L. A. Taylor and R. E. Korf. Pruning duplicate nodes in depth-first search. In AAAI-93, pages 756\u2013761, 1993."}],"container-title":["Lecture Notes in Computer Science","KI-97: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540634932_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:44:08Z","timestamp":1619574248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540634932_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634935","9783540695820"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3540634932_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}