scientific article; zbMATH DE number 2079331

MaRDI QIDQ4471286zbMATH OpenFDO

Authors George S. Lueker

Publication date 28 July 2004

zbMATH Keywords

finite automatonMarkov chain

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Improved bounds on the average length of longest common subsequences
• Large deviations-based upper bounds on the expected relative length of longest common subsequences
• Upper bounds for the expected length of a longest common subsequence of two binary sequences
• Bounding the expected length of longest common subsequences and forests
• On the convergence of upperbBound techniques for the average length of longest common subsequences

Cited in

(11)

• Bounding the expected length of longest common subsequences and forests
• An iterative approach to determining the length of the longest common subsequence of two strings
• Average length of the longest \(k\)-alternating subsequence
• Approximation to the mean curve in the LCS problem
• Expected length of the longest common subsequence for large alphabets
• Improved bounds on the average length of longest common subsequences
• The rate of the convergence of the mean score in random sequence comparison
• Upper bounds for the expected length of a longest common subsequence of two binary sequences
• On the convergence of upperbBound techniques for the average length of longest common subsequences
• 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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471286)