{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:05:38Z","timestamp":1742389538260},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433385"},{"type":"electronic","value":"9783540458845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45884-0_21","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T22:06:11Z","timestamp":1180908371000},"page":"307-317","source":"Crossref","is-referenced-by-count":9,"title":["Finding Best Patterns Practically"],"prefix":"10.1007","author":[{"given":"Ayumi","family":"Shinohara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Hirao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiromasa","family":"Hoshino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"1","key":"21_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":"21_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"},{"doi-asserted-by":"crossref","unstructured":"A. Califano. SPLASH: Structural pattern localization analysis by sequential histograms. Bioinformatics, Feb. 1999.","key":"21_CR3","DOI":"10.1093\/bioinformatics\/16.4.341"},{"unstructured":"M. Crochemore and Z. Tron\u00ed\u010dek. Directed acyclic subsequence graph for multiple texts. Technical Report IGM-99-13, Institut Gaspard-Monge, June 1999.","key":"21_CR4"},{"unstructured":"R. Feldman, Y. Aumann, A. Amir, A. Zilberstein, and W. Klosgen. Maximal association rules: A new tool for mining for keyword co-occurrences in document collections. In Proc. of the 3rd International Conference on Knowledge Discovery and Data Mining, pages 167\u2013170. AAAI Press, Aug. 1997.","key":"21_CR5"},{"key":"21_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Progress in Discovery Science","author":"Y. Hamuro","year":"2002","unstructured":"Y. Hamuro, H. Kawata, N. Katoh, and K. Yada. A machine learning algorithm for analyzing string patterns helps to discover simple and interpretable business rules from purchase history. In Progress in Discovery Science, LNCS, 2002. (In this volume)."},{"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.","key":"21_CR7","DOI":"10.1007\/3-540-44418-1_12"},{"doi-asserted-by":"crossref","unstructured":"M. Hirao, S. Inenaga, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find the best episode patterns. In Proc. of The Fourth International Conference on Discovery Science, Lecture Notes in Artificial Intelligence. Springer-Verlag, Nov. 2001.","key":"21_CR8","DOI":"10.1007\/3-540-45650-3_37"},{"doi-asserted-by":"crossref","unstructured":"H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. Online construction of subsequence automata for multiple texts. In Proc. of 7th International Symposium on String Processing and Information Retrieval. IEEE Computer Society, Sept. 2000. (to appear).","key":"21_CR9","DOI":"10.1109\/SPIRE.2000.878190"},{"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":"21_CR10"},{"key":"21_CR11","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"},{"doi-asserted-by":"crossref","unstructured":"S. Morishita and J. Sese. Traversing itemset lattices with statistical metric pruning. In Proc. of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 226\u2013236. ACM Press, May 2000.","key":"21_CR12","DOI":"10.1145\/335168.335226"},{"issue":"10","key":"21_CR13","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":"21_CR14","series-title":"Lect Notes Comput Sci","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. Springer-Verlag, July 2001. (to appear)."},{"doi-asserted-by":"crossref","unstructured":"J. T. L. Wang, G.-W. Chirn, T. G. Marr, B. A. Shapiro, D. Shasha, and K. Zhang. Combinatorial pattern discovery for scientific data: Some preliminary results. In Proc. of the 1994 ACM SIGMOD International Conference on Management of Data, pages 115\u2013125. ACM Press, May 1994.","key":"21_CR15","DOI":"10.1145\/191839.191863"}],"container-title":["Lecture Notes in Computer Science","Progress in Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45884-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:59:40Z","timestamp":1556470780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45884-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433385","9783540458845"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45884-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}