Pages that link to "Item:Q4261296"
From MaRDI portal
The following pages link to Exact distribution of word occurrences in a random sequence of letters (Q4261296):
Displaying 35 items.
- Omnibus sequences, coupon collection, and missing word counts (Q352894) (← links)
- First occurrence of a word among the elements of a finite dictionary in random sequences of letters (Q428640) (← links)
- On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials (Q479488) (← links)
- Occurrence of structured motifs in random sequences: arbitrary number of boxes (Q534349) (← links)
- A new method of approximating the probability of matching common words in multiple random sequences (Q607627) (← links)
- On waiting time distributions associated with compound patterns in a sequence of multi-state trials (Q730765) (← links)
- Waiting times for clumps of patterns and for structured motifs in random sequences (Q876489) (← links)
- String matching and 1d lattice gases (Q878347) (← links)
- Waiting time problem for an almost perfect match. (Q1423102) (← links)
- Exact distribution of the distances between any occurrences of a set of words (Q1603026) (← links)
- Exact distribution of the occurrence number for \(K\)-tuples over an alphabet of non-equal probability letters (Q1764481) (← links)
- Distribution of base pair alternations in a periodic DNA chain: application of Pólya counting to a physical system (Q1799398) (← links)
- Joint distributions associated with patterns, successes and failures in a sequence of multi-state trials (Q1881010) (← links)
- Random and uniform generation of words (Q1917516) (← 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)
- Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains (Q2404176) (← links)
- Numerical characteristics of word frequencies and their application to dissimilarity measure for sequence comparison (Q2413831) (← links)
- Statistical simulation and the distribution of distances between identical elements in a random sequence (Q2445686) (← links)
- On the normal approximation for the distribution of the number of simple or compound patterns in a random sequence of multi-state trials (Q2644305) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences (Q3085590) (← links)
- Moderate Deviations for Word Counts in Biological Sequences (Q3402056) (← links)
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain (Q3435393) (← links)
- On Discrete Time Semi-Markov Chains and Applications in Words Occurrences (Q3634538) (← links)
- Records in geometrically distributed words: Sum of positions (Q3649422) (← links)
- Counts of long aligned word matches among random letter sequences (Q3757093) (← links)
- (Q4242388) (← links)
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach (Q4819503) (← 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)
- Exact distribution of word counts in shuffled sequences (Q5475392) (← links)
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains (Q5488994) (← links)
- Digital search trees and chaos game representation (Q5851009) (← links)
- Computation of exact probabilities associated with overlapping pattern occurrences (Q6600377) (← links)
