On the tail probability of the longest well-matching run.

DOI10.1016/S0167-7152(03)00091-9zbMath1116.60302OpenAlexW2035848143MaRDI QIDQ1423179

D. Massart

Publication date: 14 February 2004

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-7152(03)00091-9

zbMATH Keywords

Markov chain embedding\(k\)-Interrupted runRun test

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (3)

Waiting time problem for an almost perfect match. ⋮ Waiting time for an almost perfect run and applications in statistical process control ⋮ Run Statistics Defined on the Multicolor URN Model

Cites Work

• Unnamed Item
• Unnamed Item
• The Erdős-Rényi law in distribution, for coin tossing and sequence matching
• An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences
• Distribution Theory of Runs: A Markov Chain Approach
• On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
• Distribution of the scan statistic for a sequence of bistate trials
• On a Markov chain approach for the study of reliability structures
• Statistical methods in bioinformatics: an introduction

This page was built for publication: On the tail probability of the longest well-matching run.