On the longest common increasing binary subsequence
From MaRDI portal
Publication:857117
DOI10.1016/j.crma.2006.10.004zbMath1106.60033OpenAlexW1981481562MaRDI QIDQ857117
Jüri Lember, Christian Houdré, Heinrich III Matzinger
Publication date: 14 December 2006
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2006.10.004
Related Items (12)
On the variance of the optimal alignments score for binary random words and an asymmetric scoring function ⋮ Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets ⋮ Optimal alignments of longest common subsequences and their path properties ⋮ On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words ⋮ A central limit theorem for the length of the longest common subsequences in random words ⋮ Letter change bias and local uniqueness in optimal sequence alignments ⋮ Thermodynamical approach to the longest common subsequence problem ⋮ Lower bounds for moments of global scores of pairwise Markov chains ⋮ On the limiting law of the length of the longest common and increasing subsequences in random words ⋮ Standard deviation of the longest common subsequence ⋮ On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution ⋮ Multi-state asymmetric simple exclusion processes
Cites Work
- Longest increasing subsequences of random colored permutations
- On the distribution of the length of the longest increasing subsequence of random permutations
- GUEs and queues
- Discrete orthogonal polynomial ensembles and the Plancherel measure
- Random words, Toeplitz determinants and integrable systems. II
- On the distributions of the lengths of the longest monotone subsequences in random words
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the longest common increasing binary subsequence
