{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:48:39Z","timestamp":1725504519602},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784685"},{"type":"electronic","value":"9783540784692"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78469-2_24","type":"book-chapter","created":{"date-parts":[[2008,2,22]],"date-time":"2008-02-22T04:17:25Z","timestamp":1203653845000},"page":"239-253","source":"Crossref","is-referenced-by-count":9,"title":["Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns"],"prefix":"10.1007","author":[{"given":"Yosuke","family":"Sasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hitoshi","family":"Yamasaki","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"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Ramon, J., Wrobel, S.: Frequent Subgraph Mining in Outerplanar Graphs. In: Proc. KDD 2006, pp. 197\u2013206 (2006)","DOI":"10.1145\/1150402.1150427"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0304-3975(89)90011-X","volume":"63","author":"A. Lingas","year":"1989","unstructured":"Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoretical Computer Science\u00a063, 295\u2013302 (1989)","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-45571-X_4","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"T. Miyahara","year":"2000","unstructured":"Miyahara, T., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Polynomial time matching algorithms for tree-like structured patterns in knowledge discovery. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 5\u201316. Springer, Heidelberg (2000)"},{"key":"24_CR4","unstructured":"National Cancer Institute - Chemical Dataset, http:\/\/cactus.nci.nih.gov\/"},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R. Shamir","year":"1999","unstructured":"Shamir, R., Tsur, D.: Faster subtree isomorphism. Journal of Algorithms\u00a033(2), 267\u2013280 (1999)","journal-title":"Journal of Algorithms"},{"key":"24_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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, Springer, Heidelberg (2003)"},{"key":"24_CR7","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, 63\u201390 (2006)","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/11536314_22","volume-title":"Inductive Logic Programming","author":"R. Takami","year":"2005","unstructured":"Takami, R., Suzuki, Y., Uchida, T., Shoudai, T., Nakamura, Y.: Polynomial time inductive inference of TTSP graph languages from positive data. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol.\u00a03625, pp. 366\u2013383. Springer, Heidelberg (2005)"},{"issue":"2","key":"24_CR9","first-page":"99","volume":"E78-D","author":"T. Uchida","year":"1995","unstructured":"Uchida, T., Shoudai, T., Miyano, S.: Parallel algorithm for refutation tree problem on formal graph systems. IEICE Transactions on Information and Systems\u00a0E78-D(2), 99\u2013112 (1995)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-72504-6_6","volume-title":"Theory and Applications of Models of Computation","author":"H. Yamasaki","year":"2007","unstructured":"Yamasaki, H., Shoudai, T.: A polynomial time algorithm for finding linear interval graph patterns. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 67\u201378. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78469-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:10:12Z","timestamp":1619521812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78469-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784685","9783540784692"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78469-2_24","relation":{},"subject":[]}}