{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:42Z","timestamp":1725663882826},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539827"},{"type":"electronic","value":"9783540465638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53982-4_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:19:46Z","timestamp":1330190386000},"page":"193-201","source":"Crossref","is-referenced-by-count":2,"title":["Simple solutions for approximate tree matching problems"],"prefix":"10.1007","author":[{"given":"Fabrizio","family":"Luccio","sequence":"first","affiliation":[]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"M. Dubiner, Z. Galil and E. Magen, Faster tree pattern matching, Proc. 31-st IEEE Symp. on Found. of Comp. Sc. (1990) 145\u2013149.","DOI":"10.1109\/FSCS.1990.89533"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","volume":"4","author":"Z. Galil","year":"1988","unstructured":"Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching, J. Complexity\n                4 (1988) 33\u201372.","journal-title":"J. Complexity"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comp.\n                13 (1984) 338\u2013355.","journal-title":"SIAM J. Comp."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffmann","year":"1982","unstructured":"C.M. Hoffmann and M.J. O'Donnell, Pattern matching in trees, J. ACM\n                29 (1982) 68\u201395.","journal-title":"J. ACM"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju, Efficient tree pattern matching, Proc. 30-th IEEE Symp. on found. of Comp. Sc.(1989) 178\u2013183.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"G.M. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching and a new serial algorithm, Proc. 18-th ACM Symp. on Theory of Comp. (1986) 220\u2013230.","DOI":"10.1145\/12130.12152"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(89)90056-2","volume":"32","author":"E. M\u00e4kinen","year":"1989","unstructured":"E. M\u00e4kinen, On the subtree isomorphism problem for ordered trees, Inf. Proc. Let.\n                32 (1989) 271\u2013273.","journal-title":"Inf. Proc. Let."},{"key":"11_CR8","unstructured":"L. Stryer, Biochemestry, 3-rd edition, W.H.Freeman and Co., New York, NY 1988."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comp.\n                18 (1989) 1245\u20131262.","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53982-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:18:05Z","timestamp":1619558285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}