{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:50:59Z","timestamp":1767340259567},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3886,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00182-2","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T14:53:32Z","timestamp":1042815212000},"page":"465-479","source":"Crossref","is-referenced-by-count":12,"title":["A practical algorithm to find the best subsequence patterns"],"prefix":"10.1016","volume":"292","author":[{"given":"Masahiro","family":"Hirao","sequence":"first","affiliation":[]},{"given":"Hiromasa","family":"Hoshino","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":"78","reference":[{"key":"10.1016\/S0304-3975(02)00182-2_BIB1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, R. Srikant, Mining sequential patterns, in: Proc. 11th Internat. Conf. on Data Engineering, 1995, pp. 3\u201314.","DOI":"10.1109\/ICDE.1995.380415"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(02)00182-2_BIB3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","article-title":"Searching subsequences","volume":"78","author":"Baeza-Yates","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00182-2_BIB4","unstructured":"A. Califano, SPLASH: structural pattern localization analysis by sequential histograms, Bioinformatics."},{"key":"10.1016\/S0304-3975(02)00182-2_BIB5","unstructured":"M. Crochemore, Z. Tron\u0131́\u010dek, Directed acyclic subsequence graph for multiple texts, Technical Report IGM-99-13, Institut Gaspard-Monge, June 1999."},{"key":"10.1016\/S0304-3975(02)00182-2_BIB6","series-title":"Proc. 8th Ann. Symp. on Combinatorial Pattern Matching","first-page":"12","article-title":"Episode matching","volume":"vol. 1264","author":"Das","year":"1997"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB7","unstructured":"R. Feldman, Y. Aumann, A. Amir, A. Zilberstein, W. Klosgen, Maximal association rules: a new tool for mining for keyword co-occurrences in document collections, in: Proc. 3rd Internat. Conf. on Knowledge Discovery and Data Mining, AAAI Press, New York, 1997, pp. 167\u2013170."},{"key":"10.1016\/S0304-3975(02)00182-2_BIB8","doi-asserted-by":"crossref","unstructured":"M. Hirao, S. Inenaga, A. Shinohara, M. Takeda, S. Arikawa, A practical algorithm to find the best episode patterns, in: Proc. 4th Internat. Conf. on Discovery Science, Lecture Notes in Artificial Intelligence, Springer, Berlin, 2001, to appear.","DOI":"10.1007\/3-540-45650-3_37"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB9","doi-asserted-by":"crossref","unstructured":"H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, Online construction of subsequence automata for multiple texts, in: Proc. 7th Internat. Symp. String Processing and Information Retrieval, IEEE Computer Society, Silver Spring, MD, 2000, pp. 146\u2013152.","DOI":"10.1109\/SPIRE.2000.878190"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB10","doi-asserted-by":"crossref","unstructured":"L.C.K. Hui, Color set problem with applications to string matching, in: Proc. 3rd Annual Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 644, Springer, Berlin, 1992, pp. 230\u2013243.","DOI":"10.1007\/3-540-56024-6_19"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB11","doi-asserted-by":"crossref","unstructured":"T. Jiang, M. Li, On the complexity of learning strings and sequences, in: Proc. 4th ACM Conf. on Computational Learning Theory, ACM Press, New York, 1991, pp. 367\u2013371.","DOI":"10.1016\/B978-1-55860-213-7.50036-5"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB12","series-title":"Proc. 1st Internat. Conf. on Knowledge Discovery and Data Mining","first-page":"210","author":"Mannila","year":"1995"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB13","unstructured":"S. Miyano, A. Shinohara, T. Shinohara, Which classes of elementary formal systems are polynomial-time learnable? in: Proc. 2nd Workshop on Algorithmic Learning Theory, 1991, pp. 139\u2013150."},{"key":"10.1016\/S0304-3975(02)00182-2_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF03037530","article-title":"Polynomial-time learning of elementary formal systems","volume":"18","author":"Miyano","year":"2000","journal-title":"New Generation Computing"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB15","doi-asserted-by":"crossref","unstructured":"S. Morishita, J. Sese, Traversing itemset lattices with statistical metric pruning, in: Proc. 19th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, ACM Press, New York, 2000, pp. 226\u2013236.","DOI":"10.1145\/335168.335226"},{"issue":"1","key":"10.1016\/S0304-3975(02)00182-2_BIB16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB17","first-page":"182","article-title":"Use of BONSAI decision trees for the identification of potential MHC class I peptide epitope motifs","volume":"4","author":"Savoie","year":"1999","journal-title":"Pacific Symposium on Biocomputing"},{"issue":"10","key":"10.1016\/S0304-3975(02)00182-2_BIB18","first-page":"2009","article-title":"Knowledge acquisition from amino acid sequences by machine learning system BONSAI","volume":"35","author":"Shimozono","year":"1994","journal-title":"Trans. Inform. Process. Soc. Japan"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB19","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","article-title":"Polynomial time inference of extended regular pattern languages","volume":"147","author":"Shinohara","year":"1983","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S0304-3975(02)00182-2_BIB20","unstructured":"M. Tanaka, S. Nakazono, H. Matsuno, H. Tsujimoto, Y. Kitamura, S. Miyano, Intelligent system for topic survey in MEDLINE by keyword recommendation and learning text characteristics, in: Genome Informatics, vol. 11, Universal Academy Press, 2000, pp. 73\u201382."},{"key":"10.1016\/S0304-3975(02)00182-2_BIB21","unstructured":"S. Usuzaka, K. Sim, M. Tanaka, H. Matsuno, S. Miyano, A machine learning approach to reducing the work of experts in article selection from database: a case study for regulatory relations of s. cerevisiae genes in MEDLINE, in: Genome Informatics, vol. 9, Universal Acamemy Press, 1998, pp. 91\u2013101."},{"key":"10.1016\/S0304-3975(02)00182-2_BIB22","doi-asserted-by":"crossref","unstructured":"J.T.L. Wang, G.-W. Chirn, T.G. Marr, B.A. Shapiro, D. Shasha, K. Zhang, Combinatorial pattern discovery for scientific data: some preliminary results, in: Proc. 1994 ACM SIGMOD Internat. Conf. on Management of Data, ACM Press, New York, 1994, pp. 115\u2013125.","DOI":"10.1145\/191839.191863"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001822?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001822?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T02:13:30Z","timestamp":1580868810000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502001822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502001822"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00182-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}