Counts of long aligned word matches among random letter sequences

DOI10.2307/1427422zbMath0621.60074OpenAlexW1993141184MaRDI QIDQ3757093

Friedemann Ost, Samuel Karlin

Publication date: 1987

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427422

zbMATH Keywords

longest success runcompound Poisson distributionfirst-passage problemblock matchasymptotic properties of the length of the longest wordmatching word locationsspectral properties of the Markov transition matricesstrong mixing stationary Markov chains

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Miscellaneous inequalities involving matrices (15A45)

Related Items (15)

Pattern matching between two non-aligned random sequences ⋮ Maximal success durations for a semi-Markov process ⋮ On coincidences of tuples in a binary tree with random labels of vertices ⋮ Matching among multiple random sequences ⋮ Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве ⋮ Limit distributions of extremal distances to the nearest neighbor ⋮ A Probabilistic Analysis of a String Editing Problem and its Variations ⋮ Improvements on the distribution of maximal segmental scores in a Markovian sequence ⋮ Generic properties of subgroups of free groups and finite presentations ⋮ On the height of digital trees and related problems ⋮ On coincidences of tuples in a \(q\)-ary tree with random labels of vertices ⋮ Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons ⋮ Shortest distance between multiple orbits and generalized fractal dimensions ⋮ A Phase Transition for the Distribution of Matching Blocks ⋮ Compound Poisson approximation of word counts in DNA sequences

This page was built for publication: Counts of long aligned word matches among random letter sequences