{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:01Z","timestamp":1725566341430},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233572"},{"type":"electronic","value":"9783540302148"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30214-8_3","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:19:01Z","timestamp":1285096741000},"page":"32-46","source":"Crossref","is-referenced-by-count":8,"title":["Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance"],"prefix":"10.1007","author":[{"given":"Shunsuke","family":"Inenaga","sequence":"first","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Heikki","family":"Hyyr\u00f6","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"Kenta","family":"Nakai","sequence":"additional","affiliation":[]},{"given":"Satoru","family":"Miyano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","first-page":"2009","volume":"35","author":"S. Shimozono","year":"1994","unstructured":"Shimozono, S., Shinohara, A., Shinohara, T., Miyano, S., Kuhara, S., Arikawa, S.: Knowledge acquisition from amino acid sequences by machine learning system BONSAI. Transactions of Information Processing Society of Japan\u00a035, 2009\u20132018 (1994)","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"3_CR2","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":"3_CR3","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":"Baeza-Yates, R.A.: Searching subsequences (note). Theoretical Computer Science\u00a078, 363\u2013376 (1991)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-44418-1_12","volume-title":"Discovery Science","author":"M. Hirao","year":"2000","unstructured":"Hirao, M., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.: A practical algorithm to find the best subsequence patterns. In: Morishita, S., Arikawa, S. (eds.) DS 2000. LNCS (LNAI), vol.\u00a01967, pp. 141\u2013154. Springer, Heidelberg (2000)"},{"key":"3_CR5","first-page":"210","volume-title":"Proc. 1st International Conference on Knowledge Discovery and Data Mining","author":"H. Mannila","year":"1995","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering frequent episode in sequences. In: Proc. 1st International Conference on Knowledge Discovery and Data Mining, pp. 210\u2013215. AAAI Press, Menlo Park (1995)"},{"key":"3_CR6","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":"3_CR7","series-title":"Lecture Notes in Computer Science","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, vol.\u00a02534, pp. 86\u201397. Springer, Heidelberg (2002)"},{"key":"3_CR8","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":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bannai, H., Hyyr\u00f6, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: Finding optimal pairs of patterns. In: Proc. 4th Workshop on Algorithms in Bioinformatics, WABI 2004 (2004) (to appear)","DOI":"10.1007\/978-3-540-30219-3_38"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1089\/106652700750050826","volume":"7","author":"L. Marsan","year":"2000","unstructured":"Marsan, L., Sagot, M.F.: Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J. Comput. Biol.\u00a07, 345\u2013360 (2000)","journal-title":"J. Comput. Biol."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-36182-0_6","volume-title":"Discovery Science","author":"L. Palopoli","year":"2002","unstructured":"Palopoli, L., Terracina, G.: Discovering frequent structured patterns from string databases: an application to biological sequences. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol.\u00a02534, pp. 34\u201346. Springer, Heidelberg (2002)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"H. Arimura","year":"2000","unstructured":"Arimura, H., Arikawa, S., Shimozono, S.: Efficient discovery of optimal wordassociation patterns in large text databases. New Generation Computing\u00a018, 49\u201360 (2000)","journal-title":"New Generation Computing"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-48194-X_14","volume-title":"Combinatorial Pattern Matching","author":"H. Arimura","year":"2001","unstructured":"Arimura, H., Asaka, H., Sakamoto, H., Arikawa, S.: Efficient discovery of proximity patterns with suffix arrays (extended abstract). In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 152\u2013156. Springer, Heidelberg (2001)"},{"key":"3_CR14","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":"3_CR15","doi-asserted-by":"crossref","first-page":"206ii","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, 206ii\u2013214ii (2003)","journal-title":"Bioinformatics"},{"key":"3_CR16","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":"3_CR17","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":"3_CR18","doi-asserted-by":"publisher","first-page":"3339","DOI":"10.1073\/pnas.0630591100","volume":"100","author":"E.M. Conlon","year":"2003","unstructured":"Conlon, E.M., Liu, X.S., Lieb, J.D., Liu, J.S.: Integrating regulatory motif discovery and genome-wide expression analysis. Proc. Natl. Acad. Sci.\u00a0100, 3339\u20133344 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"3_CR19","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":"3_CR20","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":"3_CR21","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/PL00009260","volume":"23","author":"A. Andersson","year":"1999","unstructured":"Andersson, A., Larsson, N.J., Swanson, K.: Suffix trees on words. Algorithmica\u00a023, 246\u2013260 (1999)","journal-title":"Algorithmica"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4nen","year":"1996","unstructured":"K\u00e4rkk\u00e4nen, J., Ukkonen, E.: Sparse suffix trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 219\u2013230. Springer, Heidelberg (1996)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing\u00a022, 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Inenaga, S., Kivioja, T., M\u00e4kinen, V.: Finding missing patterns. In: Proc. 4th Workshop on Algorithms in Bioinformatics, WABI 2004 (2004) (to appear)","DOI":"10.1007\/978-3-540-30219-3_39"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.K. Kim","year":"2003","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"3_CR28","unstructured":"Kasai, T., Arimura, H., Arikawa, S.: Efficient substring traversal with suffix arrays. Technical Report 185, Department of Informatics, Kyushu University (2001)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-45784-4_35","volume-title":"Algorithms in Bioinformatics","author":"M.I. Abouelhoda","year":"2002","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: The enhanced suffix array and its applications to genome analysis. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 449\u2013463. Springer, Heidelberg (2002)"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new distributed algorithm. In: 14th annual ACM symposium on Parallel algorithms and architectures (SPAA 2002), pp. 258\u2013264 (2002)","DOI":"10.1145\/564870.564914"},{"key":"3_CR32","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":"3_CR33","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014, 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"3_CR34","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 longestcommon- 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":"3_CR35","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0168-9525(03)00196-3","volume":"19","author":"J. Graber","year":"2003","unstructured":"Graber, J.: Variations in yeast 3\u2019-processing cis-elements correlate with transcript stability. Trends Genet\u00a019, 473\u2013476 (2003), http:\/\/harlequin.jax.org\/yeast\/turnover\/","journal-title":"Trends Genet"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"5860","DOI":"10.1073\/pnas.092538799","volume":"99","author":"Y. Wang","year":"2002","unstructured":"Wang, Y., Liu, C., Storey, J., Tibshirani, R., Herschlag, D., Brown, P.: Precision and functional specificity in mRNA decay. Proc. Natl. Acad. Sci.\u00a099, 5860\u20135865 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S0168-9525(01)02616-6","volume":"18","author":"M. Wickens","year":"2002","unstructured":"Wickens, M., Bernstein, D.S., Kimble, J., Parker, R.: A PUF family portrait: 3\u2019UTR regulation as a way of life. Trends Genet\u00a018, 150\u2013157 (2002)","journal-title":"Trends Genet"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30214-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:49:48Z","timestamp":1605761388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30214-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233572","9783540302148"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30214-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}
