Pages that link to "Item:Q2573406"

The following pages link to Expected length of the longest common subsequence for large alphabets (Q2573406):

Displaying 32 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)
• On the asymptotic average length of a maximum common subsequence for words over a finite alphabet (Q671435) (← links)
• Thermodynamical approach to the longest common subsequence problem (Q937112) (← links)
• The rate of convergence of the mean length of the longest common subsequence (Q1345582) (← links)
• Optimality regions and fluctuations for Bernoulli last passage models (Q1664580) (← links)
• Longest common extension (Q1678103) (← links)
• On finding a longest common palindromic subsequence (Q1698702) (← links)
• Lower bounds for moments of global scores of pairwise Markov chains (Q1747794) (← links)
• On rates of convergence for common subsequences and first passage time (Q1894615) (← links)
• On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution (Q2042794) (← links)
• Longest common substring for random subshifts of finite type (Q2077341) (← links)
• Periodic words, common subsequences and frogs (Q2135271) (← links)
• Universal arrays (Q2231736) (← links)
• Sparse long blocks and the micro-structure of the longuest common subsequences (Q2249281) (← links)
• Standard deviation of the longest common subsequence (Q2270612) (← links)
• Order of the variance in the discrete Hammersley process with boundaries (Q2274475) (← links)
• On suboptimal LCS-alignments for independent Bernoulli sequences with asymmetric distributions (Q2276418) (← links)
• Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
• A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530) (← links)
• A central limit theorem for the length of the longest common subsequences in random words (Q2679696) (← links)
• On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences (Q3552511) (← links)
• (Q3766559) (← links)
• Common Subsequences and Supersequences and their Expected Length (Q4238165) (← links)
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings (Q4560193) (← links)
• Length of the Longest Common Subsequence between Overlapping Words (Q5220470) (← links)
• Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)
• A Formula for the Mean Length of the Longest Common Subsequence (Q5853068) (← links)
• LATIN 2004: Theoretical Informatics (Q5901650) (← links)
• (Q6084394) (← links)