{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:11:09Z","timestamp":1725729069641},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642388118"},{"type":"electronic","value":"9783642388125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38812-5_7","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T01:10:03Z","timestamp":1370308203000},"page":"86-101","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Time Pattern Matching Algorithm for Ordered Graph Patterns"],"prefix":"10.1007","author":[{"given":"Takahiro","family":"Hino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuko","family":"Itokawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045(2), 117\u2013135 (1980)","journal-title":"Information and Control"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s10618-009-0162-1","volume":"21","author":"T. Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent subgraph mining in outerplanar graphs. Data Mining and Knowledge Discovery\u00a021(3), 472\u2013508 (2010)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02684448","volume":"61","author":"X. Jiang","year":"1998","unstructured":"Jiang, X., Bunke, H.: On the coding of ordered graphs. Computing\u00a061(1), 23\u201338 (1998)","journal-title":"Computing"},{"key":"7_CR4","unstructured":"Kawamoto, S., Suzuki, Y., Shoudai, T.: Learning characteristic structured patterns in rooted planar maps. In: IMECS 2010, IAENG, pp. 465\u2013470 (2010)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Kononenko, I., Kukar, M.: Machine Learning and Data Mining: Introduction to Principles and Algorithms. Horwood Pub. (2007)","DOI":"10.1533\/9780857099440"},{"issue":"8","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1016\/j.is.2005.05.005","volume":"32","author":"M. Kuramochi","year":"2007","unstructured":"Kuramochi, M., Karypis, G.: Discovering frequent geometric subgraphs. Information Systems\u00a032(8), 1101\u20131120 (2007)","journal-title":"Information Systems"},{"volume-title":"Machine Learning and Data Mining; Methods and Applications","year":"1998","key":"7_CR7","unstructured":"Michalski, R.S., Bratko, I., Bratko, A. (eds.): Machine Learning and Data Mining; Methods and Applications. John Wiley & Sons, Inc., NY (1998)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"7_CR9","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)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2005.10.022","volume":"350","author":"Y. Suzuki","year":"2006","unstructured":"Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T.: Ordered term tree languages which are polynomial time inductively inferable from positive data. Theoretical Computer Science\u00a0350(1), 63\u201390 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"7_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1587\/transinf.E92.D.181","volume":"92-D","author":"R. Takami","year":"2009","unstructured":"Takami, R., Suzuki, Y., Uchida, T., Shoudai, T.: Polynomial time inductive inference of TTSP graph languages from positive data. IEICE Transactions\u00a092-D(2), 181\u2013190 (2009)","journal-title":"IEICE Transactions"},{"key":"7_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-40992-0_11","volume-title":"Algorithmic Learning Theory","author":"T. Uchida","year":"2000","unstructured":"Uchida, T., Itokawa, Y., Shoudai, T., Miyahara, T., Nakamura, Y.: A new framework for discovering knowledge from two-dimensional structured data using layout formal graph system. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol.\u00a01968, pp. 141\u2013155. Springer, Heidelberg (2000)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.4153\/CJM-1963-029-x","volume":"15","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: A census of planar maps. Canadian Journal of Mathematics\u00a015, 249\u2013271 (1963)","journal-title":"Canadian Journal of Mathematics"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10994-009-5115-9","volume":"76","author":"H. Yamasaki","year":"2009","unstructured":"Yamasaki, H., Sasaki, Y., Shoudai, T., Uchida, T., Suzuki, S.: Learning block-preserving graph patterns and its application to data mining. Machine Learning\u00a076(1), 137\u2013173 (2009)","journal-title":"Machine Learning"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-31951-8_32","volume-title":"Inductive Logic Programming","author":"Y. Yoshimura","year":"2012","unstructured":"Yoshimura, Y., Shoudai, T., Suzuki, Y., Uchida, T., Miyahara, T.: Polynomial time inductive inference of cograph pattern languages from positive data. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS, vol.\u00a07207, pp. 389\u2013404. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38812-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:19:01Z","timestamp":1557767941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38812-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642388118","9783642388125"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38812-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}