Pages that link to "Item:Q938109"

The following pages link to Multiple pattern matching: a Markov chain approach (Q938109):

Displaying 14 items.

• Large deviation properties for patterns (Q396708) (← links)
• Construction of minimal deterministic finite automata from biological motifs (Q627199) (← links)
• Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
• An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← links)
• Stochastic analysis of minimal automata growth for generalized strings (Q2176399) (← links)
• Moments of the count of a regular expression in a heterogeneous random sequence (Q2283677) (← links)
• Faster exact distributions of pattern statistics through sequential elimination of states (Q2397054) (← links)
• Approximation of sojourn-times via maximal couplings: motif frequency distributions (Q2510394) (← links)
• Analytic combinatorics for computing seeding probabilities (Q2633234) (← links)
• Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences (Q3085590) (← links)
• Distribution of Clump Statistics for a Collection of Words (Q3108475) (← links)
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics (Q3506945) (← links)
• Minimal auxiliary Markov chains through sequential elimination of states (Q5085915) (← links)
• Using a Chen-Stein identity to obtain low variance simulation estimators (Q6104958) (← links)