{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:07:46Z","timestamp":1743091666602,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679783"},{"type":"electronic","value":"9783540444695"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-44469-6_30","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:23Z","timestamp":1181365043000},"page":"322-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Pattern Matching in Shared-Forest"],"prefix":"10.1007","author":[{"given":"M.","family":"Vilares","sequence":"first","affiliation":[]},{"given":"F. J.","family":"Ribadas","sequence":"additional","affiliation":[]},{"given":"V. M.","family":"Darriba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"30_CR1","series-title":"Lect Notes Comput Sci","first-page":"159","volume-title":"Grammatical Tree Matching","author":"P. Kilpelainen","year":"1992","unstructured":"Kilpelainen, P., Mannila, H.: Grammatical Tree Matching. Lecture Notes in Computer Science 644 (1992) 159\u2013171."},{"key":"30_CR2","unstructured":"Kilpelainen, P.: Tree Matching Problems with Applications to Structured Text Databases. Ph.D. Thesis, Department of Computer Science, University of Helsinki, 1992. Helsinki, Finland"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Smeaton, Alan F.: Incorporating Syntactic Information into a Document Retrieval Strategy: An Investigation. Proc. the 9\nth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 103\u2013113, 1986.","DOI":"10.1145\/253168.253193"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Smeaton, A.F. and van Rijsbergen, C.J.: Experiments on Incorporating Syntactic Processing of User Queries into a Document Retrieval Strategy. Proc. of the IIth International ACM-SIGIR Conference on Research and Development in Information Retrieval, pp. 31\u201354. Grenoble, France, 1988.","DOI":"10.1145\/62437.62439"},{"key":"30_CR5","unstructured":"Smeaton, A.F and O\u2019Donell, R. anf Kelley, F.: Indexing Structures Derived from Syntax in TREC-3: System Description. Proc. of 3rd Text REtrieval Conference (TREC-3), D.K. Harman (ed.), NIST Special Publication, 1994."},{"issue":"5","key":"30_CR6","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/TSE.1978.233861","volume":"4","author":"K.-Chung. Tai","year":"1978","unstructured":"Tai, Kuo-Chung.: Syntactic error correction in programming languages. IEEE Transactions on Software Engineering 4(5) (1978) 414\u2013425.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"30_CR7","unstructured":"Vilares, M., Dion, B.A.: Efficient incremental parsing for context-free languages. Proc. of the 5th IEEE International Conference on Computer Languages (1994) 241\u2013252, Toulouse, France."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing (1989) 18 1245\u20131262.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jagm.1994.1003","volume":"16","author":"K. Zhang","year":"1994","unstructured":"Zhang, K. and Shasha, D. and Wang, J.T.L. Approximate Tree Matching in the Presence of Variable Length Donrst Cares. Journal of Algorithms, pages 33\u201366, vol 16(1), 1994","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44469-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T19:15:10Z","timestamp":1585854910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44469-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679783","9783540444695"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44469-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"28 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}