Exact distribution of word occurrences in a random sequence of letters

DOI10.1239/jap/1032374240zbMath0945.60008OpenAlexW2045894772MaRDI QIDQ4261296

Jean-Jacques Daudin, Stephane Robin

Publication date: 1 September 1999

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1032374240

zbMATH Keywords

waiting timeMarkov chainpatternsdistance between occurrencesgenome sequence analysis

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (25)

Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials ⋮ Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains ⋮ Context Trees, Variable Length Markov Chains and Dynamical Sources ⋮ On the normal approximation for the distribution of the number of simple or compound patterns in a random sequence of multi-state trials ⋮ The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach ⋮ Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains ⋮ Waiting times for clumps of patterns and for structured motifs in random sequences ⋮ String matching and 1d lattice gases ⋮ A new method of approximating the probability of matching common words in multiple random sequences ⋮ Numerical characteristics of word frequencies and their application to dissimilarity measure for sequence comparison ⋮ Clustering genomic words in human DNA using peaks and trends of distributions ⋮ Waiting time problem for an almost perfect match. ⋮ On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials ⋮ Occurrence of structured motifs in random sequences: arbitrary number of boxes ⋮ On waiting time distributions associated with compound patterns in a sequence of multi-state trials ⋮ Distribution of base pair alternations in a periodic DNA chain: application of Pólya counting to a physical system ⋮ Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata ⋮ Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences ⋮ On Discrete Time Semi-Markov Chains and Applications in Words Occurrences ⋮ Exact distribution of word counts in shuffled sequences ⋮ FLEXIBLE STATISTICAL MODELLING OF THE OCCURRENCES OF TRANSCRIPTION FACTOR BINDING SITES ALONG A DNA SEQUENCE ⋮ Moderate Deviations for Word Counts in Biological Sequences ⋮ Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains ⋮ Digital search trees and chaos game representation ⋮ Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain

This page was built for publication: Exact distribution of word occurrences in a random sequence of letters