REVIEW
Expected Length of the Longest Common Subsequence of Multiple Strings
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Expected Length of the Longest Common Subsequence of Multiple Strings
read the original abstract
We study the generalized Chv\'atal-Sankoff constant $\gamma_{k,d}$, which represents the normalized expected length of the longest common subsequence (LCS) of $d$ independent uniformly random strings over an alphabet of size $k$. We derive asymptotically tight bounds for $\gamma_{2,d}$, establishing that $\gamma_{2,d} = \frac{1}{2} + \Theta\left(\frac{1}{\sqrt{d}}\right)$. We also derive asymptotically near-optimal bounds on $\gamma_{k,d}$ for $d\ge \Omega(\log k)$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.