On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
DOI10.1239/jap/1294170523zbMath1223.60056arXiv0909.4071OpenAlexW3100779835MaRDI QIDQ3067851
Publication date: 13 January 2011
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.4071
moment generating functiondeterministic finite automatonGram-Charlier seriesEdgeworth's expansionoptimal Markov chain embeddingpattern count
Exact distribution theory in statistics (62E15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Protein sequences, DNA sequences (92D20) Approximations to statistical distributions (nonasymptotic) (62E17)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Waiting time and complexity for matching patterns with automata
- Explicit distributional results in pattern formation
- A unified approach to word occurrence probabilities
- Motif statistics.
- Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
- Distribution of waiting time until the \(r\)th occurrence of a compound pattern
- Waiting times for patterns in a sequence of multistate trials
- Poisson approximations for runs and patterns of rare events
- Expected frequencies of DNA patterns using whittle's formula
- Assessing the Statistical Significance of Overrepresented Oligonucleotides
- Compound Poisson approximations for word patterns under Markovian hypotheses
- Numerical Solutions for Patterns Statistics on Markov Chains
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Combinatorial Pattern Matching
This page was built for publication: On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
