Occurrence of structured motifs in random sequences: arbitrary number of boxes
From MaRDI portal
Publication:534349
DOI10.1016/j.dam.2010.12.023zbMath1227.05026OpenAlexW2055080438MaRDI QIDQ534349
Valeri T. Stefanov, Sophie Schbath, Stephane Robin
Publication date: 17 May 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.023
Discrete-time Markov processes on general state spaces (60J05) Permutations, words, matrices (05A05) Markov renewal processes, semi-Markov processes (60K15)
Cites Work
- Unnamed Item
- Unnamed Item
- Waiting times for clumps of patterns and for structured motifs in random sequences
- Exact distribution of the distances between any occurrences of a set of words
- A note on occurrence of gapped patterns in i.i.d. Sequences
- Exact distribution of word occurrences in a random sequence of letters
- On some waiting time problems
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
This page was built for publication: Occurrence of structured motifs in random sequences: arbitrary number of boxes