Stochastic analysis of minimal automata growth for generalized strings
From MaRDI portal
Publication:2176399
Recommendations
Cites work
- An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
- Approximation of sojourn-times via maximal couplings: motif frequency distributions
- Compound Poisson approximation for Markov chains using Stein's method
- Construction of minimal deterministic finite automata from biological motifs
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- Distribution Theory of Runs: A Markov Chain Approach
- DNA, words and models. Statistics of exceptional words. Translated from the 2003 French original
- Efficient string matching
- Hidden word statistics
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain
- Introduction to Computational Genomics
- Markovian embeddings of general random strings
- Motif statistics.
- Multiple pattern matching: a Markov chain approach
- Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
- On pattern frequency occurrences in a Markovian sequence
- On patterns in sequences of random events
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- Recurrent events in a Markov chain
- Self-alignments in words and their applications
- The distribution of subword counts is usually normal
- Uniqueness of polynomial canonical representations
- Waiting time distributions of competing patterns in higher-order Markovian sequences
Cited in
(2)
This page was built for publication: Stochastic analysis of minimal automata growth for generalized strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176399)
