Pages that link to "Item:Q4819503"
From MaRDI portal
The following pages link to The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach (Q4819503):
Displaying 16 items.
- Occurrence of structured motifs in random sequences: arbitrary number of boxes (Q534349) (← links)
- On waiting time distributions for patterns in a sequence of multistate trials (Q613163) (← links)
- On waiting time distributions associated with compound patterns in a sequence of multi-state trials (Q730765) (← links)
- A martingale approach to scan statistics (Q816583) (← links)
- Waiting times for clumps of patterns and for structured motifs in random sequences (Q876489) (← links)
- On occurrence of patterns in Markov chains: Method of gambling teams (Q952874) (← links)
- Sharp error terms for return time statistics under mixing conditions (Q1014064) (← links)
- On occurrence of subpattern and method of gambling teams (Q1039834) (← links)
- Clustering genomic words in human DNA using peaks and trends of distributions (Q2183652) (← links)
- Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains (Q2369300) (← links)
- On Discrete Time Semi-Markov Chains and Applications in Words Occurrences (Q3634538) (← links)
- FLEXIBLE STATISTICAL MODELLING OF THE OCCURRENCES OF TRANSCRIPTION FACTOR BINDING SITES ALONG A DNA SEQUENCE (Q5229486) (← links)
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata (Q5459921) (← links)
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains (Q5488994) (← links)
- On the number of word occurrences in a semi-Markov sequence of letters (Q5851025) (← links)
- Consecutive dual failure mode shock systems (Q6073151) (← links)
