{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:57Z","timestamp":1742912157362,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_24","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"224-237","source":"Crossref","is-referenced-by-count":5,"title":["Pattern Matching Statistics on Correlated Sources"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Bourdon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Bourdon, J., Vall\u00e9e, B.: Generalized pattern matching statistics. In: Birkhauser, T.i.M. (ed.): Mathematics and Computer Science II, pp. 249\u2013265 (2002)","DOI":"10.1007\/978-3-0348-8211-8_15"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.10015","volume":"19","author":"J. Bourdon","year":"2001","unstructured":"Bourdon, J.: Size and path length of Patricia tries: dynamical sources context. Random Structures Algorithms\u00a019, 289\u2013315 (2001)","journal-title":"Random Structures Algorithms"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/eujc.1993.1030","volume":"14","author":"E. Bender","year":"1993","unstructured":"Bender, E., Kochman, F.: The distribution of subword counts is usually normal. European Journal of Combinatorics\u00a014, 265\u2013275 (1993)","journal-title":"European Journal of Combinatorics"},{"key":"24_CR4","unstructured":"Chazal, F., Maume-Deschamps, V., Vall\u00e9e, B.: Syst\u2018emes dynamiques et algorithmique. INRIA Research Report 5003, pp. 121\u2013150 (2003)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02679623","volume":"29","author":"J. Cl\u00e9ment","year":"2001","unstructured":"Cl\u00e9ment, J., Flajolet, P., Vall\u00e9e, B.: Dynamical sources in information theory: a general analysis of trie structures. Algorithmica\u00a029, 307\u2013369 (2001)","journal-title":"Algorithmica"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Szpankowski, W., Vall\u00e9e, B.: Hidden word statistics. Journal de l\u2019ACM (2005) (to appear)","DOI":"10.1145\/1120582.1120586"},{"key":"24_CR7","unstructured":"Hwang, H.K.: Th\u00e9or\u00e9mes limites pour les structures combinatoires et les fonctions arithm\u00e9tiques. PhD thesis, Ecole Polytechnique, Palaiseau, France (1994)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1093\/bioinformatics\/18.suppl_2.S161","volume":"18","author":"P. Nicod\u00e9me","year":"2002","unstructured":"Nicod\u00e9me, P., Doerks, T., Vingron, M.: Proteome analysis based on motif statistics. Bioinformatics\u00a018, 161\u2013171 (2002)","journal-title":"Bioinformatics"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0304-3975(01)00264-X","volume":"287","author":"P. Nicod\u00e9me","year":"2002","unstructured":"Nicod\u00e9me, P., Salvy, B., Flajolet, P.: Motif statistics. Theoretical Computer Science\u00a0287, 593\u2013617 (2002)","journal-title":"Theoretical Computer Science"},{"key":"24_CR10","first-page":"253","volume-title":"Proc. SEQUENCE 1997","author":"M. R\u00e9gnier","year":"1997","unstructured":"R\u00e9gnier, M., Szpankowski, W.: On the approximate pattern occurrences in a text. In: Proc. SEQUENCE 1997, pp. 253\u2013264. IEEE Computer Society, Los Alamitos (1997)"},{"key":"24_CR11","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":"24_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/mben.2000.0151","volume":"2","author":"I. Rigoutsos","year":"2000","unstructured":"Rigoutsos, I., Floratos, A., Parida, L., Gao, Y., Platt, D.: The emergence of pattern discovery techniques in computational biology. J. of Met. Eng.\u00a02, 159\u2013177 (2000)","journal-title":"J. of Met. Eng."},{"key":"24_CR13","first-page":"492","volume-title":"An introduction to the analysis of algorithms. Foreword by D.E. Knuth","author":"R. Sedgewick","year":"1996","unstructured":"Sedgewick, R., Flajolet, P.: An introduction to the analysis of algorithms. Foreword by Knuth, D.E., vol.\u00a0xv, p. 492. Addison-Wesley, Amsterdam (1996)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Szpankowski, W.: Average case analysis of algorithms on sequences. Wiley-Interscience Series in Discrete Mathematics and Optimization (2001)","DOI":"10.1002\/9781118032770"},{"key":"24_CR15","unstructured":"Vall\u00e9e, B.: Euclidean Dynamics to appear in Discrete and Continuous Dynamical Systems (2005), \n                    \n                      www.info.unicaen.fr\/~brigitte"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/BF02679622","volume":"29","author":"B. Vall\u00e9e","year":"2001","unstructured":"Vall\u00e9e, B.: Dynamical sources in information theory: fundamental intervals and word prefixes. Algorithmica\u00a029, 262\u2013306 (2001)","journal-title":"Algorithmica"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/S0923-2508(99)00115-1","volume":"150","author":"A. Vanet","year":"1999","unstructured":"Vanet, A., Marsan, L., Sagot, M.F.: Promoter sequences and algorithmical methods for identifying them. Research in Microbiology\u00a0150, 779\u2013799 (1999)","journal-title":"Research in Microbiology"},{"key":"24_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to Computational Biology","author":"M.S. Waterman","year":"1995","unstructured":"Waterman, M.S.: Introduction to Computational Biology. Chapman & Hall, Boca Raton (1995)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:37:46Z","timestamp":1558273066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11682462_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}