Minimal auxiliary Markov chains through sequential elimination of states

DOI10.1080/03610918.2017.1406505OpenAlexW2793117015MaRDI QIDQ5085915

Donald E. K. Martin

Publication date: 30 June 2022

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610918.2017.1406505

zbMATH Keywords

Markov chain embeddingfailure statesminimal deterministic finite automatonspaced seed coveragecompletion stringsstructured motifs

Mathematics Subject Classification ID

Statistics (62-XX)

Uses Software

• PatternHunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The exact joint distribution of the sum of heads and apparent size statistics of a ``tandem repeats finder algorithm
• Waiting times for clumps of patterns and for structured motifs in random sequences
• Multiple pattern matching: a Markov chain approach
• Waiting time distribution of generalized later patterns
• On spaced seeds for similarity search
• Runs, scans and urn model distributions: A unified Markov chain approach
• Faster exact distributions of pattern statistics through sequential elimination of states
• Distributions associated with general runs and patterns in hidden Markov models
• Distribution of statistics of hidden state sequences through the sum-product algorithm
• Distribution of Clump Statistics for a Collection of Words
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
• Efficient string matching
• Distribution Theory of Runs: A Markov Chain Approach
• Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
• Recurrent events in a Markov chain
• p-values for the Discrete Scan Statistic through Slack Variables

This page was built for publication: Minimal auxiliary Markov chains through sequential elimination of states