Closeness to the diagonal for longest common subsequences in random words

DOI10.1214/16-ECP4029zbMath1338.05004arXiv0911.2031OpenAlexW2962822396MaRDI QIDQ287834

Christian Houdré, Heinrich III Matzinger

Publication date: 23 May 2016

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.2031

zbMATH Keywords

last passage percolationedit/Levensthein distancelongest common subsequencesoptimal alignments

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Large deviations (60F10)

Related Items (3)

Periodic words, common subsequences and frogs ⋮ Optimality regions and fluctuations for Bernoulli last passage models ⋮ A central limit theorem for the length of the longest common subsequences in random words

This page was built for publication: Closeness to the diagonal for longest common subsequences in random words