{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:17Z","timestamp":1725550577444},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292302"},{"type":"electronic","value":"9783540316985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11563983_6","type":"book-chapter","created":{"date-parts":[[2005,10,22]],"date-time":"2005-10-22T04:50:07Z","timestamp":1129956607000},"page":"44-56","source":"Crossref","is-referenced-by-count":1,"title":["Practical Algorithms for Pattern Based Linear Regression"],"prefix":"10.1007","author":[{"given":"Hideo","family":"Bannai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1089\/cmb.1998.5.279","volume":"5","author":"A. Brazma","year":"1998","unstructured":"Brazma, A., Jonassen, I., Eidhammer, I., Gilbert, D.: Approaches to the automatic discovery of patterns in biosequences. J. Comput. Biol.\u00a05, 279\u2013305 (1998)","journal-title":"J. Comput. Biol."},{"key":"6_CR2","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, 465\u2013479 (2002)","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","series-title":"Lecture Notes in Artificial Intelligence","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":"6_CR4","series-title":"Lecture Notes in Artificial Intelligence","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":"6_CR5","series-title":"Lecture Notes in Artificial Intelligence","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)"},{"key":"6_CR6","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":"6_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1038\/84792","volume":"27","author":"H.J. Bussemaker","year":"2001","unstructured":"Bussemaker, H.J., Li, H., Siggia, E.D.: Regulatory element detection using correlation with expression. Nature Genetics\u00a027, 167\u2013171 (2001)","journal-title":"Nature Genetics"},{"key":"6_CR8","first-page":"3","volume":"13","author":"H. Bannai","year":"2002","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M., Miyano, S.: A string pattern regression algorithm and its application to pattern discovery in long introns. Genome Informatics\u00a013, 3\u201311 (2002)","journal-title":"Genome Informatics"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1142\/S0219720004000612","volume":"2","author":"H. Bannai","year":"2004","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M., Miyano, S.: Efficiently finding regulatory elements using correlation with gene expression. Journal of Bioinformatics and Computational Biology\u00a02, 273\u2013288 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Zilberstein, C.B.Z., Eskin, E., Yakhini, Z.: Using expression data to discover RNA and DNA regulatory sequence motifs. In: The First Annual RECOMB Satellite Workshop on Regulatory Genomics (2004)","DOI":"10.1007\/978-3-540-32280-1_7"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: An O(N2) algorithm for discovering optimal Boolean pattern pairs. IEEE\/ACM Transactions on Computational Biology and Bioinformatics 1, 159\u2013170 (special issue for selected papers of WABI 2004)","DOI":"10.1109\/TCBB.2004.36"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","first-page":"230","volume-title":"Combinatorial Pattern Matching","author":"L. Hui","year":"1992","unstructured":"Hui, L.: Color set size problem with applications to string matching. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 230\u2013243. Springer, Heidelberg (1992)"},{"key":"6_CR13","unstructured":"Miyano, S., Shinohara, A., Shinohara, T.: Which classes of elementary formal systems are polynomial-time learnable? In: Proceedings of the 2nd Workshop on Algorithmic Learning Theory, pp. 139\u2013150 (1991)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF03037530","volume":"18","author":"S. Miyano","year":"2000","unstructured":"Miyano, S., Shinohara, A., Shinohara, T.: Polynomial-time learning of elementary formal systems. New Generation Computing\u00a018, 217\u2013242 (2000)","journal-title":"New Generation Computing"},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal on Computing\u00a06, 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"6_CR18","unstructured":"Kasai, T., Arimura, H., Arikawa, S.: Efficient substring traversal with suffix arrays. Technical Report 185, Department of Informatics, Kyushu University (2001)"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1091\/mbc.9.12.3273","volume":"9","author":"P.T. Spellman","year":"1998","unstructured":"Spellman, P.T., Sherlock, G., Zhang, M.Q., Iyer, V.R., Anders, K., Eisen, M.B., Brown, P.O., Botstein, D., Futcher, B.: Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization. Mol. Biol. Cell 9, 3273\u20133297 (1998)","journal-title":"Mol. Biol. Cell"},{"key":"6_CR20","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 19, ii206\u2013ii214 (2003)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11563983_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:52:42Z","timestamp":1605624762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11563983_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292302","9783540316985"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11563983_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}