On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution

DOI10.1214/21-EJP612MaRDI QIDQ2042794

Clément Deslandes, Christian Houdré

Publication date: 21 July 2021

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

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

zbMATH Keywords

weak convergencerandom matriceslast passage percolationlongest common subsequencesrandom wordsoptimal alignmentlongest increasing subsequences

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Random matrices (algebraic aspects) (15B52)

Related Items (1)

A central limit theorem for the length of the longest common subsequences in random words

Cites Work

• Unnamed Item
• On the limiting law of the length of the longest common and increasing subsequences in random words
• On the longest common increasing binary subsequence
• Expected length of the longest common subsequence for large alphabets
• On the longest increasing subsequence for finite and countable alphabets
• On the Limiting Shape of Young Diagrams Associated With Markov Random Words
• On the rate of convergence for the length of the longest common subsequences in hidden Markov models

This page was built for publication: On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution