Maximal length of common words among random letter sequences

DOI10.1214/aop/1176991772zbMath0645.60034OpenAlexW2037789468MaRDI QIDQ1103263

Samuel Karlin, Friedemann Ost

Publication date: 1988

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176991772

zbMATH Keywords

uniform mixingexponential behaviour of the local match distributionmaximal length of common wordsstationary letter sequences type limit law

Mathematics Subject Classification ID

Large deviations (60F10) Limit theorems in probability theory (60F99)

Related Items (12)

A comparison of scores of two protein structures with foldings ⋮ Pattern matching between two non-aligned random sequences ⋮ Longest runs in coin tossing ⋮ Matching among multiple random sequences ⋮ Duality between the local score of one sequence and constrained hidden Markov model ⋮ A new method of approximating the probability of matching common words in multiple random sequences ⋮ On the asymptotic normality conditions for the number of repetitions in a stationary random sequence ⋮ On the shortest distance between orbits and the longest common substring problem ⋮ A phase transition for the minimum free energy of secondary structures of a random RNA ⋮ Shortest distance between multiple orbits and generalized fractal dimensions ⋮ Longest common substring for random subshifts of finite type ⋮ The asymptotics of waiting times between stationary processes, allowing distortion

This page was built for publication: Maximal length of common words among random letter sequences