Waiting times for clumps of patterns and for structured motifs in random sequences
DOI10.1016/J.DAM.2005.07.016zbMATH Open1112.60055OpenAlexW2038088862MaRDI QIDQ876489FDOQ876489
Authors: Valeri T. Stefanov, Stéphane Robin, Sophie Schbath 
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
Recommendations
Characteristic functions; other transforms (60E10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Protein sequences, DNA sequences (92D20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cites Work
- Title not available (Why is that?)
- A unified approach to word occurrence probabilities
- Numerical inversion of probability generating functions
- Title not available (Why is that?)
- 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 the distances between any occurrences of a set of words
- Exact distribution of word occurrences in a random sequence of letters
- Periods in strings
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
Cited In (11)
- Minimal auxiliary Markov chains through sequential elimination of states
- Occurrence of structured motifs in random sequences: arbitrary number of boxes
- On waiting time for reversed patterns in random sequences
- Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences
- Approximation of sojourn-times via maximal couplings: motif frequency distributions
- Waiting for regulatory sequences to appear
- On the stochastic ordering of waiting times for patterns in sequences of random digits
- A note on occurrence of gapped patterns in i.i.d. Sequences
- Simultaneous occurrences of runs in independent Markov chains
- Distribution of clump statistics for a collection of words
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
This page was built for publication: Waiting times for clumps of patterns and for structured motifs in random sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876489)
