Matching rectangles in d-dimensions: Algorithms and laws of large numbers

DOI10.1016/0001-8708(85)90002-7zbMath0586.60030OpenAlexW2104021476WikidataQ115142856 ScholiaQ115142856MaRDI QIDQ1071377

Michael S. Waterman, Richard W. R. Darling

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)90002-7

zbMATH Keywords

convergence ratecomparison of DNA sequencesErdős- Rényi law of large numbersErdős-Rényi law with shiftsmatching consecutive subsequencesmatching cubes and rectangles

Mathematics Subject Classification ID

Strong limit theorems (60F15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Genetics and epigenetics (92D10)

Related Items (4)

Dynamic programming algorithms for picture comparison ⋮ Matching fixed rectangles in 2-dimension ⋮ Rate of convergence in the problem of the longest head-run ⋮ Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing

Cites Work

• An Erdős-Rényi law with shifts
• Expected waiting time for the visual response
• Long repetitive patterns in random sequences
• On the longest run of coincidences
• Approximations for Distributions of Scan Statistics
• Probabilities for a Generalized Birthday Problem
• Run Probabilities in Sequences of Markov-Dependent Trials
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matching rectangles in d-dimensions: Algorithms and laws of large numbers