We give a probabilistic analysis of parameters related to alpha-gapped repeats and palindromes in random words, under both uniform and memoryless distributions (where letters have different probabilities, but are drawn independently). More precisely, we study the expected number of maximal alpha-gapped patterns, as well as the expected length of the longest alpha-gapped pattern in a random word
International audienceGiven a set of words and a probability model for random texts, we are interest...
Abstract. We consider the sequence comparison problem, also known as “hidden ” pattern problem, wher...
This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent fac...
International audienceWe give a probabilistic analysis of parameters related to $\alpha$-gapped repe...
We prove that a random word of length n over a k-Ary fixed alphabet contains, on expectation, Θ(√n) ...
For alpha >=1, an alpha-gapped repeat in a word w is a factor uvu of w such that |uv| <= alpha * |u|...
We investigate the behavior of the periods and border lengths of random words over a fixed alphabet....
AbstractWe study the problem of finding, in a given word, all maximal gapped palindromes verifying t...
A gapped repeat (respectively, palindrome) occurring in a word $w$ is afactor $uvu$ (respectively, $...
AbstractA new martingale technique is developed to find formulas for the expected value and generati...
In this work we study some probabilistic models for the random generation of words over a given alph...
atteson. ~ p eaplant, biology, yale. edu We present algorithms for the exact computation of the prob...
AbstractWe present a complete analysis of the statistics of number of occurrences of a regular expre...
This paper describes a population model for word frequency distributions based on the Zipf-Mandelbro...
International audienceIn this paper, me give an overview about the different results existing on the...
International audienceGiven a set of words and a probability model for random texts, we are interest...
Abstract. We consider the sequence comparison problem, also known as “hidden ” pattern problem, wher...
This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent fac...
International audienceWe give a probabilistic analysis of parameters related to $\alpha$-gapped repe...
We prove that a random word of length n over a k-Ary fixed alphabet contains, on expectation, Θ(√n) ...
For alpha >=1, an alpha-gapped repeat in a word w is a factor uvu of w such that |uv| <= alpha * |u|...
We investigate the behavior of the periods and border lengths of random words over a fixed alphabet....
AbstractWe study the problem of finding, in a given word, all maximal gapped palindromes verifying t...
A gapped repeat (respectively, palindrome) occurring in a word $w$ is afactor $uvu$ (respectively, $...
AbstractA new martingale technique is developed to find formulas for the expected value and generati...
In this work we study some probabilistic models for the random generation of words over a given alph...
atteson. ~ p eaplant, biology, yale. edu We present algorithms for the exact computation of the prob...
AbstractWe present a complete analysis of the statistics of number of occurrences of a regular expre...
This paper describes a population model for word frequency distributions based on the Zipf-Mandelbro...
International audienceIn this paper, me give an overview about the different results existing on the...
International audienceGiven a set of words and a probability model for random texts, we are interest...
Abstract. We consider the sequence comparison problem, also known as “hidden ” pattern problem, wher...
This article shows tight upper and lower bounds on the number of occurrences of maximal-exponent fac...