{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T23:10:17Z","timestamp":1736032217825,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_19","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"167-178","source":"Crossref","is-referenced-by-count":0,"title":["Composite Pattern Discovery for PCR Application"],"prefix":"10.1007","author":[{"given":"Stanislav","family":"Angelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-30219-3_39","volume-title":"Algorithms in Bioinformatics","author":"S. Inenaga","year":"2004","unstructured":"Inenaga, S., Kivioja, T., M\u00e4kinen, V.: Finding missing patterns. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 463\u2013474. Springer, Heidelberg (2004)"},{"key":"19_CR2","unstructured":"Apostolico, A.: Pattern discovery and the algorithmics of surprise. In: Artificial Intelligence and Heuristic Methods for Bioinformatics, pp. 111\u2013127 (2003)"},{"key":"19_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":"19_CR4","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":"19_CR5","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":"19_CR6","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":"19_CR7","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":"19_CR8","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":"19_CR9","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":"19_CR10","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":"19_CR11","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":"19_CR12","doi-asserted-by":"crossref","first-page":"S354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","volume":"18","author":"E. Eskin","year":"2002","unstructured":"Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in DNA sequences. Bioinformatics\u00a018, S354\u2013S363 (2002)","journal-title":"Bioinformatics"},{"key":"19_CR13","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":"19_CR14","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":"19_CR15","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1142\/9781860947322_0027","volume-title":"Proc. 3rd Asia Pacific Bioinformatics Conference (APBC 2005)","author":"A.M. Carvalho","year":"2005","unstructured":"Carvalho, A.M., Freitas, A.T., Oliveira, A.L., Sagot, M.F.: A highly scalable algorithm for the extraction of cis-regulatory regions. In: Proc. 3rd Asia Pacific Bioinformatics Conference (APBC 2005), pp. 273\u2013282. Imperial College Press, London (2005)"},{"key":"19_CR16","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 word-association patterns in large text databases. New Generation Computing\u00a018, 49\u201360 (2000)","journal-title":"New Generation Computing"},{"key":"19_CR17","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":"19_CR18","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)","DOI":"10.1142\/9789814447362_0014"},{"key":"19_CR19","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 2) algorithm for discovering optimal Boolean pattern pairs. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a01, 159\u2013170 (2004)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"19_CR20","series-title":"Lecture Notes in Artificial Intelligence","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":"19_CR21","volume-title":"Molecular Biology of the Cell","author":"B. Alberts","year":"2002","unstructured":"Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, 4th edn. Garland Science, New York (2002)","edition":"4"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"Karp, R., Rabin, M.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development\u00a031, 249\u2013260 (1987)","journal-title":"IBM Journal of Research and Development"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:46:07Z","timestamp":1736030767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11575832_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}