{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:52:53Z","timestamp":1747806773594,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230182"},{"type":"electronic","value":"9783540302193"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30219-3_38","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T20:42:59Z","timestamp":1285101779000},"page":"450-462","source":"Crossref","is-referenced-by-count":8,"title":["Finding Optimal Pairs of Patterns"],"prefix":"10.1007","author":[{"given":"Hideo","family":"Bannai","sequence":"first","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":"38_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":"38_CR2","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":"38_CR3","series-title":"Lecture Notes in Artificial Intelligence","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":"38_CR4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","volume":"363","author":"E. Eskin","year":"2002","unstructured":"Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in DNA sequences. Bioinformatics\u00a0363, S354\u2013S363 (2002)","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Liu, X., Brutlag, D., Liu, J.: BioProspector: discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes. In: Pac. Symp. Biocomput., pp. 127\u2013138 (2001)","key":"38_CR5","DOI":"10.1142\/9789814447362_0014"},{"key":"38_CR6","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":"38_CR7","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":"38_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":"38_CR9","doi-asserted-by":"publisher","first-page":"206","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, ii 206\u2013ii214 (2003)","journal-title":"Bioinformatics"},{"key":"38_CR10","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":"38_CR11","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"},{"doi-asserted-by":"crossref","unstructured":"Conlon, E.M., Liu, X.S., Lieb, J.D., Liu, J.S.: Integrating regulatory motif discovery and genome-wide expression analysis. In: Proc. Natl. Acad. Sci., vol.\u00a0100, pp. 3339\u20133344 (2003)","key":"38_CR12","DOI":"10.1073\/pnas.0630591100"},{"doi-asserted-by":"crossref","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 (2004) (in press)","key":"38_CR13","DOI":"10.1142\/S0219720004000612"},{"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)","key":"38_CR14","DOI":"10.1007\/978-3-540-32280-1_7"},{"key":"38_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":"38_CR16","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."},{"doi-asserted-by":"crossref","unstructured":"Yang, E., van Nimwegen, E., Zavolan, M., Rajewsky, N., Schroeder, M., Magnasco, M., J.D., Jr.: Decay rates of Human mRNAs: correlation with functional characteristics and sequence attributes. Genome Res.\u00a013, 1863\u20131872 (2003)","key":"38_CR17","DOI":"10.1101\/gr.1272403"},{"key":"38_CR18","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":"38_CR19","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":"38_CR20","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":"38_CR21","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)"},{"unstructured":"Kasai, T., Arimura, H., Arikawa, S.: Efficient substring traversal with suffix arrays. Technical Report 185, Department of Informatics, Kyushu University (2001)","key":"38_CR22"},{"key":"38_CR23","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":"38_CR24","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)"},{"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, pp. 258\u2013264 (2002)","key":"38_CR25","DOI":"10.1145\/564870.564914"},{"key":"38_CR26","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":"38_CR27","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":"38_CR28","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1038\/35067025","volume":"2","author":"C.J. Wilusz","year":"2001","unstructured":"Wilusz, C.J., Wormington, M., Peltz, S.W.: The cap-to-tail guide to mRNA turnover. Nat. Rev. Mol. Cell Biol.\u00a02, 237\u2013246 (2001)","journal-title":"Nat. Rev. Mol. Cell Biol."},{"key":"38_CR29","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":"38_CR30","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."},{"key":"38_CR31","doi-asserted-by":"publisher","first-page":"30995","DOI":"10.1074\/jbc.M010833200","volume":"276","author":"M.J. Ruiz-Echevarria","year":"2001","unstructured":"Ruiz-Echevarria, M.J., Munshi, R., Tomback, J., Kinzy, T.G., Peltz, S.W.: Characterization of a general stabilizer element that blocks deadenylation-dependent mRNA decay. J. Biol. Chem.\u00a0276, 30995\u201331003 (2001)","journal-title":"J. Biol. Chem."},{"key":"38_CR32","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1101\/gr.1645104","volume":"14","author":"A. Kasprzyk","year":"2004","unstructured":"Kasprzyk, A., Keefe, D., Smedley, D., London, D., Spooner, W., Melsopp, C., Hammond, M., Rocca-Serra, P., Cox, T., Birney, E.: EnsMart: A generic system for fast and flexible access to biological data. Genome Research\u00a014, 160\u2013169 (2004)","journal-title":"Genome Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30219-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:47:59Z","timestamp":1740527279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30219-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230182","9783540302193"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30219-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}