Pages that link to "Item:Q1585335"
From MaRDI portal
The following pages link to A unified approach to word occurrence probabilities (Q1585335):
Displayed 10 items.
- Waiting times for clumps of patterns and for structured motifs in random sequences (Q876489) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- Shuffling biological sequences with motif constraints (Q935837) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- Waiting time and complexity for matching patterns with automata (Q1014407) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain (Q3435393) (← links)
- A Compound Poisson Model for Word Occurrences in DNA Sequences (Q3435725) (← links)
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics (Q3506945) (← links)
- Markov Additive Processes and Repeats in Sequences (Q5443748) (← links)