A new method of approximating the probability of matching common words in multiple random sequences
From MaRDI portal
Publication:607627
DOI10.1007/s11009-010-9192-9zbMath1207.60007OpenAlexW2000670108MaRDI QIDQ607627
Publication date: 22 November 2010
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-010-9192-9
Poisson approximationlongest success run1-dependent sequencesgenetic sequencesmatching a common word
Probability distributions: general theory (60E05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A new method of approximating the probability of matching common words in multiple random sequences
- Estimating the distribution of one-dimensional discrete scan statistics viewed as extremes of 1-dependent stationary sequences
- Maximal length of common words among random letter sequences
- Periods in strings
- Matching among multiple random sequences
- First passage time for some stationary processes
- Exact distribution of word occurrences in a random sequence of letters
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- ON THE POWER FUNCTION OF THE LONGEST RUN AS A TEST FOR RANDOMNESS IN A SEQUENCE OF ALTERNATIVES
This page was built for publication: A new method of approximating the probability of matching common words in multiple random sequences
