An Erdős-Rényi law with shifts
From MaRDI portal
Publication:1071378
DOI10.1016/0001-8708(85)90003-9zbMath0586.60031OpenAlexW1967191258WikidataQ104671667 ScholiaQ104671667MaRDI QIDQ1071378
Michael S. Waterman, Richard Arratia
Publication date: 1985
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(85)90003-9
convergence ratecomparison of DNA sequencesErdős- Rényi law of large numbersErdős-Rényi law with shiftsmatching consecutive subsequencesmatching cubes and rectangles
Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Genetics and epigenetics (92D10)
Related Items (15)
Maximal success durations for a semi-Markov process ⋮ Longest runs in coin tossing ⋮ On the longest block in Lüroth expansion ⋮ Matching strings in encoded sequences ⋮ Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems ⋮ On the shortest distance between orbits and the longest common substring problem ⋮ An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences ⋮ A phase transition for the minimum free energy of secondary structures of a random RNA ⋮ Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs ⋮ Shortest distance between multiple orbits and generalized fractal dimensions ⋮ A note on the longest matching consecutive subsequence ⋮ On longest matching consecutive subsequence ⋮ Longest common substring for random subshifts of finite type ⋮ Matching of observations of dynamical systems, with applications to sequence matching ⋮ Matching rectangles in d-dimensions: Algorithms and laws of large numbers
Cites Work
This page was built for publication: An Erdős-Rényi law with shifts
