Approximation of sojourn-times via maximal couplings: motif frequency distributions

DOI10.1007/s00285-013-0690-6zbMath1307.60101OpenAlexW2081247755WikidataQ51206270 ScholiaQ51206270MaRDI QIDQ2510394

Stephen R. Chestnut, Manuel E. Lladser

Publication date: 1 August 2014

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00285-013-0690-6

zbMATH Keywords

ergodicity coefficientsMarkov chainssojourn timegenomic sequence analysisnon-asymptotic approximations of distributions

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Discrete-time Markov processes on general state spaces (60J05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Stochastic approximation (62L20) Protein sequences, DNA sequences (92D20) Approximations to statistical distributions (nonasymptotic) (62E17)

Related Items

Stochastic analysis of minimal automata growth for generalized strings ⋮ \(V\)-geometrical ergodicity of Markov kernels via finite-rank approximations ⋮ On latent idealized models in symbolic datasets: unveiling signals in noisy sequencing data ⋮ Asymptotic of products of Markov kernels. Application to deterministic and random forward/backward products ⋮ Moments of the count of a regular expression in a heterogeneous random sequence

Uses Software

• Regexpcount

Cites Work

• Construction of minimal deterministic finite automata from biological motifs
• The distribution of subword counts is usually normal
• Markov chains and stochastic stability
• Strong stationary times via a new form of duality
• Multiple pattern matching: a Markov chain approach
• General state space Markov chains and MCMC algorithms
• Strong uniform times and finite random walks
• The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
• Probability approximations via the Poisson clumping heuristic
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Compound Poisson approximation for Markov chains using Stein's method
• Motif statistics.
• Perfect sampling of ergodic Harris chains
• Central limit theorems for additive functionals of Markov chains.
• Distribution of the number of successes in success runs of length at least \(k\) in higher-order Markovian sequences
• A User's Guide to Measure Theoretic Probability
• Practical Markov Chain Monte Carlo
• Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
• Uniqueness of polynomial canonical representations
• Markov renewal processes, counters and repeated sequences in Markov chains
• A New Approach to the Limit Theory of Recurrent Markov Chains
• Sojourn times in finite Markov processes
• Biological Sequence Analysis
• Perfect Simulation of Conditionally Specified Models
• Exact Sampling from a Continuous State Space
• Distribution Theory of Runs: A Markov Chain Approach
• Markovian embeddings of general random strings
• Waiting time distributions of competing patterns in higher-order Markovian sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation of sojourn-times via maximal couplings: motif frequency distributions