{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:13Z","timestamp":1725579013073},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_8","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"68-81","source":"Crossref","is-referenced-by-count":2,"title":["Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism"],"prefix":"10.1007","author":[{"given":"Yusaku","family":"Kaneta","sequence":"first","affiliation":[]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"8_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11523468_6","volume-title":"Automata, Languages and Programming","author":"P. Bille","year":"2005","unstructured":"Bille, P., G\u00f8rtz, I.L.: The tree inclusion problem: In optimal space and faster. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 66\u201377. Springer, Heidelberg (2005)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/11786986_56","volume-title":"Automata, Languages and Programming","author":"P. Bille","year":"2006","unstructured":"Bille, P.: New algorithms for regular expression matching. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 643\u2013654. Springer, Heidelberg (2006)"},{"issue":"7","key":"8_CR4","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/j.is.2009.03.010","volume":"34","author":"M. G\u00f6tz","year":"2009","unstructured":"G\u00f6tz, M., Koch, C., Martens, W.: Efficient algorithms for descendant-only tree pattern queries. Inf.\u00a0Syst.\u00a034(7), 602\u2013623 (2009)","journal-title":"Inf.\u00a0Syst."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1515\/crll.1869.70.185","volume":"70","author":"C. Jordan","year":"1869","unstructured":"Jordan, C.: Sur les assemblages de lignes. Journal f\u00fcr die Reine und Angewandte Mathematik\u00a070, 185\u2013190 (1869)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Kaneta, Y., Arimura, H.: Fast bit-parallel algorithm for unordered pseudo-tree matching and tree homeomorphism. TCS-TR-A-10-43, Hokkaido University (2010)","DOI":"10.1007\/978-3-642-19222-7_8"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-16321-0_39","volume-title":"String Processing and Information Retrieval","author":"Y. Kaneta","year":"2010","unstructured":"Kaneta, Y., Minato, S., Arimura, H.: Fast bit-parallel matching for network and regular expressions. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 372\u2013384. Springer, Heidelberg (2010)"},{"key":"8_CR8","unstructured":"Kilpel\u00e4inen, P.: Tree matching problems with applications to structured text databases. Ph.D Thesis, Report A-1992-6, DCS, University of Helsinki (1992)"},{"issue":"2","key":"8_CR9","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 on Computing\u00a024(2), 340\u2013356 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1145\/128749.128755","volume":"39","author":"E.W. Myers","year":"1992","unstructured":"Myers, E.W.: A four Russian algorithm for regular expression pattern matching. Journal of the ACM\u00a039(2), 430\u2013448 (1992)","journal-title":"Journal of the ACM"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences, Cambridge (2002)","DOI":"10.1017\/CBO9781316135228"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/11575832_43","volume-title":"String Processing and Information Retrieval","author":"H. Tsuji","year":"2005","unstructured":"Tsuji, H., Ishino, A., Takeda, M.: A bit-parallel tree matching algorithm for patterns with horizontal VLDC\u2019s. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 388\u2013398. Springer, Heidelberg (2005)"},{"key":"8_CR13","unstructured":"W3C, Extensive Markup Language (XML) 1.0 (Second Edition), W3C Recommendation (October 2000), \n                  \n                    http:\/\/www.w3.org\/TR\/REC-xml"},{"issue":"2-4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.jda.2004.08.017","volume":"3","author":"G. Valiente","year":"2005","unstructured":"Valiente, G.: Constrained tree inclusion. Journal of Discrete Algorithms\u00a03(2-4), 431\u2013447 (2005)","journal-title":"Journal of Discrete Algorithms"},{"issue":"10","key":"8_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching: allowing errors. Communications of the ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Communications of the ACM"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-03367-4_48","volume-title":"Algorithms and Data Structures","author":"H. Yamamoto","year":"2009","unstructured":"Yamamoto, H., Takenouchi, D.: Bit-parallel tree pattern matching algorithms for unordered labeled trees. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 554\u2013565. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:28:18Z","timestamp":1558420098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}