{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:26Z","timestamp":1725544046199},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_13","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T11:02:51Z","timestamp":1151665371000},"page":"129-140","source":"Crossref","is-referenced-by-count":2,"title":["Common Substrings in Random Strings"],"prefix":"10.1007","author":[{"given":"Eric","family":"Blais","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Blanchette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215, 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S.F. Altschul","year":"1997","unstructured":"Altschul, S.F., Madden, T.L., Schaffer, A.A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research\u00a025, 3389\u20133402 (1997)","journal-title":"Nucleic Acids Research"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0001-8708(85)90003-9","volume":"55","author":"R. Arratia","year":"1985","unstructured":"Arratia, R., Waterman, M.S.: An Erd\u0151s-R\u00e9nyi law with shifts. Advances in Mathematics\u00a055, 13\u201323 (1985)","journal-title":"Advances in Mathematics"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1214\/aop\/1176992808","volume":"13","author":"R. Arratia","year":"1985","unstructured":"Arratia, R., Waterman, M.S.: Critical Phenomena in sequence matching. The Annals of Probability\u00a013, 1236\u20131249 (1985)","journal-title":"The Annals of Probability"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Blais, E.: Computing Probabilities for Common Substrings in Random Strings. M.Sc. Thesis, McGill University (2006)","DOI":"10.1007\/11780441_13"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02795493","volume":"22","author":"P. Erd\u0151s","year":"1970","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On a new law of large numbers. Journal d\u2019Analyse Math\u00e9matique\u00a022, 103\u2013111 (1970)","journal-title":"Journal d\u2019Analyse Math\u00e9matique"},{"key":"13_CR7","first-page":"219","volume":"16","author":"P. Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., R\u00e9v\u00e9sz, P.: On the length of the longest head run. Topics in Information Theory. Coll. Math. Soc. J\u00e1nos Bolyai\u00a016, 219\u2013228 (1975)","journal-title":"Coll. Math. Soc. J\u00e1nos Bolyai"},{"key":"13_CR8","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and its Applications, 3rd edn., vol.\u00a01. John Wiley & Sons, Chichester (1968)","edition":"3"},{"key":"13_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2553-7","volume-title":"Monte Carlo: Concepts, Algorithms, and Apps","author":"G.S. Fishman","year":"1996","unstructured":"Fishman, G.S.: Monte Carlo: Concepts, Algorithms, and Apps. Springer, Heidelberg (1996)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"L.J. Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. Journal of Combinatorial Theory, Series A\u00a030, 183\u2013208 (1981)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"13_CR11","volume-title":"Graphical Enumeration","author":"F. Harary","year":"1973","unstructured":"Harary, F.: Graphical Enumeration. Academic Press, London (1973)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1214\/aop\/1176991772","volume":"16","author":"S. Karlin","year":"1988","unstructured":"Karlin, S., Ost, F.: Maximal length of common words among random letter sequences. The Annals of Probability\u00a016, 535\u2013563 (1988)","journal-title":"The Annals of Probability"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1093\/bioinformatics\/14.3.290","volume":"14","author":"B. Morgenstern","year":"1998","unstructured":"Morgenstern, B., Frech, K., Dress, A., Werner, T.: DIALIGN: Finding local similarities by multiple sequence alignment. Bioinformatics\u00a014, 290\u2013294 (1998)","journal-title":"Bioinformatics"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/BF02459461","volume":"59","author":"J. Naus","year":"1997","unstructured":"Naus, J., Sheng, K.-N.: Matching among multiple random sequences. Bulletin of Mathematical Biology\u00a059, 483\u2013496 (1997)","journal-title":"Bulletin of Mathematical Biology"},{"key":"13_CR15","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":"13_CR16","volume-title":"Combinatorial Algorithms for Computers and Calculators","author":"A. Nijenhuis","year":"1978","unstructured":"Nijenhuis, A., Wilf, H.: Combinatorial Algorithms for Computers and Calculators. Academic Press, London (1978)"},{"key":"13_CR17","unstructured":"Pevzner, P.A., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. 8th Inter. Conf. on Int. Sys. for Mol. Biol., pp. 269\u2013278 (2000)"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(00)00195-5","volume":"104","author":"M. R\u00e9gnier","year":"2000","unstructured":"R\u00e9gnier, M.: A unified approach to word occurrence probabilities. Discrete Applied Mathematics\u00a0104, 259\u2013280 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/PL00009244","volume":"22","author":"M. R\u00e9gnier","year":"1998","unstructured":"R\u00e9gnier, M., Szpankowski, W.: On pattern frequency occurrences in a Markovian sequence. Algorithmica\u00a022, 631\u2013649 (1998)","journal-title":"Algorithmica"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"5549","DOI":"10.1093\/nar\/gkf669","volume":"30","author":"S. Sinha","year":"2002","unstructured":"Sinha, S., Tompa, M.: Discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Research\u00a030, 5549\u20135560 (2002)","journal-title":"Nucleic Acids Research"},{"key":"13_CR21","first-page":"203","volume":"28","author":"T. Aardenne-Ehrenfest van","year":"1951","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin\u00a028, 203\u2013217 (1951)","journal-title":"Simon Stevin"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1006\/jmbi.1998.1947","volume":"281","author":"J. Helden van","year":"1998","unstructured":"van Helden, J., Andr\u00e9, B., Collado-Vides, J.: Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. Journal of Molecular Biology\u00a0281, 827\u2013842 (1998)","journal-title":"Journal of Molecular Biology"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:12Z","timestamp":1619493372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11780441_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}