{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:06Z","timestamp":1725565206690},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152931"},{"type":"electronic","value":"9783642152948"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_28","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T08:51:46Z","timestamp":1284108706000},"page":"337-349","source":"Crossref","is-referenced-by-count":2,"title":["Speeding Up Exact Motif Discovery by Bounding the Expected Clump Size"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Marschall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Rahmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M. Tompa","year":"2005","unstructured":"Tompa, M., Li, N., Bailey, T.L., et al.: Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology\u00a023(1), 137\u2013144 (2005)","journal-title":"Nature Biotechnology"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/1745-6150-1-11","volume":"1","author":"G.K. Sandve","year":"2006","unstructured":"Sandve, G.K., Drabl\u00f8s, F.: A survey of motif discovery methods in an integrated framework. Biology Direct\u00a01(1), 11 (2006)","journal-title":"Biology Direct"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Das, M., Dai, H.K.: A survey of DNA motif finding algorithms. BMC Bioinformatics\u00a08(suppl. 7), S21 (2007)","DOI":"10.1186\/1471-2105-8-S7-S21"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1093\/bfgp\/elp014","volume":"8","author":"L. Narlikar","year":"2009","unstructured":"Narlikar, L., Ovcharenko, I.: Identifying regulatory elements in eukaryotic genomes. Briefings in Functional Genomics and Proteomics\u00a08(4), 215\u2013230 (2009)","journal-title":"Briefings in Functional Genomics and Proteomics"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Bailey, T.L., Williams, N., Misleh, C., Li, W.W.: MEME: discovering and analyzing DNA and protein sequence motifs. Nucleic Acids Research\u00a034(suppl.2), W369\u2013W373 (2006)","DOI":"10.1093\/nar\/gkl198"},{"issue":"7-8","key":"28_CR6","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":"28_CR7","first-page":"225","volume-title":"Genetic and Evolutionary Computation Conference (GECCO)","author":"S. Rahmann","year":"2009","unstructured":"Rahmann, S., Marschall, T., Behler, F., Kramer, O.: Modeling evolutionary fitness for DNA motif discovery. In: Rothlauf, F. (ed.) Genetic and Evolutionary Computation Conference (GECCO), Montreal, Qu\u00e9bec, Canada, pp. 225\u2013232. ACM, New York (2009)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BFb0054337","volume-title":"LATIN\u201998: Theoretical Informatics","author":"M.F. Sagot","year":"1998","unstructured":"Sagot, M.F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 374\u2013390. Springer, Heidelberg (1998)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Pavesi, G., Mauri, G., Pesole, G.: An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics\u00a017(suppl. 1), S207\u2013S214 (2001)","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207"},{"key":"28_CR10","unstructured":"Sinha, S., Tompa, M.: A statistical method for finding transcription factor binding sites. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 344\u2013354 (2000)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Marschall, T., Rahmann, S.: Efficient exact motif discovery. Bioinformatics\u00a025(12), i356\u2013i364 (2009)","DOI":"10.1093\/bioinformatics\/btp188"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1186\/1471-2105-8-193","volume":"8","author":"G.K. Sandve","year":"2007","unstructured":"Sandve, G.K., Abul, O., Walseng, V., Drabl\u00f8s, F.: Improved benchmarks for computational motif discovery. BMC Bioinformatics\u00a08, 193 (2007)","journal-title":"BMC Bioinformatics"},{"issue":"2","key":"28_CR13","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0219720006001977","volume":"4","author":"G. Kucherov","year":"2006","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: A unifying framework for seed sensitivity and its application to subset seeds. Journal of Bioinformatics and Computational Biology\u00a04(2), 553\u2013569 (2006)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0304-3975(01)00264-X","volume":"287","author":"P. Nicod\u00e8me","year":"2002","unstructured":"Nicod\u00e8me, P., Salvy, B., Flajolet, P.: Motif statistics. Theoretical Computer Science\u00a0287, 593\u2013617 (2002)","journal-title":"Theoretical Computer Science"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-69068-9_11","volume-title":"Combinatorial Pattern Matching","author":"T. Marschall","year":"2008","unstructured":"Marschall, T., Rahmann, S.: Probabilistic arithmetic automata and their application to pattern matching statistics. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 95\u2013106. Springer, Heidelberg (2008)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1017\/S0021900200004083","volume":"45","author":"G. Nuel","year":"2008","unstructured":"Nuel, G.: Pattern Markov chains: optimal Markov chain embedding through deterministic finite automata. Journal of Applied Probability\u00a045, 226\u2013243 (2008)","journal-title":"Journal of Applied Probability"},{"issue":"6-7","key":"28_CR17","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.dam.2005.07.016","volume":"155","author":"V. Stefanov","year":"2007","unstructured":"Stefanov, V., Robin, S., Schbath, S.: Waiting times for clumps of patterns and for structured motifs in random sequences. Discrete Appl. Math.\u00a0155(6-7), 868\u2013880 (2007)","journal-title":"Discrete Appl. Math."},{"key":"28_CR18","first-page":"1","volume":"1","author":"S. Schbath","year":"1995","unstructured":"Schbath, S.: Compound Poisson approximation of word counts in DNA sequences. ESAIM: Probability and Statistics\u00a01, 1\u201316 (1995)","journal-title":"ESAIM: Probability and Statistics"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1089\/cmb.1998.5.223","volume":"5","author":"G. Reinert","year":"1998","unstructured":"Reinert, G., Schbath, S.: Compound Poisson and Poisson process approximations for occurrences of multiple words in Markov chains. Journal of Computational Biology\u00a05(2), 223\u2013253 (1998)","journal-title":"Journal of Computational Biology"},{"issue":"6","key":"28_CR20","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1089\/cmb.2007.0084","volume":"15","author":"U.J. Pape","year":"2008","unstructured":"Pape, U.J., Rahmann, S., Sun, F., Vingron, M.: Compound Poisson approximation of the number of occurrences of a position frequency matrix (PFM) on both strands. Journal of Computational Biology\u00a015(6), 547\u2013564 (2008)","journal-title":"Journal of Computational Biology"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Bassino, F., Cl\u00e9ment, J., Fayolle, J., Nicod\u00e8me, P.: Constructions for clumps statistics. In: Proceedings of the Fifth Colloquium on Mathematics and Computer Science. Discrete Mathematics and Theoretical Computer Science, pp. 179\u2013194 (2008)","DOI":"10.46298\/dmtcs.3563"},{"key":"28_CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833344","volume-title":"Matrix mathematics","author":"D.S. Bernstein","year":"2009","unstructured":"Bernstein, D.S.: Matrix mathematics, 2nd edn. Princeton University Press, Princeton (2009)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15294-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T11:43:02Z","timestamp":1636458182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}