{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:07:27Z","timestamp":1742396847151},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429562"},{"type":"electronic","value":"9783540456506"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45650-3_37","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T21:48:45Z","timestamp":1180907325000},"page":"435-440","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A Practical Algorithm to Find the Best Episode Patterns"],"prefix":"10.1007","author":[{"given":"Masahiro","family":"Hirao","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"issue":"1","key":"37_CR1","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. J. Comput. Syst. Sci., 21(1):46\u201362, Aug. 1980.","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"R. A. Baeza-Yates","year":"1991","unstructured":"R. A. Baeza-Yates. Searching subsequences. Theoretical Computer Science, 78(2):363\u2013376, Jan. 1991.","journal-title":"Theoretical Computer Science"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"R. Fujino, H. Arimura, and S. Arikawa. Discovering unordered and ordered phrase association patterns for text mining. In Proc. of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, volume 1805 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Apr. 2000.","DOI":"10.1007\/3-540-45571-X_34"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best subsequence patterns. In Proc. of The Third International Conference on Discovery Science, volume 1967 of Lecture Notes in Artificial Intelligence, pages 141\u2013154. Springer-Verlag, Dec. 2000.","DOI":"10.1007\/3-540-44418-1_12"},{"key":"37_CR5","unstructured":"H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episode in sequences. In U. M. Fayyad and R. Uthurusamy, editors, Proc. of the 1st International Conference on Knowledge Discovery and Data Mining, pages 210\u2013215. AAAI Press, Aug. 1995."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF03037530","volume":"18","author":"S. Miyano","year":"2000","unstructured":"S. Miyano, A. Shinohara, and T. Shinohara. Polynomial-time learning of elementary formal systems. New Generation Computing, 18:217\u2013242, 2000.","journal-title":"New Generation Computing"},{"issue":"10","key":"37_CR7","first-page":"2009","volume":"35","author":"S. Shimozono","year":"1994","unstructured":"S. Shimozono, A. Shinohara, T. Shinohara, S. Miyano, S. Kuhara, and S. Arikawa. Knowledge acquisition from amino acid sequences by machine learning system BONSAI. Transactions of Information Processing Society of Japan, 35(10):2009\u20132018, Oct. 1994.","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"37_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-48194-X_12","volume-title":"Proc. of 12th Annual Symposium on Combinatorial Pattern Matching","author":"Z. Tron\u00ed\u010dek","year":"2001","unstructured":"Z. Tron\u00ed\u010dek. Episode matching. In Proc. of 12th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, pages 143\u2013146. Springer-Verlag, July 2001."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45650-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:41:27Z","timestamp":1558273287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45650-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429562","9783540456506"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45650-3_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"20 December 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}