Pages that link to "Item:Q3506945"
From MaRDI portal
The following pages link to Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics (Q3506945):
Displaying 10 items.
- Set intersection and sequence matching with mismatch counting (Q294918) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Construction of minimal deterministic finite automata from biological motifs (Q627199) (← links)
- Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
- Optimal pattern matching algorithms (Q1734696) (← links)
- An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← 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)
- Distribution of Clump Statistics for a Collection of Words (Q3108475) (← links)
- Minimal auxiliary Markov chains through sequential elimination of states (Q5085915) (← links)
