Distribution of Clump Statistics for a Collection of Words

DOI10.1239/jap/1324046018zbMath1250.62012MaRDI QIDQ3108475

Deidra A. Coleman, Donald E. K. Martin

Publication date: 4 January 2012

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1324046018

zbMATH Keywords

deterministic finite automaton; clumps of a pattern; coarsest partition

Mathematics Subject Classification ID

62E15: Exact distribution theory in statistics

68Q45: Formal languages and automata

62P99: Applications of statistics

60C05: Combinatorial probability

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

Related Items

p-values for the Discrete Scan Statistic through Slack Variables, Distributions of pattern statistics in sparse Markov models, Moments of the count of a regular expression in a heterogeneous random sequence, Faster exact distributions of pattern statistics through sequential elimination of states

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Compound Poisson approximation of word counts in DNA sequences
• Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
• Markov renewal processes, counters and repeated sequences in Markov chains
• Efficient string matching
• Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
• Waiting time distributions of competing patterns in higher-order Markovian sequences