Digital search trees and chaos game representation
DOI10.1051/ps:2007043zbMath1189.60021arXivmath/0605719OpenAlexW2101850191MaRDI QIDQ5851009
Nicolas Pouyanne, Peggy Cénac, Brigitte Chauvin, Stéphane Ginouillac
Publication date: 21 January 2010
Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0605719
strong convergenceasymptotic behaviourDSTrandom treedigital search treeinsertion depthCGRlength of branches
Combinatorics on words (68R15) Combinatorial probability (60C05) Protein sequences, DNA sequences (92D20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A martingale approach to scan statistics
- Asymptotical growth of a class of random trees
- An extreme value theory for long head runs
- A diffusion limit for a class of randomly-growing binary trees
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- Explicit distributional results in pattern formation
- A unified approach to word occurrence probabilities
- The variance of the height of digital search trees
- Bounds for Reliability of Large Consecutive-K-out-of-N:F Systems with Unequal Component Reliability
- On the Length of the Longest Head-Run for a Markov Chain with Two States
- How many random digits are required until given sequences are obtained?
- Exact distribution of word occurrences in a random sequence of letters
- Distribution Theory of Runs: A Markov Chain Approach
- On the Probabilities of Large Deviations for Sums of Independent Random Variables
- Test on the Structure of Biological Sequences via Chaos Game Representation
This page was built for publication: Digital search trees and chaos game representation
