{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:47Z","timestamp":1725663827989},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-57182-5_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:08:56Z","timestamp":1330258136000},"page":"211-221","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On the tree inclusion problem"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Alonso","sequence":"first","affiliation":[]},{"given":"Ren\u00e9","family":"Schott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"13_CR1","unstructured":"L.Alonso, R.Schott, On the tree inclusion, preprint."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"J.Cai, R.Paige, R.Tarjan, More efficient bottom-up tree pattern matching, Proc. CAAP'90, LNCS 431, 72\u201386.","DOI":"10.1007\/3-540-52590-4_41"},{"issue":"1","key":"13_CR3","first-page":"68","volume":"29","author":"C. M. Hoffman","year":"1992","unstructured":"C.M.Hoffman, M.J.O'Donnell, Pattern matching in trees, J.A.C.M., 29, 1, 68\u201395, 1992.","journal-title":"J.A.C.M."},{"key":"13_CR4","first-page":"202","volume":"493","author":"P. Kilpel\u00e4inen","year":"1991","unstructured":"P.Kilpel\u00e4inen, H.Mannila, The tree inclusion problem, CAAP 91, LNCS 493, 202\u2013214, 1991.","journal-title":"LNCS"},{"key":"13_CR5","unstructured":"D.E.Knuth, The art of computer programming, Fundamental Algorithms, 1, Addison Wesley, 1973."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K.Zhang, D.Shasha, Simple fast algorithms for editing distance between trees and related problems, SIAM Journal of Computing, 18, 1245\u20131262, 1989","journal-title":"SIAM Journal of Computing"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","volume":"11","author":"K. Zhang","year":"1990","unstructured":"K.Zhang, D.Shasha, Fast Algorithms for the Unit Cost Editing Distance between Trees, Journal of Algorithms 11, 581\u2013621, 1990","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:07:29Z","timestamp":1558267649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}