Asymptotic properties of words in semi-Markov sequences
From MaRDI portal
(Redirected from Publication:5866010)
Recommendations
- scientific article; zbMATH DE number 720683
- On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
- On the number of word occurrences in a semi-Markov sequence of letters
- Moderate deviations for word counts in biological sequences
- Absorption of Markov chains. Application to Fu algorithm in genomics
Cites work
- Discrete-Time Semi-Markov Model for Reliability and Survival Analysis
- Motif statistics.
- On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
- On the estimation of spread rate for a biological population
- On the number of word occurrences in a semi-Markov sequence of letters
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Probability Models for DNA Sequence Evolution
- Semi-Markov chains and hidden semi-Markov models toward applications. Their use in reliability and DNA analysis.
- Species abundance distribution results from a spatial analogy of central limit theorem
- Strong law of large numbers for hidden Markov chains indexed by Cayley trees
- The deterministic limit of the Moran model: a uniform central limit theorem
- Variance estimation in the central limit theorem for Markov chains
Cited in
(5)- Doob-Martin compactification of a Markov chain for growing random words sequentially
- Some results on modeling biological sequences and web navigation with a semi Markov chain
- The detection of words and an ordering for Markov chains
- Absorption of Markov chains. Application to Fu algorithm in genomics
- Investigating some attributes of periodicity in DNA sequences via semi-Markov modelling
This page was built for publication: Asymptotic properties of words in semi-Markov sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866010)