{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:54:54Z","timestamp":1725573294547},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_25","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"248-259","source":"Crossref","is-referenced-by-count":0,"title":["Matching Subsequences in Trees"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"#cr-split#-25_CR1.1","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph (in russian). English translation in soviet math. dokl.\u00a011, 1209\u20131210 (1975);"},{"key":"#cr-split#-25_CR1.2","unstructured":"Dokl. Acad. Nauk. 194, 487\u2013488 (1970)"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"R.A. Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.A.: Searching subsequences. Theor. Comput. Sci.\u00a078(2), 363\u2013376 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"5-6","key":"25_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(00)00057-0","volume":"74","author":"W. Chen","year":"2000","unstructured":"Chen, W.: Multi-subsequence searching. Inf. Process. Lett.\u00a074(5-6), 229\u2013233 (2000)","journal-title":"Inf. Process. Lett."},{"key":"25_CR4","unstructured":"Clark, J., DeRose, S.: XML path language (XPath) (1999), avialiable as: \n                    \n                      http:\/\/www.w3.org\/TR\/xpath"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: Proc. of ACM Symp. on Theory of Computing, pp. 246\u2013251 (1983)","DOI":"10.1145\/800061.808753"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1171","volume":"41","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Miltersen, P.B., Pagh, R.: Deterministic dictionaries. J. Algorithms\u00a041(1), 69\u201385 (2001)","journal-title":"J. Algorithms"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal of Computing"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM Journal of Computing\u00a024, 340\u2013356 (1995)","journal-title":"SIAM Journal of Computing"},{"issue":"6","key":"25_CR9","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/asi.10060","volume":"53","author":"T. Schlieder","year":"2002","unstructured":"Schlieder, T., Meuss, H.: Querying and ranking XML documents. J. Am. Soc. Inf. Sci. Technol.\u00a053(6), 489\u2013503 (2002)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"25_CR10","unstructured":"Schlieder, T., Naumann, F.: Approximate tree embedding for querying XML data. In: ACM SIGIR Workshop On XML and Information Retrieval (2000)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M., Sebag, M.: Treefinder: a first step towards XML data mining. In: IEEE International Conference on Data Mining, ICDM (2002)","DOI":"10.1109\/ICDM.2002.1183987"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s00778-004-0134-4","volume":"13","author":"H. Yang","year":"2004","unstructured":"Yang, H., Lee, L., Hsu, W.: Finding hot query patterns over an xquery stream. The VLDB Journal\u00a013(4), 318\u2013332 (2004)","journal-title":"The VLDB Journal"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Yang, L.H., Lee, M.L., Hsu, W.: Efficient mining of XML query patterns for caching. In: Proceedings of the 29th VLDB Conference, pp. 69\u201380 (2003)","DOI":"10.1016\/B978-012722442-8\/50015-X"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-39429-7_10","volume-title":"Database and XML Technologies","author":"P. Zezula","year":"2003","unstructured":"Zezula, P., Amato, G., Debole, F., Rabitti, F.: Tree signatures for XML querying and navigation. In: Bellahs\u00e8ne, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds.) XSym 2003. LNCS, vol.\u00a02824, pp. 149\u2013163. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:24Z","timestamp":1619507064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11758471_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}