Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 806875
- On finite Markov chain imbedding and its applications
- Multi-parametric classification of automaton Markov models based on the sequences they generate
- A structured pattern matrix algorithm for multichain Markov decision processes
- Efficient modelling and generation of Markov automata
- Markov chains and unambiguous automata
- Detection of embeddings in binary Markov chains
- Multiple pattern matching: a Markov chain approach
- scientific article; zbMATH DE number 2173743
- Markov models for pattern recognition. From theory to applications
Cites work
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- ARPACK Users' Guide
- Cumulative distribution function of a geometric Poisson distribution
- Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
- Distribution Theory of Runs: A Markov Chain Approach
- Exact distribution of the distances between any occurrences of a set of words
- Exact distribution of word occurrences in a random sequence of letters
- Explicit distributional results in pattern formation
- Explicit Distributional Results In Pattern Formation II
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 947423 (Why is no real title available?)
- Joint distributions of successes, failures and patterns in enumeration problems
- Markov renewal processes, counters and repeated sequences in Markov chains
- Motif statistics.
- Numerical Solutions for Patterns Statistics on Markov Chains
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
- On some waiting time problems
- String overlaps, pattern matching, and nontransitive games
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- The Occurrence of Sequence Patterns in Repeated Dependent Experiments
- Waiting time and complexity for matching patterns with automata
- Waiting times for clumps of patterns and for structured motifs in random sequences
- Waiting times for patterns in a sequence of multistate trials
Cited in
(23)- An algorithm to compute the character access count distribution for pattern matching algorithms
- Moments of the count of a regular expression in a heterogeneous random sequence
- Recursive equations in finite Markov chain imbedding
- Faster exact distributions of pattern statistics through sequential elimination of states
- Distributions associated with \((k_1,k_2)\) events on semi-Markov binary trials
- Analytic combinatorics for computing seeding probabilities
- On the First k Moments of the Random Count of a Pattern in a Multistate Sequence Generated by a Markov Source
- Large deviations and full Edgeworth expansions for finite Markov chains with applications to the analysis of genomic sequences
- Distribution of clump statistics for a collection of words
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
- Large deviation properties for patterns
- On longest consecutive patterns in Markov chains
- Minimal auxiliary Markov chains through sequential elimination of states
- Markovian embeddings of general random strings
- Occurrence of structured motifs in random sequences: arbitrary number of boxes
- Two algorithms based on Markov chains and their application to recognition of protein coding genes in prokaryotic genomes
- Asymptotic properties of words in semi-Markov sequences
- A new method of approximating the probability of matching common words in multiple random sequences
- Computation of exact probabilities associated with overlapping pattern occurrences
- Efficient computation of probability distributions of pattern statistics through auxiliary Markov chains -- some considerations
- Distributions of pattern statistics in sparse Markov models
- Multiple pattern matching: a Markov chain approach
This page was built for publication: Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459921)
