Displaying similar documents to “Compound Poisson approximation of word counts in DNA sequences”

Return words in Sturmian and episturmian words

Jacques Justin, Laurent Vuillon (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Considering each occurrence of a word in a recurrent infinite word, we define the set of return words of to be the set of all distinct words beginning with an occurrence of and ending exactly just before the next occurrence of in the infinite word. We give a simpler proof of the recent result (of the second author) that an infinite word is Sturmian if and only if each of its factors has exactly two return words in it. Then, considering episturmian infinite words, which are a natural generalization...

Segmentation of the Poisson and negative binomial rate models: a penalized estimator

Alice Cleynen, Emilie Lebarbier (2014)

ESAIM: Probability and Statistics

Similarity:

We consider the segmentation problem of Poisson and negative binomial (overdispersed Poisson) rate distributions. In segmentation, an important issue remains the choice of the number of segments. To this end, we propose a penalized -likelihood estimator where the penalty function is constructed in a non-asymptotic context following the works of L. Birgé and P. Massart. The resulting estimator is proved to satisfy an oracle inequality. The performances of our criterion is assessed using...