Expected length of the longest common subsequence for large alphabets
From MaRDI portal
Recommendations
- LATIN 2004: Theoretical Informatics
- Common Subsequences and Supersequences and their Expected Length
- The rate of convergence of the mean length of the longest common subsequence
- Large deviations-based upper bounds on the expected relative length of longest common subsequences
- On the asymptotic average length of a maximum common subsequence for words over a finite alphabet
Cites work
- A variational problem for random Young tableaux
- An Efron-Stein inequality for nonsymmetric statistics
- Bounding the expected length of longest common subsequences and forests
- scientific article; zbMATH DE number 3630761 (Why is no real title available?)
- scientific article; zbMATH DE number 2079331 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1549030 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- scientific article; zbMATH DE number 3373691 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Increasing sequences of independent points on the planar lattice
- Largest planar matching in random bipartite graphs
- Limit theorems for height fluctuations in a class of discrete space and time growth models
- Longest common subsequences of two random sequences
- Longest Increasing and Decreasing Subsequences
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- On the distribution of the length of the longest increasing subsequence of random permutations
- On the length of the longest monotone subsequence in a random permutation
- Recent progress in algebraic combinatorics
- Subadditive ergodic theory
Cited in
(36)- The rate of convergence of the mean length of the longest common subsequence
- Optimality regions and fluctuations for Bernoulli last passage models
- Longest common extension
- On finding a longest common palindromic subsequence
- Lower bounds for moments of global scores of pairwise Markov chains
- On rates of convergence for common subsequences and first passage time
- On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution
- Longest common substring for random subshifts of finite type
- Periodic words, common subsequences and frogs
- Universal arrays
- Sparse long blocks and the micro-structure of the longuest common subsequences
- Standard deviation of the longest common subsequence
- Order of the variance in the discrete Hammersley process with boundaries
- On suboptimal LCS-alignments for independent Bernoulli sequences with asymmetric distributions
- Anytime algorithms for the longest common palindromic subsequence problem
- A concentration bound for the longest increasing subsequence of a randomly chosen involution
- A central limit theorem for the length of the longest common subsequences in random words
- On the order of the central moments of the length of the longest common subsequences in random words
- Repetition-free longest common subsequence of random sequences
- Twins in words and long common subsequences in permutations
- Improved bounds on the average length of longest common subsequences
- On a speculated relation between Chvàtal-Sankoff constants of several sequences
- scientific article; zbMATH DE number 4024387 (Why is no real title available?)
- Optimal alignments of longest common subsequences and their path properties
- Common Subsequences and Supersequences and their Expected Length
- The rate of the convergence of the mean score in random sequence comparison
- Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
- Length of the longest common subsequence between overlapping words
- Longest common subsequences in sets of words
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
- A Formula for the Mean Length of the Longest Common Subsequence
- LATIN 2004: Theoretical Informatics
- scientific article; zbMATH DE number 7758340 (Why is no real title available?)
- On the asymptotic average length of a maximum common subsequence for words over a finite alphabet
- Extremal planar matchings of inhomogenous random bipartite graphs
- Thermodynamical approach to the longest common subsequence problem
This page was built for publication: Expected length of the longest common subsequence for large alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573406)
