The Occurrence of Sequence Patterns in Repeated Dependent Experiments
From MaRDI portal
Recommendations
Cited in
(12)- On occurrence of subpattern and method of gambling teams
- How long does it take to see a flat Brownian path on the average?
- Explicit distributional results in pattern formation
- Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
- Waiting times and stopping probabilities for patterns in Markov chains
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- Stopping Probabilities for Patterns in Markov Chains
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
- A martingale approach to scan statistics
- String matching and 1d lattice gases
This page was built for publication: The Occurrence of Sequence Patterns in Repeated Dependent Experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3212086)