Sparse long blocks and the micro-structure of the longuest common subsequences
From MaRDI portal
Publication:2249281
DOI10.1007/s10955-014-0938-6zbMath1291.82053arXiv1204.1005OpenAlexW2106018628MaRDI QIDQ2249281
Christian Houdré, Heinrich III Matzinger, Saba Amsalu
Publication date: 10 July 2014
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.1005
Related Items (3)
Lower bounds on the generalized central moments of the optimal alignments score of random sequences ⋮ On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words ⋮ Sparse long blocks and the micro-structure of the longuest common subsequences
Cites Work
- Unnamed Item
- General methods of sequence comparison
- The rate of convergence of the mean length of the longest common subsequence
- Approximation of subadditive functions and convergence rates in limiting-shape results
- Sparse long blocks and the micro-structure of the longuest common subsequences
- Expected length of the longest common subsequence for large alphabets
- Improved bounds on the average length of longest common subsequences
- Longest common subsequences of two random sequences
- On the Limiting Shape of Young Diagrams Associated With Markov Random Words
This page was built for publication: Sparse long blocks and the micro-structure of the longuest common subsequences
