A note on the expected length of the longest common subsequences of two i.i.d. random permutations

zbMath1391.05010arXiv1703.07691MaRDI QIDQ1648658

Christian Houdré, Chen Xu

Publication date: 27 June 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random permutationlongest common subsequence

Mathematics Subject Classification ID

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

Related Items (2)

A central limit theorem for the length of the longest common subsequences in random words ⋮ On the longest common subsequence of conjugation invariant random permutations

Cites Work

• Twins in words and long common subsequences in permutations
• Descending subsequences of random permutations
• The Surprising Mathematics of Longest Increasing Subsequences

This page was built for publication: A note on the expected length of the longest common subsequences of two i.i.d. random permutations