{"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":1725663882394},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:19:56Z","timestamp":1330208396000},"page":"202-214","source":"Crossref","is-referenced-by-count":10,"title":["The tree inclusion problem"],"prefix":"10.1007","author":[{"given":"Pekka","family":"Kilpel\u00e4inen","sequence":"first","affiliation":[]},{"given":"Heikki","family":"Mannila","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0169-023X(90)90020-E","volume":"5","author":"C. Beeri","year":"1990","unstructured":"Beeri, C., A formal approach to object-oriented databases. Data & Knowledge Engineering 5 (1990), 353\u2013382.","journal-title":"Data & Knowledge Engineering"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Cai, J., Paige, R., Tarjan, R., More efficient bottom-up tree pattern matching. In: Proc. of the 15th Colloqium on Trees in Algebra and Programming (CAAP'90), p. 72\u201386.","DOI":"10.1007\/3-540-52590-4_41"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Dubiner, M., Galil, Z., Magen, E., Faster tree pattern matching. In: Proc. of the Symposium on Foundations of Computer Science (FOCS'90), p. 145\u2013150.","DOI":"10.1109\/FSCS.1990.89533"},{"key":"12_CR4","unstructured":"Gonnet, G., Tompa, F., Mind your grammar \u2014 a new approach to text databases. In: Proc. of the Conference on Very Large Data Bases (VLDB'87), p. 339\u2013346."},{"issue":"1","key":"12_CR5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffman","year":"1982","unstructured":"Hoffman, C.M., O'Donnell, M.J., Pattern matching in trees. J. ACM, 29, 1 (January 1982), 68\u201395.","journal-title":"J. ACM"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(87)90043-5","volume":"8","author":"D.S. Johnson","year":"1987","unstructured":"Johnson, D.S., The NP-completeness column: an ongoing guide. J. Algorithms 8 (1987), 285\u2013303.","journal-title":"J. Algorithms"},{"issue":"6","key":"12_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S., A linear space algorithm for computing maximal common subsequences. CACM 18, 6 (June 1975), 341\u2013343.","journal-title":"CACM"},{"key":"12_CR8","unstructured":"Kilpel\u00e4inen, P., Query languages for structured text databases. Ph.D. Thesis, University of Helsinki; in preparation."},{"key":"12_CR9","unstructured":"Knuth, D.E., The Art of Computer Programming, Vol. 1. Addison-Wesley 1969."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R., Efficient tree pattern matching. In: Proc. of the Symposium on Foundations of Computer Science (FOCS'89), p. 178\u2013183.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"12_CR11","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.-J., On query languages for the p-string data model. In: Information Modelling and Knowledge Bases, H. Kangassalo, S. Ohsuga, H. Jaakkola (eds.), IOS Press, 1990, p. 469\u2013482."},{"issue":"4","key":"12_CR12","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1137\/0206053","volume":"6","author":"S.W. Reyner","year":"1977","unstructured":"Reyner, S.W., An analysis of a good algorithm for the subtree problem. SIAM J. Computing 6, 4 (December 1977), 730\u2013732.","journal-title":"SIAM J. Computing"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D., Graph Minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 (1986), 309\u2013322.","journal-title":"J. Algorithms"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","volume":"11","author":"D. Shasha","year":"1990","unstructured":"Shasha, D., Zhang, K., Fast algorithms for the unit cost editing distance between trees. J. Algorithms 11 (1990), 581\u2013621.","journal-title":"J. Algorithms"},{"issue":"3","key":"12_CR15","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.-C. Tai","year":"1979","unstructured":"Tai, K.-C., The tree-to-tree correction problem. J. ACM 26, 3 (July 1979), 422\u2013433.","journal-title":"J. ACM"},{"issue":"6","key":"12_CR16","doi-asserted-by":"crossref","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 of Computing 18, 6 (December 1989), 1245\u20131262.","journal-title":"SIAM Journal of Computing"}],"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_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:18:06Z","timestamp":1619572686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}