{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:13:00Z","timestamp":1773274380336,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4733,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0166-218x(00)00195-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:13:06Z","timestamp":1027617186000},"page":"259-280","source":"Crossref","is-referenced-by-count":51,"title":["A unified approach to word occurrence probabilities"],"prefix":"10.1016","volume":"104","author":[{"given":"Mireille","family":"R\u00e9gnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0166-218X(00)00195-5_BIB1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0097-8485(93)85009-2","article-title":"Repetitive DNA sequences: some considerations for simple sequence repeats","volume":"17","author":"Bell","year":"1993","journal-title":"Comput. Chem."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/eujc.1993.1030","article-title":"The distribution of subwords counts is usually normal","volume":"14","author":"Bender","year":"1993","journal-title":"European J. Combin."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB3","doi-asserted-by":"crossref","unstructured":"G. Benson, An algorithm for finding tandem repeats of unspecified pattern size, RECOMB\u201998, ACM 1998. Proceedings of the RECOMB\u201998, New York, 1998, pp. 20\u201329.","DOI":"10.1145\/279069.279079"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB4","doi-asserted-by":"crossref","first-page":"739","DOI":"10.2307\/1427415","article-title":"A note on repeated sequences in Markov chains","volume":"19","author":"Biggins","year":"1987","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB5","first-page":"433","article-title":"First and second moments of counts of words in random texts generated by Markov chains","volume":"8","author":"Borodovsky","year":"1992","journal-title":"CABIOS"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.2307\/3213763","article-title":"Renewal theory for several patterns","volume":"22","author":"Breen","year":"1985","journal-title":"J. Appl. Probab."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/07391102.1986.10507643","article-title":"Linguistics of nucleotide sequences: Morphology and comparison of vocabularies","volume":"4","author":"Brendel","year":"1986","journal-title":"J. Biomol. Struct. Dyn."},{"issue":"3","key":"10.1016\/S0166-218X(00)00195-5_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0097-8485(96)80003-9","article-title":"A flexible motif search technique based on generalized profiles","volume":"18","author":"Bucher","year":"1996","journal-title":"Comput. Chem."},{"issue":"3","key":"10.1016\/S0166-218X(00)00195-5_BIB9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0097-8485(94)85024-0","article-title":"Some useful statistical properties of position-weight matrice","volume":"18","author":"Claverie","year":"1994","journal-title":"Comput. Chem."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB10","unstructured":"E. Coward, Word occurrence probabilities and repetetive regions in DNA sequences, Proceedings of the MABS\u201997, Rouen, August 97, 1997."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB11","series-title":"An Introduction to Probability Theory and Its Applications, Vol. 1","author":"Feller","year":"1968"},{"issue":"1","key":"10.1016\/S0166-218X(00)00195-5_BIB12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0097-8485(96)80012-X","article-title":"The gene identification problem: an overview for developers","volume":"20","author":"Fickett","year":"1996","journal-title":"Comput. Chem."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB13","series-title":"Analysis of Algorithms","author":"Flajolet","year":"1995"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1089\/cmb.1995.2.87","article-title":"Prediction of function in DNA sequence analysis","volume":"2","author":"Gelfand","year":"1995","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/2532033","article-title":"The distribution of the frequency of occurrence of nucleotide subsequences, based on their overlap capability","volume":"45","author":"Gentleman","year":"1989","journal-title":"Biometrics"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB16","doi-asserted-by":"crossref","first-page":"877","DOI":"10.2307\/3215201","article-title":"Compound Poisson approximations for word patterns under Markovian hypotheses","volume":"32","author":"Geske","year":"1995","journal-title":"J. Appl. Probab."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","article-title":"String overlaps, pattern matching and nontransitive games","volume":"A 30","author":"Guibas","year":"1981","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB18","article-title":"Distan-a program which detects significant distances between short oligonucleotides","volume":"3","author":"Konopka","year":"1987","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB19","series-title":"Estimating the probability of approximate matches, CPM\u201997","author":"Kurtz","year":"1997"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB20","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1214\/aop\/1176994578","article-title":"A martingale approach to the study of occurrences of sequence patterns in repeated experiments","volume":"8","author":"Li","year":"1980","journal-title":"Ann. Probab."},{"issue":"4","key":"10.1016\/S0166-218X(00)00195-5_BIB21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0097-8485(97)00022-3","article-title":"The study of correlation structures of DNA sequences: a critical review","volume":"21","author":"Li","year":"1997","journal-title":"Comput. Chem."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB22","unstructured":"R. Lundstrom, Stochastic models and statistical methods for DNA sequence data, Ph.D. thesis, University of Utah, 1990."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB23","first-page":"223","article-title":"Recognition of characteristic patterns in sets of functionally equivalent DNA sequences","volume":"3","author":"Mengeritzky","year":"1987","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB24","doi-asserted-by":"crossref","unstructured":"P. Nicod\u00e8me, B. Salvy, P. Flajolet, Motif statistics, in: ESA\u201999, Proceedings of the European Symposium on Algorithms-ESA\u201999, Prague, Lecture Notes in Computer Science, Vol. 1643, Springer, Berlin, 1999, pp. 194\u2013211.","DOI":"10.1007\/3-540-48481-7_18"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB25","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1080\/07391102.1989.10506528","article-title":"Linguistic of nucleotide sequences: the significance of deviations from the mean: statistical characteristics and prediction of the frequency of occurrences of words","volume":"6","author":"Pevzner","year":"1991","journal-title":"J. Biomol. Struct. Dyn."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB26","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.2517-6161.1995.tb02025.x","article-title":"Finding words with unexpected frequencies in DNA sequences","volume":"57","author":"Prum","year":"1995","journal-title":"J. Roy. Statist. Soc. B"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB27","unstructured":"M. R\u00e9gnier, Efficient computation of unusual words expectation, presented at WORDS\u201999, 1999."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB28","doi-asserted-by":"crossref","unstructured":"M. R\u00e9gnier, W. Szpankowski, On pattern frequency occurrences in a Markovian sequence, Algorithmica 22(4) (1997) 631\u2013649, preliminary draft at ISIT\u201997.","DOI":"10.1007\/PL00009244"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB29","doi-asserted-by":"crossref","unstructured":"M. R\u00e9gnier, W. Szpankowski, On the approximate pattern occurrences in a text, in: Proceedings of Compression and Complexity of SEQUENCES 1997, Positano, Italy, IEEE Computer Society, Silver Spring, MD, 1997, pp. 253\u2013264.","DOI":"10.1109\/SEQUEN.1997.666920"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB30","unstructured":"S. Schbath, Etude Asymptotique du Nombre d'Occurrences d'un mot dans une Chaine de Markov et Application \u00e0 la Recherche de Mots de Frequence Exceptionnelle dans les Sequences d'ADN, Th\u00e8se de 3e cycle, Universit\u00e9 de Paris V, 1995."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB31","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0022-5193(81)90274-5","article-title":"The coding function of nucleotide sequences can be discerned by statistical analysis","volume":"88","author":"Shulman","year":"1981","journal-title":"J. Theoret. Biol."},{"issue":"1","key":"10.1016\/S0166-218X(00)00195-5_BIB32","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1089\/cmb.1997.4.35","article-title":"Central limit theorem for renewal theory for several patterns","volume":"4","author":"Tanushev","year":"1997","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0166-218X(00)00195-5_BIB33","series-title":"Introduction to Computational Biology","author":"Waterman","year":"1995"},{"key":"10.1016\/S0166-218X(00)00195-5_BIB34","series-title":"Computer Methods for Macromolecular Sequence Analysis","first-page":"554","article-title":"Analysis of compositionally biased regions in sequence databases","volume":"Vol. 266","author":"Wootton","year":"1996"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001955?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001955?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T18:02:50Z","timestamp":1733335370000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0166218X00001955"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00195-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}