{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:19Z","timestamp":1725544039879},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_10","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"94-105","source":"Crossref","is-referenced-by-count":3,"title":["New Bounds for Motif Finding in Strong Instances"],"prefix":"10.1007","author":[{"given":"Bro\u0148a","family":"Brejov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel G.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian M.","family":"Harrower","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vina\u0159","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11496656_1","volume-title":"Combinatorial Pattern Matching","author":"B. Brejova","year":"2005","unstructured":"Brejova, B., Brown, D.G., Harrower, I.M., Lopez-Ortiz, A., Vinar, T.: Sharper upper and lower bounds for an approximation scheme for Consensus-Pattern. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 1\u201310. Springer, Heidelberg (2005)"},{"issue":"7-8","key":"10_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1093\/bioinformatics\/15.7.563","volume":"15","author":"G.Z. Hertz","year":"1999","unstructured":"Hertz, G.Z., Stormo, G.D.: Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics\u00a015(7-8), 563\u2013577 (1999)","journal-title":"Bioinformatics"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2307\/2282952","volume":"58","author":"W.J. Hoeffding","year":"1963","unstructured":"Hoeffding, W.J.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058, 713\u2013721 (1963)","journal-title":"Journal of the American Statistical Association"},{"issue":"1","key":"10_CR4","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. Journal of Computer and System Sciences\u00a065(1), 73\u201396 (2002)","journal-title":"Journal of Computer and System Sciences"},{"unstructured":"Liang, C.: COPIA: a new software for finding consensus patterns in unaligned protein sequences. Master\u2019s thesis, University of Waterloo (October 2001)","key":"10_CR5"},{"unstructured":"Liu, J.: A combinatorial approach for motif discovery in unaligned DNA sequences. Master\u2019s thesis, University of Waterloo (March 2004)","key":"10_CR6"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic methods for algorithmic discrete mathematics","author":"C. McDiarmid","year":"1998","unstructured":"McDiarmid, C.: Concentration. In: Habib, M. (ed.) Probabilistic methods for algorithmic discrete mathematics, pp. 195\u2013248. Springer, Heidelberg (1998)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"A. Panconesi","year":"1997","unstructured":"Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM Journal on Computing\u00a026, 350\u2013368 (1997)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Pevzner, P.A., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB 2000), pp. 269\u2013278 (2000)","key":"10_CR9"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:11Z","timestamp":1619493371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11780441_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}