Compound Poisson approximation of word counts in DNA sequences
From MaRDI portal
Publication:3127360
DOI10.1051/ps:1997100zbMath0869.60067OpenAlexW2047306036WikidataQ105584644 ScholiaQ105584644MaRDI QIDQ3127360
Publication date: 8 April 1997
Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104232
Markov chainsDNA sequencesPoisson approximationscompound Poisson distributionChen-Stein methodword countsword periods
Central limit and other weak theorems (60F05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items
Compound Poisson approximation: A user's guide ⋮ Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains. ⋮ Explicit distributional results in pattern formation ⋮ Waiting times for clumps of patterns and for structured motifs in random sequences ⋮ String matching and 1d lattice gases ⋮ Approximation for counts of 2-runs in a two state Markov chain ⋮ Cumulative distribution function of a geometric Poisson distribution ⋮ Malliavin calculus for marked binomial processes and applications ⋮ Poisson and compound Poisson approximations in conventional and nonconventional setups ⋮ Two sufficient conditions for Poisson approximations in the ferromagnetic Ising model ⋮ Comparing bacterial genomes from linear orders of patterns ⋮ An Evolutionary Distance Based on Maximal Unique Matches ⋮ Wavelet Thresholding Estimation in a Poissonian Interactions Model with Application to Genomic Data ⋮ Approximation for counts of head runs ⋮ Distribution of base pair alternations in a periodic DNA chain: application of Pólya counting to a physical system ⋮ Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences ⋮ Exact distribution of word counts in shuffled sequences ⋮ Moderate Deviations for Word Counts in Biological Sequences ⋮ Distribution of Clump Statistics for a Collection of Words ⋮ Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain ⋮ A Compound Poisson Model for Word Occurrences in DNA Sequences ⋮ The distributions of the frequency of occurrence of nucleotide subsequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials
- The multiple codes of nucleotide sequences
- Two moments suffice for Poisson approximations: The Chen-Stein method
- Periods in strings
- Compound Poisson approximation for nonnegative random variables via Stein's method
- Poisson approximation for dependent trials
- Mixing: Properties and examples
- Stein's method for compound Poisson approximation: The local approach
- Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
- Counts of long aligned word matches among random letter sequences
- A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
- Poisson approximations for runs and patterns of rare events
- Compound Poisson approximations for word patterns under Markovian hypotheses
- Improved Poisson approximations for word patterns
