Pages that link to "Item:Q2573406"
From MaRDI portal
The following pages link to Expected length of the longest common subsequence for large alphabets (Q2573406):
Displayed 14 items.
- Repetition-free longest common subsequence of random sequences (Q299053) (← links)
- Twins in words and long common subsequences in permutations (Q314398) (← links)
- Optimal alignments of longest common subsequences and their path properties (Q396006) (← links)
- The rate of the convergence of the mean score in random sequence comparison (Q433905) (← links)
- Thermodynamical approach to the longest common subsequence problem (Q937112) (← links)
- Optimality regions and fluctuations for Bernoulli last passage models (Q1664580) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- Lower bounds for moments of global scores of pairwise Markov chains (Q1747794) (← links)
- Sparse long blocks and the micro-structure of the longuest common subsequences (Q2249281) (← links)
- Standard deviation of the longest common subsequence (Q2270612) (← links)
- On suboptimal LCS-alignments for independent Bernoulli sequences with asymmetric distributions (Q2276418) (← links)
- A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530) (← links)
- On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences (Q3552511) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)