Let ( x₁ ,x₂ , ⋯ xₙ ) and ( x'₁ ,x'₂ , ⋯ x'ₙ , ) be two strings from an alphabet mathcalA, and let Lₙ denote their longest common subsequence. The probabilistic behavior of Lₙ is studied under various probability models for the x’s and $x'$’s.
No takes yet. Share an insight, caveat, or question.
Michael J. Steele (1982) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: