{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T06:27:12Z","timestamp":1749104832937},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540464914"},{"type":"electronic","value":"9783540464938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11893318_14","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T10:14:10Z","timestamp":1160388850000},"page":"114-124","source":"Crossref","is-referenced-by-count":1,"title":["A New Family of String Classifiers Based on Local Relatedness"],"prefix":"10.1007","author":[{"given":"Yasuto","family":"Higa","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-49730-7_19","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"1998","unstructured":"Arimura, H., Wataki, A., Fujino, R., Arikawa, S.: A fast algorithm for discovering optimal string patterns in large text databases. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds.) ALT 1998. LNCS (LNAI), vol.\u00a01501, pp. 247\u2013261. Springer, Heidelberg (1998)"},{"key":"14_CR2","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/3-540-45650-3_37","volume-title":"Discovery Science","author":"M. Hirao","year":"2001","unstructured":"Hirao, M., Inenaga, S., Shinohara, A., Takeda, M., Arikawa, S.: A practical algorithm to find the best episode patterns. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol.\u00a02226, pp. 435\u2013440. Springer, Heidelberg (2001)"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/S0304-3975(02)00182-2","volume":"292","author":"M. Hirao","year":"2002","unstructured":"Hirao, M., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.: A practical algorithm to find the best subsequence patterns. Theoretical Computer Science\u00a0292(2), 465\u2013479 (2002)","journal-title":"Theoretical Computer Science"},{"key":"14_CR4","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-45884-0_21","volume-title":"Progress in Discovery Science","author":"A. Shinohara","year":"2002","unstructured":"Shinohara, A., Takeda, M., Arikawa, S., Hirao, M., Hoshino, H., Inenaga, S.: Finding best patterns practically. In: Arikawa, S., Shinohara, A. (eds.) Progress in Discovery Science. LNCS (LNAI), vol.\u00a02281, pp. 307\u2013317. Springer, Heidelberg (2002)"},{"key":"14_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-36182-0_10","volume-title":"Discovery Science","author":"S. Inenaga","year":"2002","unstructured":"Inenaga, S., Bannai, H., Shinohara, A., Takeda, M., Arikawa, S.: Discovering best variable-length-don\u2019t-care patterns. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS (LNAI), vol.\u00a02534, pp. 86\u201397. Springer, Heidelberg (2002)"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"ii206","DOI":"10.1093\/bioinformatics\/btg1079","volume":"19","author":"D. Shinozaki","year":"2003","unstructured":"Shinozaki, D., Akutsu, T., Maruyama, O.: Finding optimal degenerate patterns in DNA sequences. Bioinformatics\u00a019, ii206\u2013ii214 (2003)","journal-title":"Bioinformatics"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J.K. Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation\u00a0185, 41\u201355 (2003)","journal-title":"Information and Computation"},{"key":"14_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-39644-4_50","volume-title":"Discovery Science","author":"M. Takeda","year":"2003","unstructured":"Takeda, M., Inenaga, S., Bannai, H., Shinohara, A., Arikawa, S.: Discovering most classificatory patterns for very expressive pattern classes. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 486\u2013493. Springer, Heidelberg (2003)"},{"key":"14_CR9","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-30219-3_38","volume-title":"Algorithms in Bioinformatics","author":"H. Bannai","year":"2004","unstructured":"Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: Finding optimal pairs of patterns. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 450\u2013462. Springer, Heidelberg (2004)"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/TCBB.2004.36","volume":"1","author":"H. Bannai","year":"2004","unstructured":"Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: An O(N\n                           2) algorithm for discovering optimal Boolean pattern pairs. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a01(4), 159\u2013170 (2004) (special issue for selected papers of WABI 2004).","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"14_CR11","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-30214-8_3","volume-title":"Discovery Science","author":"S. Inenaga","year":"2004","unstructured":"Inenaga, S., Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: Finding optimal pairs of cooperative and competing patterns with bounded distance. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 32\u201346. Springer, Heidelberg (2004)"},{"key":"14_CR12","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-27801-6_13","volume-title":"Combinatorial Pattern Matching","author":"G.M. Landau","year":"2004","unstructured":"Landau, G.M., Myers, E.W., Ziv-Ukelson, M.: Two algorithms for LCS consecutive suffix alignment. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 173\u2013193. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11893318_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:36:14Z","timestamp":1619494574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11893318_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540464914","9783540464938"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11893318_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}