Waiting time problem for an almost perfect match.

DOI10.1016/S0167-7152(03)00217-7zbMath1116.60342MaRDI QIDQ1423102

Qing Han, Katuomi Hirano

Publication date: 14 February 2004

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

zbMATH Keywords

analysisScan statisticsDNA sequenceAlmost perfect matchReliability of consecutive-\(k\) systemsWaiting time problems

Mathematics Subject Classification ID

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

Related Items (2)

Waiting time for an almost perfect run and applications in statistical process control ⋮ Distribution of waiting time until the \(r\)th occurrence of a compound pattern

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit distributional results in pattern formation
• On the tail probability of the longest well-matching run.
• Exact distribution of the distances between any occurrences of a set of words
• Waiting times for patterns in a sequence of multistate trials
• On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
• Exact distribution of word occurrences in a random sequence of letters
• Sooner and later waiting time problems for patterns in Markov dependent trials
• Joint distributions of successes, failures and patterns in enumeration problems
• On some waiting time problems
• Distribution of the scan statistic for a sequence of bistate trials
• Scan statistics

This page was built for publication: Waiting time problem for an almost perfect match.