Pages that link to "Item:Q1293550"
From MaRDI portal
The following pages link to Bounding the expected length of longest common subsequences and forests (Q1293550):
Displaying 17 items.
- 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)
- Lower bounds for moments of global scores of pairwise Markov chains (Q1747794) (← links)
- Periodic words, common subsequences and frogs (Q2135271) (← links)
- Standard deviation of the longest common subsequence (Q2270612) (← links)
- Letter change bias and local uniqueness in optimal sequence alignments (Q2440343) (← links)
- Approximation to the mean curve in the LCS problem (Q2476294) (← links)
- Expected length of the longest common subsequence for large alphabets (Q2573406) (← links)
- On a Speculated Relation Between Chvátal–Sankoff Constants of Several Sequences (Q3552511) (← links)
- Upper bounds for the expected length of a longest common subsequence of two binary sequences (Q4845082) (← links)
- On the rate of convergence for the length of the longest common subsequences in hidden Markov models (Q5226258) (← links)
- (Q5390355) (← links)
- Large deviations-based upper bounds on the expected relative length of longest common subsequences (Q5395363) (← links)
- A Formula for the Mean Length of the Longest Common Subsequence (Q5853068) (← links)
- LATIN 2004: Theoretical Informatics (Q5901650) (← links)
- Bounds and estimates on the average edit distance (Q6536246) (← links)
