{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:58Z","timestamp":1725550618840},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_43","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T10:12:50Z","timestamp":1129198370000},"page":"388-398","source":"Crossref","is-referenced-by-count":1,"title":["A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC\u2019s"],"prefix":"10.1007","author":[{"given":"Hisashi","family":"Tsuji","sequence":"first","affiliation":[]},{"given":"Akira","family":"Ishino","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Amoth, T.R., Cull, P., Tadepalli, P.: Exact learning of tree patterns from queries and counterexamples. In: Proceedings of COLT 1998, pp. 175\u2013186 (1998)","DOI":"10.1145\/279943.279980"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. J. Comput. Sys. Sci.\u00a021, 46\u201362 (1980)","journal-title":"J. Comput. Sys. Sci."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0020-0190(01)00270-8","volume":"82","author":"C. Chauve","year":"2002","unstructured":"Chauve, C.: Tree pattern matching with a more general notion of occurrence of the pattern. Inform. Process. Lett.\u00a082, 197\u2013201 (2002)","journal-title":"Inform. Process. Lett."},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Tree pattern matching and subset matching in randomized O(n log3 n)-time. In: STOC 1997, pp. 66\u201375 (1997)","DOI":"10.1145\/258533.258553"},{"key":"43_CR5","unstructured":"Cole, R., Hariharan, R., Indyk, P.: Tree pattern matching and subset matching in deterministic O(n logn)-time. In: SODA 1999, pp. 245\u2013254 (1999)"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/174652.174653","volume":"41","author":"M. Dubliner","year":"1994","unstructured":"Dubliner, M., Galil, Z., Magen, E.: Faster tree pattern matching. J. ACM\u00a041(2), 205\u2013213 (1994)","journal-title":"J. ACM"},{"key":"43_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/3-540-44957-4_76","volume-title":"Computational Logic - CL 2000","author":"F.N.G. Jan Bex","year":"2000","unstructured":"Jan Bex, F.N.G., Maneth, S.: A formal model for an expressive fragment of xslt. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 1137\u20131151. Springer, Heidelberg (2000)"},{"issue":"1","key":"43_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffmann","year":"1982","unstructured":"Hoffmann, C.M., O\u2019Donnell, M.J.: Pattern matching in trees. J. ACM\u00a029(1), 68\u201395 (1982)","journal-title":"J. ACM"},{"key":"43_CR9","unstructured":"Kilpel\u00e4inen, P.: Tree Matching Problems with Applications to Structured Text Databases. PhD thesis, Dept. of Computer Science, University of Helsinki (1992)"},{"issue":"2","key":"43_CR10","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 J. Comput.\u00a024(2), 340\u2013356 (1995)","journal-title":"SIAM J. Comput."},{"key":"43_CR11","first-page":"178","volume-title":"FOCS 1989","author":"S.R. Kosaraju","year":"1989","unstructured":"Kosaraju, S.R.: Efficient tree pattern matching. In: FOCS 1989, pp. 178\u2013183. IEEE Comput. Soc. Press, Los Alamitos (1989)"},{"issue":"1","key":"43_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(91)90062-M","volume":"39","author":"F. Luccio","year":"1991","unstructured":"Luccio, F., Pagli, L.: An efficient algorithm for some tree matching problems. Inform. Process. Lett.\u00a039(1), 51\u201357 (1991)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"43_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/inco.1995.1160","volume":"123","author":"F. Luccio","year":"1995","unstructured":"Luccio, F., Pagli, L.: Approximate matching for two families of trees. Information and Computation\u00a0123(1), 111\u2013120 (1995)","journal-title":"Information and Computation"},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-63620-X_61","volume-title":"Principles of Document Processing","author":"M. Murata","year":"1997","unstructured":"Murata, M.: Transformation of documents and schemas by patterns and contextual conditions. In: Nicholas, C., Wood, D. (eds.) PODDP 1996 and PODP 1996. LNCS, vol.\u00a01293, pp. 153\u2013169. Springer, Heidelberg (1997)"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Murata, M.: Data model for document transformation and assembly (extended abstract), pp. 140\u2013152 (1998)","DOI":"10.1007\/3-540-49654-8_12"},{"key":"43_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible pattern matching in strings: Practical on-line search algorithms for texts and biological sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible pattern matching in strings: Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge (2002)"},{"key":"43_CR17","unstructured":"Nivat, M., Ait-Kaci, H.: On recognizable sets and tree automata. Resolution of Equations in Algebraic Structres (1989)"},{"key":"43_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-44669-9_32","volume-title":"Fundamentals of Computation Theory","author":"T. Shoudai","year":"2001","unstructured":"Shoudai, T., Uchida, T., Miyahara, T.: Polynomial time algorithms for finding unordered tree patterns with internal variables. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 335\u2013346. Springer, Heidelberg (2001)"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","volume":"27","author":"M. Takahashi","year":"1975","unstructured":"Takahashi, M.: Generalizations of regular sets and their application to a study of context-free languages. Information and Control\u00a027, 1\u201336 (1975)","journal-title":"Information and Control"},{"issue":"1","key":"43_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jagm.1994.1003","volume":"16","author":"K. Zhang","year":"1994","unstructured":"Zhang, K., Shasha, D., Wang, J.T.L.: Approximate tree matching in the presence of variable length don\u2019t cares. J. Algorithms\u00a016(1), 33\u201366 (1994)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:58:07Z","timestamp":1605625087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11575832_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}