{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:33Z","timestamp":1725566913984},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_30","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"346-357","source":"Crossref","is-referenced-by-count":4,"title":["A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables"],"prefix":"10.1007","author":[{"given":"Kazuhide","family":"Aikou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","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","reference":[{"key":"30_CR1","volume-title":"Data on the Web: From Relations to Semistructured Data and XML","author":"S. Abiteboul","year":"2000","unstructured":"Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)"},{"key":"30_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1007\/978-3-540-30549-1_97","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"K. Aikou","year":"2004","unstructured":"Aikou, K., Suzuki, Y., Shoudai, T., Miyahara, T.: Automatic Wrapper Generation for Metasearch using Ordered Tree Structured Patterns. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol.\u00a03339, pp. 1030\u20131035. Springer, Heidelberg (2004)"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010971904477","volume":"44","author":"T.R. Amoth","year":"2001","unstructured":"Amoth, T.R., Cull, P., Tadepalli, P.: On exact learning of unordered tree patterns. Machine Learning\u00a044, 211\u2013243 (2001)","journal-title":"Machine Learning"},{"key":"30_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-45583-3_24","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"2001","unstructured":"Arimura, H., Sakamoto, H., Arikawa, S.: Efficient learning of semi-structured data from queries. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 315\u2013331. Springer, Heidelberg (2001)"},{"key":"30_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery Science","author":"T. Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovery of frequent substructures in large unordered trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 47\u201361. Springer, Heidelberg (2003)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/ICDE.1998.655753","volume-title":"Proceedings of the 14th International Conference on Data Engineering (ICDE 1998)","author":"M. Fernandez","year":"1998","unstructured":"Fernandez, M., Suciu, D.: Optimizing regular path expressions using graph schemas. In: Proceedings of the 14th International Conference on Data Engineering (ICDE 1998), pp. 14\u201323. IEEE Computer Society, Los Alamitos (1998)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-63577-7_45","volume-title":"Algorithmic Learning Theory","author":"S. Matsumoto","year":"1997","unstructured":"Matsumoto, S., Hayashi, Y., Shoudai, T.: Polynomial time inductive inference of regular term tree languages from positive data. In: Li, M. (ed.) ALT 1997. LNCS, vol.\u00a01316, pp. 212\u2013227. Springer, Heidelberg (1997)"},{"key":"30_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-30215-5_32","volume-title":"Algorithmic Learning Theory","author":"S. Matsumoto","year":"2004","unstructured":"Matsumoto, S., Shoudai, T.: Learning of Ordered Tree Languages with Height- Bounded Variables Using Queries. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol.\u00a03244, pp. 425\u2013439. Springer, Heidelberg (2004)"},{"key":"30_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-24775-3_17","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Miyahara","year":"2004","unstructured":"Miyahara, T., Suzuki, Y., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of Maximally Frequent Tag Tree Patterns with Contractible Variables from Semistructured Documents. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 133\u2013144. Springer, Heidelberg (2004)"},{"key":"30_CR10","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 term tree patterns with internal variables. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 335\u2013346. Springer, Heidelberg (2001)"},{"key":"30_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45435-7_12","volume-title":"Computational Learning Theory","author":"Y. Suzuki","year":"2002","unstructured":"Suzuki, Y., Akanuma, R., Shoudai, T., Miyahara, T., Uchida, T.: Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 169\u2013184. Springer, Heidelberg (2002)"},{"key":"30_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-36169-3_17","volume-title":"Algorithmic Learning Theory","author":"Y. Suzuki","year":"2002","unstructured":"Suzuki, Y., Shoudai, T., Miyahara, T., Uchida, T.: Ordered Term Tree Languages Which Are Polynomial Time Inductively Inferable from Positive Data. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol.\u00a02533, pp. 188\u2013202. Springer, Heidelberg (2002)"},{"key":"30_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-36468-4_18","volume-title":"Inductive Logic Programming","author":"Y. Suzuki","year":"2003","unstructured":"Suzuki, Y., Inomae, K., Shoudai, T., Miyahara, T., Uchida, T.: A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol.\u00a02583, pp. 270\u2013284. Springer, Heidelberg (2003)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/69.846290","volume":"12","author":"K. Wang","year":"2000","unstructured":"Wang, K., Liu, H.: Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering\u00a012, 353\u2013371 (2000)","journal-title":"IEEE Trans. Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:15Z","timestamp":1619505615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11496656_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}