Abstract
We observe m independent and identically distributed binary Markov chains and look for simultaneous occurrences of runs in several of them. We are interested in the distribution of the maximum number of simultaneous runs on finite time intervals. First we introduce a natural exact approach and also explain why it fails to calculate the required probabilities. Then we find exact upper and lower bounds for the probability of interest. We apply these results to detect genomic deletions in cancer patients.
| Original language | English |
|---|---|
| Pages (from-to) | n/a |
| Journal | Methodology and Computing in Applied Probability |
| Volume | 11 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2009 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 3 Good Health and Well-being
Fingerprint
Dive into the research topics of 'Simultaneous Occurrences of Runs in Independent Markov Chains'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver