On the asymptotic average length of a maximum common subsequence for words over a finite alphabet
From MaRDI portal
Publication:671435
DOI10.1016/0304-3975(95)00259-6zbMATH Open0871.68116OpenAlexW2055907875WikidataQ115926660 ScholiaQ115926660MaRDI QIDQ671435FDOQ671435
Authors: Ioan Tomescu 
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00259-6
Recommendations
- LATIN 2004: Theoretical Informatics
- Expected length of the longest common subsequence for large alphabets
- On the limiting law of the length of the longest common and increasing subsequences in random words
- On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution
- A central limit theorem for the length of the longest common subsequences in random words
- Improved bounds on the average length of longest common subsequences
- scientific article; zbMATH DE number 2079331
- Maximal length of common words among random letter sequences
- On the order of the central moments of the length of the longest common subsequences in random words
- On the longest common subsequence of Thue-Morse words
Cites Work
Cited In (8)
- Maximal Words in Sequence Comparisons Based on Subword Composition
- On the longest common subsequence of Thue-Morse words
- Longest common subsequences in sets of words
- Title not available (Why is that?)
- The Distribution of Prefix Overlap in Consecutive Dictionary Entries
- Expected length of the longest common subsequence for large alphabets
- LATIN 2004: Theoretical Informatics
- On the average length of lexicographic paths
This page was built for publication: On the asymptotic average length of a maximum common subsequence for words over a finite alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671435)
