Minimal auxiliary Markov chains through sequential elimination of states

DOI10.1080/03610918.2017.1406505MaRDI QIDQ5085915zbMATH OpenOpenAlexFDO

Authors 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

completion stringsfailure statesMarkov chain embeddingminimal deterministic finite automatonspaced seed coveragestructured motifs

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• p-values for the discrete scan statistic through slack variables
• Distribution of clump statistics for a collection of words
• Distribution of statistics of hidden state sequences through the sum-product algorithm
• Distribution Theory of Runs: A Markov Chain Approach
• Distributions associated with general runs and patterns in hidden Markov models
• DNA, words and models. Statistics of exceptional words. Translated from the 2003 French original
• Efficient string matching
• Faster exact distributions of pattern statistics through sequential elimination of states
• scientific article; zbMATH DE number 1955813 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3420624 (Why is no real title available?)
• Multiple pattern matching: a Markov chain approach
• On spaced seeds for similarity search
• Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
• Recurrent events in a Markov chain
• Runs, scans and urn model distributions: A unified Markov chain approach
• The exact joint distribution of the sum of heads and apparent size statistics of a ``tandem repeats finder algorithm
• Waiting time distribution of generalized later patterns
• Waiting times for clumps of patterns and for structured motifs in random sequences

Cited in

(2)

• Computation of exact probabilities associated with overlapping pattern occurrences
• Efficient computation of probability distributions of pattern statistics through auxiliary Markov chains -- some considerations

Describes a project that uses

Uses Software

• PatternHunter

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085915)