Common Subsequences and Supersequences and their Expected Length

DOI10.1017/S096354839800368XMaRDI QIDQ4238165zbMATH OpenOpenAlexWikidataFDO

Authors Vlado Dančík

Publication date 13 April 1999

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096354839800368x

zbMATH Keywords

string matchingtext comparison

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• LATIN 2004: Theoretical Informatics
• Expected length of the longest common subsequence for large alphabets
• Upper bounds for the expected length of a longest common subsequence of two binary sequences
• The rate of convergence of the mean length of the longest common subsequence
• Improved bounds on the average length of longest common subsequences

Cited in

(9)

• A central limit theorem for the length of the longest common subsequences in random words
• Upper bounds for the expected length of a longest common subsequence of two binary sequences
• Length of the longest common subsequence between overlapping words
• On a speculated relation between Chvàtal-Sankoff constants of several sequences
• The rate of convergence of the mean length of the longest common subsequence
• Longest common subsequences in sets of words
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• Expected length of the longest common subsequence for large alphabets
• LATIN 2004: Theoretical Informatics

This page was built for publication: Common Subsequences and Supersequences and their Expected Length

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