{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T18:46:24Z","timestamp":1774377984356,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540890966","type":"print"},{"value":"9783540890973","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89097-3_26","type":"book-chapter","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T11:16:29Z","timestamp":1226315789000},"page":"269-281","source":"Crossref","is-referenced-by-count":14,"title":["On the Structure of Small Motif Recognition Instances"],"prefix":"10.1007","author":[{"given":"Christina","family":"Boucher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel G.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11496656_1","volume-title":"Combinatorial Pattern Matching","author":"B. Brejov\u00e1","year":"2005","unstructured":"Brejov\u00e1, B., Brown, D., Harrower, I., L\u00f3pez\u2013Ortiz, A., Vina\u0159, T.: Sharper upper and lower bounds for an approximation scheme for Consensus\u2013Pattern. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005, vol.\u00a03537, pp. 1\u201310. Springer, Heidelberg (2005)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/11780441_10","volume-title":"Combinatorial Pattern Matching","author":"B. Brejov\u00e1","year":"2006","unstructured":"Brejov\u00e1, B., Brown, D., Harrower, I., Vina\u0159, T.: New bounds for motif-finding in strong instances. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 94\u2013105. Springer, Heidelberg (2006)"},{"issue":"5","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/18.623161","volume":"43","author":"G. Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Sole, P.: Long packing and covering codes. IEEE Trans. Inf. Theory\u00a043(5), 1617\u20131619 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00493-006-0011-4","volume":"26","author":"M. Fellows","year":"2006","unstructured":"Fellows, M., Gramm, J., Niedermeier, R.: On the parameterized intractability of motif search problems. Combinatorica\u00a026(2), 141\u2013167 (2006)","journal-title":"Combinatorica"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Th. Comp. Sys.\u00a030, 113\u2013119 (1997)","journal-title":"Th. Comp. Sys."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"31","author":"R.L. Graham","year":"1985","unstructured":"Graham, R.L., Sloane, N.J.A.: On the covering radius of codes. Trans. Inf. Theory\u00a031, 385\u2013401 (1985)","journal-title":"Trans. Inf. Theory"},{"key":"26_CR7","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, vol.\u00a02223, pp. 441\u2013453. Springer, Heidelberg (2001)"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica\u00a037(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00224-004-1185-z","volume":"39","author":"J. Gramm","year":"2006","unstructured":"Gramm, J., Guo, J., Niedermeier, R.: Parameterized intractability of distinguishing substring selection. Th. Comp. Sys.\u00a039(4), 545\u2013560 (2006)","journal-title":"Th. Comp. Sys."},{"key":"26_CR10","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: Proc. SODA 1999, pp. 633\u2013642 (1999)"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"W.H. Lenstra","year":"1983","unstructured":"Lenstra, W.H.: Integer programming with a fixed number of variables. Math. of OR\u00a08, 538\u2013548 (1983)","journal-title":"Math. of OR"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. J. Comp. and Sys. Sci.\u00a065(1), 73\u201396 (2002)","journal-title":"J. Comp. and Sys. Sci."},{"key":"26_CR13","unstructured":"Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. ISMB 2000, pp. 344\u2013354 (2000)"},{"key":"26_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30219-3_37","volume-title":"Algorithms in Bioinformatics","author":"S. Sze","year":"2004","unstructured":"Sze, S., Lu, S., Chen, J.: Integrating sample-driven and patter-driven approaches in motif finding. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 438\u2013449. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89097-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T01:08:20Z","timestamp":1551661700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89097-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540890966","9783540890973"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89097-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}