Waiting times for clumps of patterns and for structured motifs in random sequences
From MaRDI portal
Publication:876489
DOI10.1016/j.dam.2005.07.016zbMath1112.60055MaRDI QIDQ876489
Sophie Schbath, Stephane Robin, Valeri T. Stefanov
Publication date: 18 April 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.07.016
60E10: Characteristic functions; other transforms
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
92D20: Protein sequences, DNA sequences
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Minimal auxiliary Markov chains through sequential elimination of states, Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata, Occurrence of structured motifs in random sequences: arbitrary number of boxes, Simultaneous occurrences of runs in independent Markov chains, A note on occurrence of gapped patterns in i.i.d. Sequences, Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences, Distribution of Clump Statistics for a Collection of Words
Cites Work
- Unnamed Item
- Unnamed Item
- Periods in strings
- Numerical inversion of probability generating functions
- A unified approach to word occurrence probabilities
- Exact distribution of the distances between any occurrences of a set of words
- Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov Chains
- Compound Poisson approximation of word counts in DNA sequences
- Exact distribution of word occurrences in a random sequence of letters
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
