{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:29Z","timestamp":1725488609578},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_32","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"335-346","source":"Crossref","is-referenced-by-count":19,"title":["Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables"],"prefix":"10.1007","author":[{"given":"Takayoshi","family":"Shoudai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuhiro","family":"Miyahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"T. R. Amoth, P. Cull, and P. Tadepalli. Exact learning of unordered tree patterns from queries. Proc. COLT-99, ACM Press, pages 323\u2013332, 1999.","DOI":"10.1145\/307400.307486"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Science, 21:46\u201362, 1980.","journal-title":"Journal of Computer and System Science"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"H. Arimura, T. Shinohara, and S. Otsuki. Polynomial time algorithm for finding finite unions of tree pattern languages. Proc. NIL-91, Springer-Verlag, LNAI 659, pages 118\u2013131, 1993.","DOI":"10.1007\/BFb0030389"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"S. Goldman and S. Kwek. On learning unions of pattern languages and tree patterns. Proc. ALT-99, Springer-Verlag, LNAI 1720, 1720:347\u2013363, 1999.","DOI":"10.1007\/3-540-46769-6_29"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"S. Matsumoto, Y. Hayashi, and T. Shoudai. Polynomial time inductive inference of regular term tree languages from positive data. Proc. ALT-97, Springer-Verlag, LNAI 1316, pages 212\u2013227, 1997.","DOI":"10.1007\/3-540-63577-7_45"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, T. Kuboyama, K. Takahashi, and H. Ueda. Discovering new knowledge from graph data using inductive logic programming. Proc. ILP-99, Springer-Verlag, LNAI 1634, pages 222\u2013233, 1999.","DOI":"10.1007\/3-540-48751-4_21"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Polynomial time matching algorithms for tree-like structured patterns in knowledge discovery. Proc. PAKDD-2000, Springer-Verlag, LNAI 1805, pages 5\u201316, 2000.","DOI":"10.1007\/3-540-45571-X_4"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Discovery of frequent tree structured patterns in semistructured web documents. Proc. PAKDD-2001, Springer-Verlag, LNAI 2035, pages 47\u201352, 2001.","DOI":"10.1007\/3-540-45357-1_8"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"S. Nestorov, S. Abiteboul, and R. Motwani. Extracting schema from semistructured data. Proceedings of ACM SIGMOD International Conference on Management of Data, pages 295\u2013306, 1998.","DOI":"10.1145\/276305.276331"},{"key":"32_CR10","series-title":"Lect Notes Comput Sci","first-page":"115","volume-title":"Polynomial time inference of extended regular pattern languages","author":"T. Shinohara","year":"1982","unstructured":"T. Shinohara. Polynomial time inference of extended regular pattern languages. In Springer-Verlag, LNCS 147, pages 115\u2013127, 1982."},{"key":"32_CR11","unstructured":"T. Shoudai, T. Miyahara, T. Uchida, and S. Matsumoto. Inductive inference of regular term tree languages and its application to knowledge discovery. Information Modelling and Knowledge Bases XI, IOS Press, pages 85\u2013102, 2000."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/69.846290","volume":"12","author":"K. Wang","year":"2000","unstructured":"K. Wang and H. Liu. Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering, 12:353\u2013371, 2000.","journal-title":"IEEE Trans. Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T06:51:03Z","timestamp":1550731863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}