{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:25:51Z","timestamp":1778581551526,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230182","type":"print"},{"value":"9783540302193","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30219-3_37","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T20:42:59Z","timestamp":1285101779000},"page":"438-449","source":"Crossref","is-referenced-by-count":24,"title":["Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding"],"prefix":"10.1007","author":[{"given":"Sing-Hoi","family":"Sze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songjian","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"Bailey, T.L., Elkan, C.P.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: Proc. of the 2nd Int. Conf. on Intelligent Systems for Mol. Biol (ISMB 1994), pp. 28\u201336 (1994)"},{"key":"37_CR2","volume-title":"Handbook of Combinatorial Optimization","author":"I. Bomze","year":"1999","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol.\u00a04, Kluwer Academic, Dordrecht (1999)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J. Buhler","year":"2002","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. J. Comp. Biol.\u00a09, 225\u2013242 (2002)","journal-title":"J. Comp. Biol."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I., Xia, G.: Linear FPT reductions and computational lower bounds. In: Proc. of the 34th ACM Symp. on Theory of Computing (STOC 2004), pp. 212\u2013221 (2004)","DOI":"10.1145\/1007352.1007391"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Eskin, E.: From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles. In: Proc. of the 8th Ann. Int. Conf. on Comp. Mol. Biol (RECOMB 2004), pp. 115\u2013124 (2004)","DOI":"10.1145\/974614.974630"},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"354","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":"37_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45678-3_38","volume-title":"Algorithms and Computation","author":"J. Gramm","year":"2001","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for closest string and related problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 441\u2013453. Springer, Heidelberg (2001)"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Keich, U., Pevzner, P.A.: Finding motifs in the twilight zone. In: Proc. of the 6th Ann. Int. Conf. on Comp. Mol. Biol (RECOMB 2002), pp. 195\u2013204 (2002)","DOI":"10.1145\/565196.565222"},{"key":"37_CR9","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":"37_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"C.E. Lawrence","year":"1993","unstructured":"Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., Wootton, J.C.: Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science\u00a0262, 208\u2013214 (1993)","journal-title":"Science"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Liang, S.: cWINNOWER algorithm for finding fuzzy DNA motifs. In: Proc. of the 2nd IEEE Computer Society Bioinformatics Conf. (CSB 2003), pp. 260\u2013265 (2003)","DOI":"10.1109\/CSB.2003.1227326"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.1093\/nar\/20.10.2511","volume":"20","author":"A.V. Lukashin","year":"1992","unstructured":"Lukashin, A.V., Engelbrecht, J., Brunak, S.: Multiple alignment using simulated annealing: branch point definition in human mRNA splicing. Nucleic Acids Res\u00a020, 2511\u20132516 (1992)","journal-title":"Nucleic Acids Res"},{"key":"37_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. Comp. Biol.\u00a07, 345\u2013362 (2000)","journal-title":"J. Comp. Biol."},{"key":"37_CR14","unstructured":"Pevzner, P.A., Sze, S.-H.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. of the 8th Int. Conf. on Intelligent Systems for Mol. Biol. (ISMB 2000), pp. 269\u2013278 (2000)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Price, A., Ramabhadran, S., Pevzner, P.A.: Finding subtle motifs by branching from sample strings. Bioinformatics, SII149\u2013155 (2003)","DOI":"10.1093\/bioinformatics\/btg1072"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1073\/pnas.86.4.1183","volume":"86","author":"G.D. Stormo","year":"1989","unstructured":"Stormo, G.D., Hartzell, G.W.: Identifying protein-binding sites from unaligned DNA fragments. Proc. Natl. Acad. Sci. USA\u00a086, 1183\u20131187 (1989)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Sze, S.-H., Gelfand, M.S., Pevzner, P.A.: Finding weak motifs in DNA sequences. In: Pac. Symp. Biocomput (PSB 2002), pp. 235\u2013246 (2002)","DOI":"10.1142\/9789812799623_0022"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30219-3_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:24Z","timestamp":1605761424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30219-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230182","9783540302193"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30219-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}